Library / /179 of 520
Number theory Difficulty 5.9 AIME, harder Prove it
5. Show that if n is a positive integer having k distinct odd prime divisors, then ϕ(n) is divisible by 2k.
Solution
Want a route through all this instead of an archive?
The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.