Re: prime theorems

In article <1157375134.243240.15890@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
<arunloboforever@xxxxxxxxx> wrote:
prove this:
if 1+a+a^2+a^3+....a^2k has a prime factor greater than a.a is an odd
prime.

That's almost always false. For example, the smallect case a = 4,
1 + 4 + ... + 4^(2k) always has a prime factor > 4 for k >= 1.


Mike Guy
.