|
||
Title: Arithmetic progression in Z - {m^2+n^5} Post by Aryabhatta on Sep 21st, 2008, 11:42pm Let S be the set of integers which cannot be written in the form m2+n5 for integers m, n. Show that S contains an infinitely long arithmetic progression. |
||
Title: Re: Arithmetic progression in Z - {m^2+n^5} Post by 1337b4k4 on Sep 21st, 2008, 11:59pm [hide]the numbers 0 - 10 squared mod 11 are 0,1,4,9,5,3,3,5,9,4,1 by calculation. all possible values of n^5 mod 11 are 0 (if n is congruent to 0) or 1/-1. This is true because (n^5)^2 is congruent to 1 by fermats little theorem, and I remember proving that the only quadratic roots of 1 in a prime ring are 1 and -1. (not a hard proof) Numbers congruent to 7 mod 11 cannot be formed by adding a number congruent to one of (0,1,3,4,5,9) and a number from (0,1,-1), thus the numbers congruent to 7 mod 11 are an example of such an infinite arithmetic progression.[/hide] |
||
Title: Re: Arithmetic progression in Z - {m^2+n^5} Post by Aryabhatta on Sep 22nd, 2008, 12:07am That was quick! Well done. |
||
Powered by YaBB 1 Gold - SP 1.4! Forum software copyright © 2000-2004 Yet another Bulletin Board |