Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Conjecture Prime
Replies: 33   Last Post: Apr 26, 2013 7:21 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Pubkeybreaker

Posts: 1,380
Registered: 2/12/07
Re: Conjecture Prime
Posted: Jun 25, 2009 8:55 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Jun 25, 8:50 am, "Dik T. Winter" <Dik.Win...@cwi.nl> wrote:
> In article <3add570f-17d2-4f1e-8854-bb60b5f27...@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.




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.