Prime or Composite?


Is an integer Prime or Composite? Is there any proof an integer being Prime, other than it not being Composite i.e. it has no prime factors? Lists of potentially prime numbers or pseudo primes http://en.wikipedia.org/wiki/Pseudoprime have been identified using a variety of methods. The method below has possibly not been identified before (?)

Many primes can be written in the form, in multiple ways:

Pn = Pi + nPj#

Where i and j are related thus:

(to be continued)

Take any Integer and find the largest p# that is smaller than the Integer. Take the largest multiple of p# away from the Integer that leaves a positive Integer. Is the remainder prime or composite? If composite the likelihood is that the Integer is not prime (but this is not guaranteed). However do the same with the next smaller p#, & follow the same procedure – is the remainder prime or composite. Continue using smaller p#, if the series of remainders are prime seem to be chances of a prime. If the remainders are composite it’s not possible to suggest that the prime factors are,  just that it is less likely to be prime

Advertisements
Aside | This entry was posted in Patterns, Prime Formula, Prime Number Distribution. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s