The totient function 
counts the positive integers up to n that are relatively prime to n. The Carmichael totient conjecture states that for every integer there is a different integer with the same value of the totient.
counts the positive integers up to n that are relatively prime to n. The Carmichael totient conjecture states that for every integer there is a different integer with the same value of the totient. For example, the totient of 4 is 2, which is also the totient of 3 and 6. The totient of 17 is 16, which is also the totient of 32, 34, 40, 48, and 60.
Not all numbers can be totients: no odd numbers greater than 1 are totients, and an infinite number of even numbers are non-totients. However, the conjecture states that for all numbers that are totients, they are shared by at least two integers.
Write a function that takes a value x and returns the two smallest integers with a totient of x.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
