VMO 1972 Problem 2
For any positive integer n, let f(n) = ∑ (-1) where the sum is taken over all odd d dividing n. Show that: f() = 1 f(p) = 2 for p a prime congruent to 1 mod 4 f(p) = 0 for p a prime congruent to 3 mod 4 f() = n+1 for p a prime congruent to 1 mod 4 f() = 1 for p a prime congruent to 3 mod 4, and n even f() = 0 for p a prime congruent to 3 mod 4, and n odd Show that f(mn) = f(m) f(n) for m and n relatively prime. Find f() and f(1980). Show how to calculate f(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.