Unfortunately, you are _technically_ incorrect. The fact that you can always find an N such that N-1 and N+1 are primes has been conjectured, but it has not been proven. Of course, it's a good as true but you can never be sure. Still a good starting place though.
The algorithm that tye is probably referring to is one which states that you can find an arbitrarily long sequence of sequential composite numbers if you look high enough.
Here it is:
Let D be the length of the composite run.
Let us examine the sequence:
(D+1)!+2,(D+1)!+2,(D+1)!+3,...,(D+1)!+D+1
Then clearly the first term is divisible by 2 (since the factorial is defined as (1*2*...n)), and by the same logic the second term is divisible by 3, and the 3rd by four. Obviously (from the definition of a factorial), all the terms have a factor greater than 2, and this sequence of D numbers is thus composite. QED.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.