Maths Olympiad Prep

Library / /14 of 18

Number theory Difficulty 8.1 Shortlist Prove it Balkan Mathematical Olympiad

Let nn be a positive integer, g(n)g(n) be the number of positive divisors of nn of the form 6k+16k + 1 and h(n)h(n) be the number of positive divisors of nn of the form 6k16k - 1, where kk is a nonnegative integer. Find all positive integers nn such that g(n)g(n) and h(n)h(n) have different parity.

Solution

Let n=2a3bp1α1psαsn = 2^a \cdot 3^b p_1^{\alpha_1} \dots p_s^{\alpha_s} where pi2,3p_i \neq 2, 3 for i=1,2,,si = 1, 2, \dots, s are distinct prime numbers. If tt is a divisor of nn of the form 6k±16k \pm 1, then tt is a divisor of p1α1psαsp_1^{\alpha_1} \dots p_s^{\alpha_s} (in other words, tt is not divisible by 22 or by 33). Also, all divisors of p1α1psαsp_1^{\alpha_1} \dots p_s^{\alpha_s} are of the form 6k±16k \pm 1. If g(n)g(n) and h(n)h(n) are of different parity then g(n)+h(n)g(n) + h(n) is odd. Therefore, the number p1α1psαsp_1^{\alpha_1} \dots p_s^{\alpha_s} has an odd number of divisors and since the number of divisors equals (α1+1)(αs+1)(\alpha_1 + 1) \dots (\alpha_s + 1) we conclude that p1α1psαsp_1^{\alpha_1} \dots p_s^{\alpha_s} is a perfect square. Hence, n=2a3bm2n = 2^a \cdot 3^b m^2.

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: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.