this is a Qs wich i can't solve can you help me??????????
Jo is practising pool on an American 9-ball pool table, where the balls are numbered from 1 to 9. Jo picks a geometric sequence and, if there are balls on the table whose numbers are in that sequence, then Jo pots all of them. Jo keeps picking geometric sequences (and potting the corresponding balls) until all nine balls have been potted.
If Jo is very good, and never misses a shot, what is the least number of geometric sequences that Jo needs to pick in order to clear the table?
2007-12-03
03:32:32
·
2 answers
·
asked by
vito v
1
in
Science & Mathematics
➔ Mathematics