Olympiad problems

2005 Czech-Polish-Slovak Match, 6

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

2013 Princeton University Math Competition, 5

Tags: number theory , prime factorization

Let $A$ be the greatest possible value of a product of positive integers that sums to $2014$. Compute the sum of all bases and exponents in the prime factorization of $A$. For example, if $A=7\cdot 11^5$, the answer would be $7+11+5=23$.

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.$

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.

2001 Bundeswettbewerb Mathematik, 4

Tags: prime factorization , prime number , number theory

Prove: For each positive integer is the number of divisors whose decimal representations ends with a 1 or 9 not less than the number of divisors whose decimal representations ends with 3 or 7.

2010 Purple Comet Problems, 2

Tags: number theory , prime factorization

The prime factorization of $12 = 2 \cdot 2 \cdot 3$ has three prime factors. Find the number of prime factors in the factorization of $12! = 12 \cdot 11 \cdot 10 \cdot 9 \cdot 8 \cdot 7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1.$

2010 JBMO Shortlist, 1

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.

2016 CMIMC, 4

Tags: function , number theory , prime factorization

For some positive integer $n$, consider the usual prime factorization \[n = \displaystyle \prod_{i=1}^{k} p_{i}^{e_{i}}=p_1^{e_1}p_2^{e_2}\ldots p_k^{e_k},\] where $k$ is the number of primes factors of $n$ and $p_{i}$ are the prime factors of $n$. Define $Q(n), R(n)$ by \[ Q(n) = \prod_{i=1}^{k} p_{i}^{p_{i}} \text{ and } R(n) = \prod_{i=1}^{k} e_{i}^{e_{i}}. \] For how many $1 \leq n \leq 70$ does $R(n)$ divide $Q(n)$?

2018 PUMaC Number Theory B, 3

Tags: number theory , prime factorization

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)$.

1998 South africa National Olympiad, 1

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

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

2012 BMT Spring, 2

Tags: factorial , number theory , prime factorization

Find the smallest number with exactly 28 divisors.

PEN K Problems, 2

Tags: function , induction , strong induction , number theory , prime factorization , functional equation

Find all surjective functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: \[m \vert n \Longleftrightarrow f(m) \vert f(n).\]

1991 AMC 12/AHSME, 14

Tags: geometry , 3d geometry , number theory , prime factorization

If $x$ is the cube of a positive integer and $d$ is the number of positive integers that are divisors of $x$, then $d$ could be $ \textbf{(A)}\ 200\qquad\textbf{(B)}\ 201\qquad\textbf{(C)}\ 202\qquad\textbf{(D)}\ 203\qquad\textbf{(E)}\ 204 $

2012 AMC 12/AHSME, 24

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

Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

2003 AMC 12-AHSME, 18

Tags: number theory , prime factorization

Let $ x$ and $ y$ be positive integers such that $ 7x^5 \equal{} 11y^{13}$. The minimum possible value of $ x$ has a prime factorization $ a^cb^d$. What is $ a \plus{} b \plus{} c \plus{} d$? $ \textbf{(A)}\ 30 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 34$

2010 AMC 10, 8

Tags: number theory , prime factorization

A ticket to a school play costs $ x$ dollars, where $ x$ is a whole number. A group of 9th graders buys tickets costing a total of $ \$48$, and a group of 10th graders buys tickets costing a total of $ \$64$. How many values of $ x$ are possible? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$

1977 IMO Longlists, 27

Tags: number theory , prime number , prime factorization , dirichlet s theorem

Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)

1973 AMC 12/AHSME, 19

Tags: function , number theory , prime factorization

Define $ n_a!$ for $ n$ and $ a$ positive to be \[ n_a ! \equal{} n (n\minus{}a)(n\minus{}2a)(n\minus{}3a)...(n\minus{}ka)\] where $ k$ is the greatest integer for which $ n>ka$. Then the quotient $ 72_8!/18_2!$ is equal to $ \textbf{(A)}\ 4^5 \qquad \textbf{(B)}\ 4^6 \qquad \textbf{(C)}\ 4^8 \qquad \textbf{(D)}\ 4^9 \qquad \textbf{(E)}\ 4^{12}$

OMMC POTM, 2022 4

Tags: number theory , prime factorization

Define a function $P(n)$ from the set of positive integers to itself, where $P(1)=1$ and if an integer $n > 1$ has prime factorization $$n = p_1^{a_1}p_2^{a_2} \dots p_k^{a_k}$$ then $$P(n) = a_1^{p_1}a_2^{p_2} \dots a_k^{p_k}.$$ Prove that $P(P(n)) \le n$ for all positive integers $n.$ [i]Proposed by Evan Chang (squareman), USA[/i]

2009 AMC 10, 25

Tags: modular arithmetic , number theory , prime factorization

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$

2014 NIMO Problems, 3

Tags: number theory , prime number , prime factorization

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]

2009 AMC 12/AHSME, 18

Tags: modular arithmetic , number theory , prime factorization

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$

2016 Romania National Olympiad, 3

Tags: number theory , prime factorization

Find all the positive integers $p$ with the property that the sum of the first $p$ positive integers is a four-digit positive integer whose decomposition into prime factors is of the form $2^m3^n(m + n)$, where $m, n \in N^*$.

1950 AMC 12/AHSME, 21

Tags: number theory , prime factorization

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}$

2008 ITest, 29

Tags: linear algebra , matrix , number theory , prime factorization

Find the number of ordered triplets $(a,b,c)$ of positive integers such that $abc=2008$ (the product of $a$, $b$, and $c$ is $2008$).