Maths Olympiad Prep

For teachers / Printable sets /Stage 5 · Number theory

Stage 5 · Number theory

10 problems · AIME late · mathsolympiadprep.com

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

  1. Veronica observes that 81⋅3=24381 \cdot 3=243 and 81⋅4=32481 \cdot 4=324 and wonders how many numbers mm there are with 10≤m≤9910 \leq m \leq 99 such that 3m=ABC3 m=A B C and 4m=CAB4 m=C A B, with A,BA, B and CC decimal digits (the cases in which one or more of the digits A,B,CA, B, C are equal to zero are also considered valid).

    1. A1
    2. B2
    3. C3
    4. D4
    5. E6

    Progetto Olimpiadi della Matematica - GARA di FEBBRAIO

    Number theory Solution and answer checking →

  2. For positive integers nn, mm, kk, let us write n≡m(modk)n \equiv m \pmod k if n−mn - m is divisible by kk. Let AA be the sum of all positive integers aa less than or equal to 20112011 for which a≡1(mod3)a \equiv 1 \pmod 3, and BB be the sum of all positive integers bb less than or equal to 20112011 for which b≡2(mod3)b \equiv 2 \pmod 3. Find the value of A−BA - B.

    Japan Mathematical Olympiad

    Number theory Solution and answer checking →

  3. What is the last digit of 11+22+33+⋯+1001001^{1}+2^{2}+3^{3}+\cdots+100^{100}?

    HMMT February

    Number theory Solution and answer checking →

  4. For any positive integer nn, let τ(n)\tau(n) denote the number of positive divisors of nn. If nn is a positive integer such that τ(n2)τ(n)=3\frac{\tau\left(n^{2}\right)}{\tau(n)}=3, compute τ(n7)τ(n)\frac{\tau\left(n^{7}\right)}{\tau(n)}.

    HMMT February

    Number theory Solution and answer checking →

  5. A prime number pp is twin if at least one of p+2p+2 or p−2p-2 is prime and sexy if at least one of p+6p+6 and p−6p-6 is prime.
    How many sexy twin primes (i.e. primes that are both twin and sexy) are there less than 10910^{9}? Express your answer as a positive integer NN in decimal notation; for example, 521495223. If your answer is in this form, your score for this problem will be max⁡{0,25−⌊110000∣A−N∣⌋}\max \left\{0,25-\left\lfloor\frac{1}{10000}|A-N|\right\rfloor\right\}, where AA is the actual answer to this problem. Otherwise, your score will be zero.

    HMMT February

    Number theory Solution and answer checking →

  6. Compute the sum of all two-digit positive integers xx such that for all three-digit (base 10) positive integers a‾b‾c‾,ifa‾b‾c‾\underline{a} \underline{b} \underline{c}, if \underline{a} \underline{b} \underline{c} is a multiple of xx, then the three-digit (base 10) number b‾c‾a‾\underline{b} \underline{c} \underline{a} is also a multiple of xx.

    HMMT February

    Number theory Solution and answer checking →

  7. Find all prime numbers pp such that y2=x3+4xy^{2}=x^{3}+4x has exactly pp solutions in integers modulo pp. In other words, determine all prime numbers pp with the following property: there exist exactly pp ordered pairs of integers (x,y)(x, y) such that x,y∈{0,1,…,p−1}x, y \in\{0,1, \ldots, p-1\} and p divides y2−x3−4xp \text{ divides } y^{2}-x^{3}-4x.

    HMMT February

    Number theory Solution and answer checking →

  8. Luca writes on a blackboard all the possible sequences consisting of 2017 distinct positive integers whose sum is 2016⋅2017⋅20182016 \cdot 2017 \cdot 2018. Having done this, he replaces each of these sequences with the greatest common divisor of its elements. When this lengthy operation is finished, what is the maximum among the numbers written on the blackboard?

    1. A2
    2. B2⋅20162 \cdot 2016
    3. C2⋅20172 \cdot 2017
    4. D2⋅20182 \cdot 2018
    5. E2016⋅20182016 \cdot 2018

    Gara di Febbraio

    Number theory Solution and answer checking →

  9. Let mm be a positive integer. Let d(n)d(n) denote the number of divisors of nn, and define the function F(x)=∑n=1105md(n)nxF(x)=\sum_{n=1}^{105^{m}} \frac{d(n)}{n^{x}}. Define the numbers a(n)a(n) to be the positive integers for which F(x)2=∑n=11052ma(n)nxF(x)^{2}=\sum_{n=1}^{105^{2 m}} \frac{a(n)}{n^{x}} for all real xx. Express a(105m)a\left(105^{m}\right) in terms of mm.

    HMMT February

    Number theory Solution and answer checking →

  10. Find the greatest positive integer xx such that 236+x23^{6+x} divides 2000!2000!

    Junior Balkan MO Shortlist

    Number theory Solution and answer checking →

Answer key — Stage 5 · Number theory

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

  1. CC open
  2. 13411341 open
  3. 00 open
  4. 2929 open
  5. 14621051462105 open
  6. 6464 open
  7. p=2 and p≡3( mod 4)p=2 \text{ and } p \equiv 3(\bmod 4) open
  8. BB open
  9. (m3+6m2+11m+66)3 OR (m+33)3\left(\frac{m^{3}+6 m^{2}+11 m+6}{6}\right)^{3} \text{ OR } \binom{m+3}{3}^{3} open
  10. 8383 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.

CC-BY-4.0 · Apache-2.0