This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 85335

2001 India IMO Training Camp, 2

Let $p > 3$ be a prime. For each $k\in \{1,2, \ldots , p-1\}$, define $x_k$ to be the unique integer in $\{1, \ldots, p-1\}$ such that $kx_k\equiv 1 \pmod{p}$ and set $kx_k = 1+ pn_k$. Prove that : \[\sum_{k=1}^{p-1}kn_k \equiv \frac{p-1}{2} \pmod{p}\]

2018 BMT Spring, 2

Suppose for some positive integers, that $\frac{p+\frac{1}{q}}{q+\frac{1}{p}}= 17$. What is the greatest integer $n$ such that $\frac{p+q}{n}$ is always an integer?

2010 Today's Calculation Of Integral, 641

Evaluate \[\int_{e^e}^{e^{e^{e}}}\left\{\ln (\ln (\ln x))+\frac{1}{(\ln x)\ln (\ln x)}\right\}dx.\] Own

1993 Balkan MO, 2

A positive integer given in decimal representation $\overline{ a_na_{n-1} \ldots a_1a_0 }$ is called [i]monotone[/i] if $a_n\leq a_{n-1} \leq \cdots \leq a_0$. Determine the number of monotone positive integers with at most 1993 digits.

LMT Team Rounds 2010-20, 2020.S16

Tags:
For non-negative integer $n$, the function $f$ is given by \[f(x)=\begin{cases} \frac{x}{2} & \text{if $n$ is even} \\ x-1 & \text{if $n$ is odd.} \end{cases} \] Furthermore, let $h(n)$ be the smallest $k$ for which $f^k(n)=0$. Compute \[\sum_{n=1}^{1024} h(n).\]

2017 QEDMO 15th, 8

Let $ABC$ be a triangle of area $1$ with medians $s_a, s_b,s_c$. Show that there is a triangle whose sides are the same length as $s_a, s_b$, and $s_c$, and determine its area.

2014 Junior Regional Olympiad - FBH, 4

Find all prime numbers $p$ and $q$ such that $$(2p-q)^2=17p-10q$$

2024 Caucasus Mathematical Olympiad, 3

Let $n$ be a $d$-digit (i.e., having $d$ digits in its decimal representation) positive integer not divisible by $10$. Writing all the digits of $n$ in reverse order, we obtain the number $n'$. Determine if it is possible that the decimal representation of the product $n\cdot n'$ consists of digits $8$ only, if (a) $d = 9998$; (b) $d = 9999?$

2021 AMC 12/AHSME Fall, 16

Let $a, b,$ and $c$ be positive integers such that $a+b+c=23$ and \[\gcd(a,b)+\gcd(b,c)+\gcd(c,a)=9.\] What is the sum of all possible distinct values of $a^{2}+b^{2}+c^{2}$? $\textbf{(A)} ~259\qquad\textbf{(B)} ~438\qquad\textbf{(C)} ~516\qquad\textbf{(D)} ~625\qquad\textbf{(E)} ~687$ Proposed by [b]djmathman[/b]

1961 AMC 12/AHSME, 11

Two tangents are drawn to a circle from an exterior point $A$; they touch the circle at points $B$ and $C$ respectively. A third tangent intersects segment $AB$ in $P$ and $AC$ in $R$, and touches the circle at $Q$. If $AB=20$, then the perimeter of triangle $APR$ is ${{ \textbf{(A)}\ 42\qquad\textbf{(B)}\ 40.5 \qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 39\frac{7}{8} }\qquad\textbf{(E)}\ \text{not determined by the given information} } $

2014 ASDAN Math Tournament, 18

Tags:
A two-digit positive integer is $\textit{primeable}$ if one of its digits can be deleted to produce a prime number. A two-digit positive integer that is prime, yet not primeable, is $\textit{unripe}$. Compute the total number of unripe integers.

2009 National Olympiad First Round, 32

There are $ n$ sets having $ 4$ elements each. The difference set of any two of the sets is equal to one of the $ n$ sets. $ n$ can be at most ? (A difference set of $A$ and $B$ is $ (A\setminus B)\cup(B\setminus A) $) $\textbf{(A)}\ 3 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ \text{None}$

MIPT student olimpiad autumn 2024, 3

$\exists ? f: R\to R$ continuos function that: $\forall x_0\in R \lim\limits_{x \to x_0} \frac{|f(x)-f(x_0)|}{|x-x_0|}=+\infty$

2020 Austrian Junior Regional Competition, 2

How many positive five-digit integers are there that have the product of their five digits equal to $900$? (Karl Czakler)

2013 Purple Comet Problems, 14

Tags:
How many ordered triples $(a, b, c)$ of positive integers satisfy $a \le b  \le c$ and $a  \cdot b\cdot  c = 1000$?

2018 Bosnia and Herzegovina EGMO TST, 4

It is given positive integer $n$. Let $a_1, a_2,..., a_n$ be positive integers with sum $2S$, $S \in \mathbb{N}$. Positive integer $k$ is called separator if you can pick $k$ different indices $i_1, i_2,...,i_k$ from set $\{1,2,...,n\}$ such that $a_{i_1}+a_{i_2}+...+a_{i_k}=S$. Find, in terms of $n$, maximum number of separators

2003 China Team Selection Test, 3

There is a frog in every vertex of a regular 2n-gon with circumcircle($n \geq 2$). At certain time, all frogs jump to the neighborhood vertices simultaneously (There can be more than one frog in one vertex). We call it as $\textsl{a way of jump}$. It turns out that there is $\textsl{a way of jump}$ with respect to 2n-gon, such that the line connecting any two distinct vertice having frogs on it after the jump, does not pass through the circumcentre of the 2n-gon. Find all possible values of $n$.

2023 Grosman Mathematical Olympiad, 3

Find all pairs of polynomials $p$, $q$ with complex coefficients so that \[p(x)\cdot q(x)=p(q(x)).\]

2021 Serbia JBMO TSTs, 3

Two players play the following game: alternatively they write numbers $1$ or $0$ in the vertices of an $n$-gon. First player starts the game and wins if after any of his moves there exists a triangle, whose vertices are three consecutive vertices of the $n$-gon, such that the sum of numbers in it's vertices is divisible by $3$. Second player wins if he prevents this. Determine which player has a winning strategy if: a) $n=2019$ b) $n=2020$ c) $n=2021$

2012 Romania Team Selection Test, 2

Let $f, g:\mathbb{Z}\rightarrow [0,\infty )$ be two functions such that $f(n)=g(n)=0$ with the exception of finitely many integers $n$. Define $h:\mathbb{Z}\rightarrow [0,\infty )$ by \[h(n)=\max \{f(n-k)g(k): k\in\mathbb{Z}\}.\] Let $p$ and $q$ be two positive reals such that $1/p+1/q=1$. Prove that \[ \sum_{n\in\mathbb{Z}}h(n)\geq \Bigg(\sum_{n\in\mathbb{Z}}f(n)^p\Bigg)^{1/p}\Bigg(\sum_{n\in\mathbb{Z}}g(n)^q\Bigg)^{1/q}.\]

2010 Miklós Schweitzer, 11

For problem 11 , i couldn’t find the correct translation , so i just posted the hungarian version . If anyone could translate it ,i would be very thankful . [tip=see hungarian]Az $X$ ́es$ Y$ valo ́s ́ert ́eku ̋ v ́eletlen v ́altoz ́ok maxim ́alkorrel ́acio ́ja az $f(X)$ ́es $g(Y )$ v ́altoz ́ok korrela ́cio ́j ́anak szupr ́emuma az olyan $f$ ́es $g$ Borel m ́erheto ̋, $\mathbb{R} \to \mathbb{R}$ fu ̈ggv ́enyeken, amelyekre $f(X)$ ́es $g(Y)$ v ́eges sz ́ora ́su ́. Legyen U a $[0,2\pi]$ interval- lumon egyenletes eloszl ́asu ́ val ́osz ́ınu ̋s ́egi v ́altozo ́, valamint n ́es m pozit ́ıv eg ́eszek. Sz ́am ́ıtsuk ki $\sin(nU)$ ́es $\sin(mU)$ maxim ́alkorrela ́ci ́oja ́t. [/tip] Edit: [hide=Translation thanks to @tintarn] The maximal correlation of two random variables $X$ and $Y$ is defined to be the supremum of the correlations of $f(X)$ and $g(Y)$ where $f,g:\mathbb{R} \to \mathbb{R}$ are measurable functions such that $f(X)$ and $g(Y)$ is (almost surely?) finite. Let $U$ be the uniformly distributed random variable on $[0,2\pi]$ and let $m,n$ be positive integers. Compute the maximal correlation of $\sin(nU)$ and $\sin(mU)$. (Remark: It seems that to make sense we should require that $E[f(X)]$ and $E[g(Y)]$ as well as $E[f(X)^2]$ and $E[g(Y)^2]$ are finite. In fact, we may then w.l.o.g. assume that $E[f(X)]=E[g(Y)]=0$ and $E[f(Y)^2]=E[g(Y)^2]=1$.)[/hide]

2019 Jozsef Wildt International Math Competition, W. 64

Prove that exist different natural numbers $x$, $y$, $z$, $t$ for which $$256\times 2019^{180n+1}=2x^9-2y^6+z^5-t^4$$for all $n\in \mathbb{N}^*$

2016 Hanoi Open Mathematics Competitions, 1

How many are there $10$-digit numbers composed from the digits $1, 2, 3$ only and in which, two neighbouring digits differ by $1$ : (A): $48$ (B): $64$ (C): $72$ (D): $128$ (E): None of the above.

2019 USEMO, 5

Let $\mathcal{P}$ be a regular polygon, and let $\mathcal{V}$ be its set of vertices. Each point in $\mathcal{V}$ is colored red, white, or blue. A subset of $\mathcal{V}$ is [i]patriotic[/i] if it contains an equal number of points of each color, and a side of $\mathcal{P}$ is [i]dazzling[/i] if its endpoints are of different colors. Suppose that $\mathcal{V}$ is patriotic and the number of dazzling edges of $\mathcal{P}$ is even. Prove that there exists a line, not passing through any point in $\mathcal{V}$, dividing $\mathcal{V}$ into two nonempty patriotic subsets. [i]Ankan Bhattacharya[/i]

2013 NIMO Summer Contest, 2

If $\frac{2+4+6}{1+3+5}-\frac{1+3+5}{2+4+6} = \frac{m}{n}$ for relatively prime integers $m$ and $n$, compute $100m+n$. [i]Proposed by Evan Chen[/i]