VMO 1992 Problem 2
For any positive integer n, let f(n) be the number of positive divisors of n which equal ±1 mod 10, and let g(n) be the number of positive divisors of n which equal ±3 mod 10. Show that f(n) ≥ g(n).
Community text Kalva (prase.cz mirror). Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.