I am trying to find all integer solutions to Euler's totient function
From a theorem in my book
I get
Now I am stuck because I dont know how to solve this, any suggestions?
I am trying to find all integer solutions to Euler's totient function
From a theorem in my book
I get
Now I am stuck because I dont know how to solve this, any suggestions?
Thank you,
When I find the prime factors and their exponents x and y, am I justified in saying that these are the only ones as prime factorization in unique?
Edit- Also if anyone could show how to solve using logarithms I would be interested in knowing.
Hi dnftp!
Yes. A prime factorization is unique.
So you get unique solutions for x and y.
I'm afraid that normal logarithms do not apply in number theory - they yield real numbers.Edit- Also if anyone could show how to solve using logarithms I would be interested in knowing.
As such they are not useful.
There is such a thing as a discrete logarithm, but let's not go there.
They are even harder to calculate than a large-number-prime-factorization.