Daily

Random

Practice set

Baltic Way 2025 · Problem 17

Number Theory

A positive integer is called brilliant if its positive divisors can be partitioned into two sets with an equal number of elements and an equal sum of elements. Find all possible values of the number of positive divisors of a brilliant number.

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Divisibility and factorization

Solutions

Solution

The answer is all even integers at least 88.

The number of divisors of a brilliant number must be even. Also, because the number itself belongs to one of the two groups, the sum of all proper divisors must be at least as large as the number. Hence prime powers are not brilliant: for a prime pp,

1+p+⋯+pk−1=pk−1p−1≤pk−1<pk.1+p+\cdots+p^{k-1}=\frac{p^k-1}{p-1}\le p^k-1<p^k.

We next rule out 44 and 66 divisors.

  • If a brilliant number had 44 divisors, it would be pqpq for primes p,qp,q. One proper divisor must join pqpq in its group, so each group would have sum at least pq+1pq+1. Thus

    pq+p+q+1≥2(pq+1),pq+p+q+1\ge2(pq+1),

    which is equivalent to 0≥(p−1)(q−1)0\ge(p-1)(q-1), impossible.

  • If a brilliant number had 66 divisors, it would be p2qp^2q for primes p,qp,q. Two distinct proper divisors must join p2qp^2q in its group, so each group has sum at least p2q+3p^2q+3. Therefore

    p2q+pq+q+p2+p+1≥2(p2q+3),p^2q+pq+q+p^2+p+1\ge2(p^2q+3),

    or

    2p2−6≥(p2−p−1)(q+1).2p^2-6\ge(p^2-p-1)(q+1).

    Since q+1≥3q+1\ge3, this implies

    2p2−6≥3(p2−p−1),2p^2-6\ge3(p^2-p-1),

    equivalently p2−3p+3≤0p^2-3p+3\le0, which is impossible because this quadratic is always positive.

Finally, we show that every even number 2n2n with n≥4n\ge4 occurs as the number of divisors of a brilliant number. Consider

N=2n−1⋅3.N=2^{n-1}\cdot3.

Its 2n2n positive divisors are

1,2,4,…,2n−11,2,4,\ldots,2^{n-1}

and

3,3⋅2,3⋅4,…,3⋅2n−1.3,3\cdot2,3\cdot4,\ldots,3\cdot2^{n-1}.

Each group in the desired partition must contain nn divisors and have half the total divisor sum. Both the desired sum and the desired number of terms would be achieved by

2⋅1,2⋅2,2⋅4,…,2⋅2n−1,2\cdot1,2\cdot2,2\cdot4,\ldots,2\cdot2^{n-1},

if all of these were divisors of NN. The only one that is not a divisor is the last term 2n2^n. Remove the two largest terms 2n−12^{n-1} and 2n2^n and replace them with 3⋅2n−13\cdot2^{n-1}; the sum is unchanged and the number of terms decreases by 11. To restore the number of terms, replace 44 by 11 and 33. Thus one group has exactly nn divisors and half the total sum, and its complement gives the other group. Hence NN is brilliant and has 2n2n divisors.

Therefore the possible numbers of divisors are exactly the even integers at least 88.

Contest context

Results from Baltic Way 2025

11 teams

Mean score
2.8 / 5
Scores of 4 or 5
5 / 11
Estonia
3 / 5

Score distribution

03
11
21
31
40
55
All team scores
TeamScore
Germany5 / 5
Estonia3 / 5
Poland5 / 5
Lithuania5 / 5
Norway5 / 5
Latvia5 / 5
Finland0 / 5
Denmark0 / 5
Sweden2 / 5
Ukraine0 / 5
Iceland1 / 5