I Think I Have A Primality test based on the Lehmer´s totient problem
Introduction: Lehmer´s totient problem is a mathematical assertion which states that there does not exist a composite positive integer x that satisfies the following:
Let f(x) be Euler´s phi function
Property that composite numbers do not satisfy:
f(x) divides x1
If this conjecture was proved I could formulate a primality test based on Lehmer´s problem,the primality test would be as follows:
Let x be a positive integer
If f(x) divides x1 return PRIME
If f(x) does not divide x1 return COMPOSITE
Well this was what I wanted to share, thank you for reading
