
Re: Conjecture Prime
Posted:
Jun 25, 2009 8:55 AM


On Jun 25, 8:50 am, "Dik T. Winter" <Dik.Win...@cwi.nl> wrote: > In article <3add570f17d24f1e8854bb60b5f27...@f30g2000vbf.googlegroups.com> Musatov <marty.musa...@gmail.com> writes: > ... > > Revised: > > The equation and opeation must be written as follows: > > > > (N*N)((N*N)+2)1 > > > > In instance of a composite number it will have two prime factors. > > N = 10, (N * N)(N * N + 2)  1 = 10199 = 7 * 31 * 47
Indeed. It can have arbitrarily many prime factors. Just solve n^4 + 2n^2  1 = 0 mod p_i for arbitrarily many p_i, Then use the Chinese Remainder Theorem to construct solutions modulo the product of p_i.

