Maths Olympiad Prep

For teachers / Printable sets /Stage 6 · Number theory

Stage 6 · Number theory

10 problems · National Olympiad, first round · mathsolympiadprep.com

The answer key prints on its own page at the end.

  1. Let TnT_n denotes the least natural such that
    n∣1+2+3+⋯+Tn=∑i=1Tnin\mid 1+2+3+\cdots +T_n=\sum_{i=1}^{T_n} i
    Find all naturals mm such that m≥Tmm\ge T_m.

    Iberoamerican Olympiad

    Number theory Solution and answer checking →

  2. Let nn be square with 4 digits, such that all its digits are less than 6. If we add 1 to each digit the resulting number is another square. Find nn

    Cono Sur Olympiad

    Number theory Solution and answer checking →

  3. Consider the number N=1000…0001N=1000\ldots 0001 consisting of the digit one followed by 2023 zeros, which are in turn followed by the digit one. How many proper divisors does NN have (that is, divisors strictly between 1 and NN) that are also written as a digit 1 followed by some positive number of zeros, followed in turn by a digit 1?

    1. A3
    2. B5
    3. C12
    4. D14
    5. E16

    Italian Mathematical Olympiad

    Number theory Solution and answer checking →

  4. Solve in Z2 \mathbb{Z}^2 the equation: x2(1+x2)=−1+21y. x^2\left( 1+x^2 \right) =-1+21^y.

    Danube Mathematical Competition

    Number theory Solution and answer checking →

  5. Let nn to be a positive integer. Given a set {a1,a2,…,an}\{ a_1, a_2, \ldots, a_n \} of integers, where ai∈{0,1,2,3,…,2n−1},a_i \in \{ 0, 1, 2, 3, \ldots, 2^n -1 \}, ∀i\forall i, we associate to each of its subsets the sum of its elements; particularly, the empty subset has sum of its elements equal to 00. If all of these sums have different remainders when divided by 2n2^n, we say that {a1,a2,…,an}\{ a_1, a_2, \ldots, a_n \} is *nn-complete*.

    For each nn, find the number of *nn-complete* sets.

    Iberoamerican Olympiad

    Number theory Solution and answer checking →

  6. Let DnD_n be the set of divisors of nn. Find all natural nn such that it is possible to split DnD_n into two disjoint sets AA and GG, both containing at least three elements each, such that the elements in AA form an arithmetic progression while the elements in GG form a geometric progression.

    China National Olympiad

    Number theory Solution and answer checking →

  7. Let pp be a prime number. Prove the following theorem of Euler: the equation p=x2+3y2p=x^{2}+3 y^{2} has a solution with x,y∈Zx, y \in \mathbb{Z} if and only if p=3p=3 or p≡1( mod 3)p \equiv 1(\bmod 3). (You may use the fact that the ring of integers of Q(−3)\mathbb{Q}(\sqrt{-3}) is a principal ideal domain.)

    Yau Science Award

    Number theory Solution and answer checking →

  8. Let m>1m>1 be an integer. Find the smallest positive integer nn, such that for any integers a1,a2,…,an;b1,b2,…,bna_1,a_2,\ldots ,a_n; b_1,b_2,\ldots ,b_n there exists integers x1,x2,…,xnx_1,x_2,\ldots ,x_n satisfying the following two conditions:

    i) There exists i∈{1,2,…,n}i\in \{1,2,\ldots ,n\} such that xix_i and mm are coprime

    ii) ∑i=1naixi≡∑i=1nbixi≡0(modm)\sum^n_{i=1} a_ix_i \equiv \sum^n_{i=1} b_ix_i \equiv 0 \pmod m

    China National Olympiad

    Number theory Solution and answer checking →

  9. Positive integers pp, aa and bb satisfy the equation p2+a2=b2p^2 + a^2 = b^2. Prove that if pp is a prime greater than 3, then aa is a multiple of 12 and 2(p+a+1)2(p + a + 1) is a perfect square.

    BMO Round 1 2015

    Number theory Solution and answer checking →

  10. We say that a positive integer is lazy if it has no prime divisor greater than 33. Prove that there are at most two lazy numbers strictly between two consecutive square numbers.

    KöMaL problem A 2018

    Number theory Solution and answer checking →

Answer key — Stage 6 · Number theory

Worked solutions for every problem are on the site, one page per problem.

  1. all numbers that are not powers of 2 greater than 1.{\text{all numbers that are not powers of 2 greater than 1.}} open
  2. 20252025 open
  3. AA open
  4. (0,0),(2,1),(−2,1)(0, 0), (2, 1), (-2, 1) open
  5. 2n(n−1)/22^{n(n-1)/2} open
  6. No such n exists\text{No such } n \text{ exists} open
  7. The equation ( p = x 2 + 3y 2 ) has a solution with ( x, y Z ) if and only if ( p = 3 ) or ( p 1 3 ).\text{The equation ( p = x 2 + 3y 2 ) has a solution with ( x, y Z ) if and only if ( p = 3 ) or ( p 1 3 ).} open
  8. 2ω(m)+12\omega(m) + 1 open
  9. Prove it — see the worked solution open
  10. Prove it — see the worked solution open

Problems belong to the competitions that set them. Each question on this sheet names the competition it came from, and the licences the material is used under are listed below. Free to copy for classroom use.

Apache-2.0 · CC-BY-4.0 · © UK Mathematics Trust; question papers published free at bmos.ukmt.org.uk · Rights held by KöMaL and the MATFUND Foundation