Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Find every positive integer with . Use the formula: each prime dividing gives a factor of , so must divide . List the possible primes, then try their products and powers. Give how many such there are and the largest of them.
counts with . If , Euler's theorem gives
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. .
Step 1. The primes. If , then . So , and (the value gives , not prime).
Step 2. Powers. . The factor must divide , so only and can appear as higher powers, besides first powers.
Step 3. Try the cases. With : and . With (): with , so , giving , , . With (): with and , so , giving . With (): need another factor with , impossible.
Step 4. The list. .
Check. and .
Answer: numbers, the largest being .
Log in to join the discussion.
Loading…