Re: Pinoy math enthusiast finds fast way to decode RSA encryption

[Markus Senoner]

On Tue, 6 Feb 2001, Padmapani S Ganti wrote:
> I just wanted to add a thing to the prime number which i found
> independently and i do not know whether this has been achieved earlier or
> not but i have a way of proving that every prime is of the form
> (int)sq.root(1+24n)

May I add, that every prime is of the form (int)(1+n),
which is much more simpler to calculate.  I can prove this too.  :-)

Your formula simply gives a list of *all* numbers (some even multiple
times, the bigger n, the more results: for n=7 and n=8 both give 13,
while for n=6, the formula gives 12, which is not a prime).

:-)
Markus
--