Olympiad problems

2006 Estonia Team Selection Test, 6

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

1998 AMC 12/AHSME, 30

Tags: floor function , modular arithmetic , number theory , prime factorization

For each positive integer $n$, let \[a_n = \frac {(n + 9)!}{(n - 1)!}.\] Let $k$ denote the smallest positive integer for which the rightmost nonzero digit of $a_k$ is odd. The rightmost nonzero digit of $a_k$ is $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 9$

1950 AMC 12/AHSME, 21

Tags: prime factorization , number theory

The volume of a rectangular solid each of whose side, front, and bottom faces are $12\text{ in}^2$, $8\text{ in}^2$, and $6\text{ in}^2$ respectively is: $\textbf{(A)}\ 576\text{ in}^3 \qquad \textbf{(B)}\ 24\text{ in}^3 \qquad \textbf{(C)}\ 9\text{ in}^3 \qquad \textbf{(D)}\ 104\text{ in}^3 \qquad \textbf{(E)}\ \text{None of these}$

2014 Contests, 1

Tags: function , relatively prime , prime factorization

Prove that every nonzero coefficient of the Taylor series of $(1-x+x^2)e^x$ about $x=0$ is a rational number whose numerator (in lowest terms) is either $1$ or a prime number.

2009 China Team Selection Test, 3

Tags: induction , prime number , relatively prime , prime factorization , greatest common divisor , mobius function , number theory

Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$

2017 SDMO (High School), 2

Tags: prime factorization , number theory

There are $5$ accents in French, each applicable to only specific letters as follows: [list] [*] The cédille: ç [*] The accent aigu: é [*] The accent circonflexe: â, ê, î, ô, û [*] The accent grave: à, è, ù [*] The accent tréma: ë, ö, ü [/list] Cédric needs to write down a phrase in French. He knows that there are $3$ words in the phrase and that the letters appear in the order: \[cesontoiseaux.\] He does not remember what the words are and which letters have what accents in the phrase. If $n$ is the number of possible phrases that he could write down, then determine the number of distinct primes in the prime factorization of $n$.

2018 PUMaC Number Theory A, 2

Tags: prime factorization , number theory

For a positive integer $n$, let $f(n)$ be the number of (not necessarily distinct) primes in the prime factorization of $k$. For example, $f(1) = 0, f(2) = 1, $ and $f(4) = f(6) = 2$. let $g(n)$ be the number of positive integers $k \leq n$ such that $f(k) \geq f(j)$ for all $j \leq n$. Find $g(1) + g(2) + \ldots + g(100)$.

2011 Federal Competition For Advanced Students, Part 1, 1

Tags: quadratic , modular arithmetic , calculus , integration , prime factorization , number theory

Determine all integer triplets $(x,y,z)$ such that \[x^4+x^2=7^zy^2\mbox{.}\]

1998 South africa National Olympiad, 1

Tags: prime factorization , rational number , irrational number , logarithm , number theory

Is $\log_{10}{8}$ rational?

2000 Baltic Way, 14

Tags: inequalities , function , induction , prime factorization , number theory

Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.

2009 AMC 10, 25

Tags: modular arithmetic , prime factorization , number theory

For $ k>0$, let $ I_k\equal{}10\ldots 064$, where there are $ k$ zeros between the $ 1$ and the $ 6$. Let $ N(k)$ be the number of factors of $ 2$ in the prime factorization of $ I_k$. What is the maximum value of $ N(k)$? $ \textbf{(A)}\ 6\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 8\qquad \textbf{(D)}\ 9\qquad \textbf{(E)}\ 10$

2009 AMC 12/AHSME, 18

Tags: modular arithmetic , prime factorization , number theory

For $ k>0$, let $ I_k\equal{}10\ldots 064$, where there are $ k$ zeros between the $ 1$ and the $ 6$. Let $ N(k)$ be the number of factors of $ 2$ in the prime factorization of $ I_k$. What is the maximum value of $ N(k)$? $ \textbf{(A)}\ 6\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 8\qquad \textbf{(D)}\ 9\qquad \textbf{(E)}\ 10$

1997 IMO, 5

Tags: equation , prime factorization , number theory

Find all pairs $ (a,b)$ of positive integers that satisfy the equation: $ a^{b^2} \equal{} b^a$.

2023 Belarus Team Selection Test, 1.3

Tags: prime factorization , function , prime number , prime , number theory

Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$. (For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)

2021 Thailand TSTST, 1

Tags: prime factorization , divisor , number theory

For each positive integer $n$, let $\rho(n)$ be the number of positive divisors of $n$ with exactly the same set of prime divisors as $n$. Show that, for any positive integer $m$, there exists a positive integer $n$ such that $\rho(202^n+1)\geq m.$

2004 China Team Selection Test, 1

Tags: prime factorization , number theory

Let $ m_1$, $ m_2$, $ \cdots$, $ m_r$ (may not distinct) and $ n_1$, $ n_2$ $ \cdots$, $ n_s$ (may not distinct) be two groups of positive integers such that for any positive integer $ d$ larger than $ 1$, the numbers of which can be divided by $ d$ in group $ m_1$, $ m_2$, $ \cdots$, $ m_r$ (including repeated numbers) are no less than that in group $ n_1$, $ n_2$ $ \cdots$, $ n_s$ (including repeated numbers). Prove that $ \displaystyle \frac{m_1 \cdot m_2 \cdots m_r}{n_1 \cdot n_2 \cdots n_s}$ is integer.

2014 NIMO Problems, 3

Tags: prime number , prime factorization , number theory

Find the number of positive integers $n$ with exactly $1974$ factors such that no prime greater than $40$ divides $n$, and $n$ ends in one of the digits $1$, $3$, $7$, $9$. (Note that $1974 = 2 \cdot 3 \cdot 7 \cdot 47$.) [i]Proposed by Yonah Borns-Weil[/i]

Oliforum Contest II 2009, 1

Tags: function , modular arithmetic , prime factorization , number theory

Let $ \sigma(\cdot): \mathbb{N}_0 \to \mathbb{N}_0$ be the function from every positive integer $ n$ to the sum of divisors $ \sum_{d \mid n}{d}$ (i.e. $ \sigma(6) \equal{} 6 \plus{} 3 \plus{} 2 \plus{} 1$ and $ \sigma(8) \equal{} 8 \plus{} 4 \plus{} 2 \plus{} 1$). Find all primes $ p$ such that $ p \mid \sigma(p \minus{} 1)$. [i](Salvatore Tringali)[/i]

2005 Czech-Polish-Slovak Match, 6

Tags: modular arithmetic , diophantine equation , prime factorization , number theory

Determine all pairs of integers $(x, y)$ satisfying the equation \[y(x + y) = x^3- 7x^2 + 11x - 3.\]

MathLinks Contest 7th, 2.2

Tags: modular arithmetic , vector , prime factorization , number theory

For a prime $ p$ an a positive integer $ n$, denote by $ \nu_p(n)$ the exponent of $ p$ in the prime factorization of $ n!$. Given a positive integer $ d$ and a finite set $ \{p_1,p_2,\ldots, p_k\}$ of primes, show that there are infinitely many positive integers $ n$ such that $ \nu_{p_i}(n) \equiv 0 \pmod d$, for all $ 1\leq i \leq k$.

PEN A Problems, 69

Tags: modular arithmetic , prime factorization , divisibility theory , number theory

Prove that if the odd prime $p$ divides $a^{b}-1$, where $a$ and $b$ are positive integers, then $p$ appears to the same power in the prime factorization of $b(a^{d}-1)$, where $d=\gcd(b,p-1)$.

2007 IMO Shortlist, 7

Tags: modular arithmetic , prime factorization , factorial , combinatorial number theory , number theory

For a prime $ p$ and a given integer $ n$ let $ \nu_p(n)$ denote the exponent of $ p$ in the prime factorisation of $ n!$. Given $ d \in \mathbb{N}$ and $ \{p_1,p_2,\ldots,p_k\}$ a set of $ k$ primes, show that there are infinitely many positive integers $ n$ such that $ d\mid \nu_{p_i}(n)$ for all $ 1 \leq i \leq k$. [i]Author: Tejaswi Navilarekkallu, India[/i]

2010 Contests, 2

Tags: induction , inequalities , prime factorization , number theory

Find all integers $n$, $n \ge 1$, such that $n \cdot 2^{n+1}+1$ is a perfect square.

2012 Rioplatense Mathematical Olympiad, Level 3, 1

Tags: prime factorization , number theory

An integer $n$ is called [i]apocalyptic[/i] if the addition of $6$ different positive divisors of $n$ gives $3528$. For example, $2012$ is apocalyptic, because it has six divisors, $1$, $2$, $4$, $503$, $1006$ and $2012$, that add up to $3528$. Find the smallest positive apocalyptic number.

2014 Romania Team Selection Test, 4

Tags: induction , modular arithmetic , relatively prime , prime factorization , number theory

Let $k$ be a nonzero natural number and $m$ an odd natural number . Prove that there exist a natural number $n$ such that the number $m^n+n^m$ has at least $k$ distinct prime factors.