why are you interested in primes only?
for even numbers, -> ok, can be done with 4 squares
what about 15 for example? it is odd and not prime, why is it easier than 3, 5 or any other prime number?
Search found 4 matches
- Tue Dec 23, 2003 6:51 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10270 - Bigger Square Please...
- Replies: 25
- Views: 12734
- Thu Oct 23, 2003 9:57 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10198 - Counting
- Replies: 30
- Views: 19099
big nubmers
also, there are going to be very big numbers (being 64 bit ) after k becomes 70-80
nick
nick
- Thu Oct 23, 2003 9:50 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10198 - Counting
- Replies: 30
- Views: 19099
quick help
hey
use an array saveF[10001], to save already the computed values of f(k)
otherwise you compute the same values over and over, and it is veeeery slow
use an array saveF[10001], to save already the computed values of f(k)
otherwise you compute the same values over and over, and it is veeeery slow
- Thu Oct 23, 2003 9:40 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10213 - How Many Pieces of Land ?
- Replies: 54
- Views: 23858
10213 how to solve?!?
huh
for k points
is it the answer something like 2^k
can you suggest some recurrence relation
thanks!
nick
for k points
is it the answer something like 2^k
can you suggest some recurrence relation
thanks!
nick