I want to show there exists 2 constantssuch that:
where
,
whereis the largest number such that
I accomplished to show the following: (more or less trivial)
as n is prime
as
(i.e a power of only one prime)
otherwise (i.e. n+1 has at least 2 prime-divisors)
I believe these are useful observations, but I'm more or less stuck here. I hope someone can give me a little push in the right direction here...


LinkBack URL
About LinkBacks

