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: 15460

1998 Croatia National Olympiad, Problem 4

Tags: php , number theory
Among any $79$ consecutive natural numbers there exists one whose sum of digits is divisible by $13$. Find a sequence of $78$ consecutive natural numbers for which the above statement fails.

2016 May Olympiad, 3

We say that a positive integer is [i]quad-divi[/i] if it is divisible by the sum of the squares of its digits, and also none of its digits is equal to zero. a) Find a quad-divi number such that the sum of its digits is $24$. b) Find a quad-divi number such that the sum of its digits is $1001$.

1906 Eotvos Mathematical Competition, 3

Let $a_1, a_2, ...,a_n$ represent an arbitrary arrangement of the numbers $1, 2, ...,n$. Prove that, if $n$ is odd, the product $$(a_1 - 1)(a_2 - 2) ... (a_n -n)$$ is an even number.

2011 Iran Team Selection Test, 8

Let $p$ be a prime and $k$ a positive integer such that $k \le p$. We know that $f(x)$ is a polynomial in $\mathbb Z[x]$ such that for all $x \in \mathbb{Z}$ we have $p^k | f(x)$. [b](a)[/b] Prove that there exist polynomials $A_0(x),\ldots,A_k(x)$ all in $\mathbb Z[x]$ such that \[ f(x)=\sum_{i=0}^{k} (x^p-x)^ip^{k-i}A_i(x),\] [b](b)[/b] Find a counter example for each prime $p$ and each $k > p$.

III Soros Olympiad 1996 - 97 (Russia), 10.4

Find natural $a, b, c, d$ that satisfy the system $$\begin{cases} ab+cd=34 \\ ac-bd=19 \end{cases}$$

2018 Harvard-MIT Mathematics Tournament, 7

Anders is solving a math problem, and he encounters the expression $\sqrt{15!}$. He attempts to simplify this radical as $a\sqrt{b}$ where $a$ and $b$ are positive integers. The sum of all possible values of $ab$ can be expressed in the form $q\cdot 15!$ for some rational number $q$. Find $q$.

2016 Bundeswettbewerb Mathematik, 1

There are $\tfrac{n(n+1)}{2}$ distinct sums of two distinct numbers, if there are $n$ numbers. For which $n \ (n \geq 3)$ do there exist $n$ distinct integers, such that those sums are $\tfrac{n(n-1)}{2}$ consecutive numbers?

2020 Durer Math Competition Finals, 6

Positive integers $a, b$ and $c$ are all less than $2020$. We know that $a$ divides $b + c$, $b$ divides $a + c$ and $c$ divides $a + b$. How many such ordered triples $(a, b, c)$ are there? Note: In an ordered triple, the order of the numbers matters, so the ordered triple $(0, 1, 2)$ is not the same as the ordered triple $(2, 0, 1)$.

1955 Moscow Mathematical Olympiad, 303

The quadratic expression $ax^2+bx+c$ is the $4$-th power (of an integer) for any integer $x$. Prove that $a = b = 0$.

2005 ITAMO, 2

Prove that among any $18$ consecutive positive integers not exceeding $2005$ there is at least one divisible by the sum of its digits.

2008 JBMO Shortlist, 5

Is it possible to arrange the numbers $1^1, 2^2,..., 2008^{2008}$ one after the other, in such a way that the obtained number is a perfect square? (Explain your answer.)

2014 Taiwan TST Round 2, 3

Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses. An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise. Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.

2012 Ukraine Team Selection Test, 3

A natural number $n$ is called [i]perfect [/i] if it is equal to the sum of all its natural divisors other than $n$. For example, the number $6$ is perfect because $6 = 1 + 2 + 3$. Find all even perfect numbers that can be given as the sum of two cubes positive integers.

2021 Stanford Mathematics Tournament, R2

[b]p5.[/b] Find the number of three-digit integers that contain at least one $0$ or $5$. The leading digit of the three-digit integer cannot be zero. [b]p6.[/b] What is the sum of the solutions to $\frac{x+8}{5x+7} =\frac{x+8}{7x+5}$ [b]p7.[/b] Let $BC$ be a diameter of a circle with center $O$ and radius $4$. Point $A$ is on the circle such that $\angle AOB = 45^o$. Point $D$ is on the circle such that line segment$ OD$ intersects line segment $AC$ at $E$ and $OD$ bisects $\angle AOC$. Compute the area of $ADE$, which is enclosed by line segments $AE$ and $ED$ and minor arc $AD$. [b]p8. [/b] William is a bacteria farmer. He would like to give his fiance$ 2021$ bacteria as a wedding gift. Since he is an intelligent and frugal bacteria farmer, he would like to add the least amount of bacteria on his favorite infinite plane petri dish to produce those $2021$ bacteria. The infinite plane petri dish starts off empty and William can add as many bacteria as he wants each day. Each night, all the bacteria reproduce through binary fission, splitting into two. If he has infinite amount of time before his wedding day, how many bacteria should he add to the dish in total to use the least number of bacteria to accomplish his nuptial goals? PS. You should use hide for answers Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

1998 IMO, 3

For any positive integer $n$, let $\tau (n)$ denote the number of its positive divisors (including 1 and itself). Determine all positive integers $m$ for which there exists a positive integer $n$ such that $\frac{\tau (n^{2})}{\tau (n)}=m$.

EMCC Guts Rounds, 2023

[u]Round 5[/u] [b]p13.[/b] For a square pyramid whose base has side length $9$, a square is formed by connecting the centroids of the four triangular faces. What is the area of the square formed by the centroids? [b]p14.[/b] Farley picks a real number p uniformly at random in the range $\left( \frac13, \frac23 \right)$. She then creates a special coin that lands on heads with probability $p$ and tails with probability $1 - p$. She flips this coin, and it lands on heads. What is the probability that $p > \frac12$? [b]p15.[/b] Let $ABCD$ be a quadrilateral with $\angle A = \angle C = 90^o$. Extend $AB$ and $CD$ to meet at point $P$. Given that $P B = 3$, $BA = 21$, and $P C = 1$, find $BD^2$ [u]Round 6[/u] [b]p16.[/b] Three congruent, mutually tangent semicircles are inscribed in a larger semicircle, as shown in the diagram below. If the larger semicircle has a radius of $30$ units, what is the radius of one of the smaller semicircles? [img]https://cdn.artofproblemsolving.com/attachments/5/e/1b73791e95dc4ed6342f0151f3f63e1b31ae3c.png[/img] [b]p17.[/b] In isosceles trapezoid $ABCD$ with $BC \parallel AD$, the distances from $A$ and $B$ to line $CD$ are $3$ and $9$, respectively. If the distance between the two bases of trapezoid $ABCD$ is $5$, find the area of quadrilateral $ABCD$. [b]p18.[/b] How many ways are there to tile the “$E$” shape below with dominos? A domino covers two adjacent squares. [img]https://cdn.artofproblemsolving.com/attachments/b/b/82bdb8d8df8bc3d00b9aef9eb39e55358c4bc6.png[/img] [u]Round 7[/u] [b]p19.[/b] In isoceles triangle $ABC$, $AC = BC$ and $\angle ACB = 20^o$. Let $\Omega$ be the circumcircle of triangle $ABC$ with center $O$, and let $M$ be the midpoint of segment $BC$. Ray $\overrightarrow{OM}$ intersects $\Omega$ at $D$. Let $\omega$ be the circle with diameter $OD$. $AD$ intersects $\omega$ again at a point $X$ not equal to $D$. Given $OD = 2$, find the area of triangle $OXD$. [b]p20.[/b] Find the smallest odd prime factor of $2023^{2029} + 2026^{2029} - 1$. [b]p21.[/b] Achyuta, Alan, Andrew, Anish, and Ava are playing in the EMCC games. Each person starts with a paper with their name taped on their back. A person is eliminated from the game when anybody rips their paper off of their back. The game ends when one person remains. The remaining person then rips their paper off of their own back. At the end of the game, each person collects the papers that they ripped off. How many distinct ways can the papers be distributed at the end of the game? [u]Round 8[/u] [b]p22.[/b] Anthony has three random number generators, labelled $A$, $B$ and $C$. $\bullet$ Generator$ A$ returns a random number from the set $\{12, 24, 36, 48, 60\}$. $\bullet$ Generator $B$ returns a random number from the set $ \{15, 30, 45, 60\}$. $\bullet$ Generator $C$ returns a random number from the set $\{20, 40, 60\}$. He uses generator $A$, $B$, and then $C$ in succession, and then repeats this process indefinitely. Anthony keeps a running total of the sum of all previously generated numbers, writing down the new total every time he uses a generator. After he uses each machine $10 $ times, what is the average number of multiples of $60$ that Anthony will have written down? [b]p23.[/b] A laser is shot from one of the corners of a perfectly reflective room shaped like an equilateral triangle. The laser is reflected 2497 times without shining into a corner of the room, but after the 2497th reflection, it shines directly into the corner it started from. How many different angles could the laser have been initially pointed? [b]p24.[/b] We call a k-digit number blissful if the number of positive integers $n$ such that $n^n$ ends in that $k$-digit number happens to be nonzero and finite. What is the smallest value of $k$ such that there exists a blissful $k$-digit number? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3131523p28369592]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2005 Vietnam Team Selection Test, 2

Let $p\in \mathbb P,p>3$. Calcute: a)$S=\sum_{k=1}^{\frac{p-1}{2}} \left[\frac{2k^2}{p}\right]-2 \cdot \left[\frac{k^2}{p}\right]$ if $ p\equiv 1 \mod 4$ b) $T=\sum_{k=1}^{\frac{p-1}{2}} \left[\frac{k^2}{p}\right]$ if $p\equiv 1 \mod 8$

2011 Saudi Arabia Pre-TST, 1.1

Set $A$ consists of $7$ consecutive positive integers less than $2011$, while set $B$ consists of $11$ consecutive positive integers. If the sum of the numbers in $A$ is equal to the sum of the numbers in $B$ , what is the maximum possible element that $A$ could contain?

1999 Bulgaria National Olympiad, 3

Prove that $x^3+y^3+z^3+t^3=1999$ has infinitely many soln. over $\mathbb{Z}$.

2018 Brazil EGMO TST, 1

(a) Let $m$ and $n$ be positive integers and $p$ a positive rational number, with $m > n$, such that $\sqrt{m} -\sqrt{n}= p$. Prove that $m$ and $n$ are perfect squares. (b) Find all four-digit numbers $\overline{abcd}$, where each letter $a, b, c$ and $d$ represents a digit, such that $\sqrt{\overline{abcd}} -\sqrt{\overline{acd}}= \overline{bb}$.

2006 Iran MO (3rd Round), 6

a) $P(x),R(x)$ are polynomials with rational coefficients and $P(x)$ is not the zero polynomial. Prove that there exist a non-zero polynomial $Q(x)\in\mathbb Q[x]$ that \[P(x)\mid Q(R(x)).\] b) $P,R$ are polynomial with integer coefficients and $P$ is monic. Prove that there exist a monic polynomial $Q(x)\in\mathbb Z[x]$ that \[P(x)\mid Q(R(x)).\]

2001 Saint Petersburg Mathematical Olympiad, 9.6

Find all positive integer solution: $$k^m+m^n=k^n+1$$ [I]Proposed by V. Frank, F. Petrov[/i]

2024 UMD Math Competition Part I, #22

For how many angles $x$, in radians, satisfying $0\le x<2\pi$ do we have $\sin(14x)=\cos(68x)$? \[\rm a. ~128\qquad \mathrm b. ~130\qquad \mathrm c. ~132 \qquad\mathrm d. ~134\qquad\mathrm e. ~136\]

2022 Romania Team Selection Test, 3

Consider a prime number $p\geqslant 11$. We call a triple $a,b,c$ of natural numbers [i]suitable[/i] if they give non-zero, pairwise distinct residues modulo $p{}$. Further, for any natural numbers $a,b,c,k$ we define \[f_k(a,b,c)=a(b-c)^{p-k}+b(c-a)^{p-k}+c(a-b)^{p-k}.\]Prove that there exist suitable $a,b,c$ for which $p\mid f_2(a,b,c)$. Furthermore, for each such triple, prove that there exists $k\geqslant 3$ for which $p\nmid f_k(a,b,c)$ and determine the minimal $k{}$ with this property. [i]Călin Popescu and Marian Andronache[/i]

2013 Online Math Open Problems, 20

Let $a_1,a_2,\ldots, a_{2013}$ be a permutation of the numbers from $1$ to $2013$. Let $A_n = \frac{a_1 + a_2 + \cdots + a_n} {n}$ for $n = 1,2,\ldots, 2013$. If the smallest possible difference between the largest and smallest values of $A_1,A_2,\ldots, A_{2013}$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Ray Li[/i]