Problem about squares

Peter Pein petsie at dordos.net
Fri Jan 11 17:30:16 CET 2008


oops... I messed it up (n, n+1, even, odd...)

for odd n, 2^n does it.

sorry,
Peter

Peter Pein schrieb:
> Well, then take 2^(n+1) for even n and 2^(n+1)+1 for odd n if this is not a
> square, else for odd n try 4^k*2^(n+1)+1 for k from 1 to somewhere until the
> result is not a square.
> .



-7 

> Does there exist a non-square number which is square (mod 2^n) for every n
> >= 0?






More information about the SeqFan mailing list