In summary, this conjecture is that every prime between 2 and [p(n)]^2 can be found by using a certain equation that is distributive over prime factors. The example given is that for 11, two numbers are created that each have a prime factor of it. These two numbers are then used to find a prime that is a factor of both, and this prime is then used to find the next prime. It is vaguely explained, but the main idea is that this equation can be used to find all of the primes between 2 and [p(n)]^2.
#36
Sariaht
357
0
Originally posted by HallsofIvy
Because i like short threads. Best wishes: Erik-Olof or Sariaht