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

Kvant 2022, M2694

Call a natural number $n{}$ [i]interesting[/i] if any natural number not exceeding $n{}$ can be represented as the sum of several (possibly one) pairwise distinct positive divisors of $n{}$. [list=a] [*]Find the largest three-digit interesting number. [*]Prove that there are arbitrarily large interesting numbers other than the powers of two. [/list] [i]Proposed by N. Agakhanov[/i]

2015 Tournament of Towns, 2

Tags:
From a set of integers $\{1,...,100\}$, $k$ integers were deleted. Is it always possible to choose $k$ distinct integers from the remaining set such that their sum is $100$ if [b](a) $k=9$?[/b] [b](b) $k=8$?[/b]

2021 Hong Kong TST, 1

Let $S$ be a set of $2020$ distinct points in the plane. Let \[M=\{P:P\text{ is the midpoint of }XY\text{ for some distinct points }X,Y\text{ in }S\}.\] Find the least possible value of the number of points in $M$.

2014 ELMO Shortlist, 2

A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

1987 IberoAmerican, 1

The sequence $(p_n)$ is defined as follows: $p_1=2$ and for all $n$ greater than or equal to $2$, $p_n$ is the largest prime divisor of the expression $p_1p_2p_3\ldots p_{n-1}+1$. Prove that every $p_n$ is different from $5$.

2019 Purple Comet Problems, 9

Tags: geometry
A semicircle has diameter $\overline{AD}$ with $AD = 30$. Points $B$ and $C$ lie on $\overline{AD}$, and points $E$ and $F$ lie on the arc of the semicircle. The two right triangles $\vartriangle BCF$ and $\vartriangle CDE$ are congruent. The area of $\vartriangle BCF$ is $m\sqrt{n}$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/b/c/c10258e2e15cab74abafbac5ff50b1d0fd42e6.png[/img]

2017 Israel National Olympiad, 1

Tags: geometry , area , ratio
[list=a] [*] In the right picture there is a square with four congruent circles inside it. Each circle is tangent to two others, and to two of the edges of the square. Evaluate the ratio between the blue part and white part of the square's area. [*] In the left picture there is a regular hexagon with six congruent circles inside it. Each circle is tangent to two others, and to one of the edges on the hexagon in its midpoint. Evaluate the ratio between the blue part and white part of the hexagon's area. [/list] [img]https://i.imgur.com/fAuxoc9.png[/img]

2009 AMC 12/AHSME, 5

One dimension of a cube is increased by $ 1$, another is decreased by $ 1$, and the third is left unchanged. The volume of the new rectangular solid is $ 5$ less than that of the cube. What was the volume of the cube? $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 27 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 125 \qquad \textbf{(E)}\ 216$

2016 Bulgaria JBMO TST, 4

Given is a table 4x4 and in every square there is 0 or 1. In a move we choose row or column and we change the numbers there. Call the square "zero" if we cannot decrease the number of zeroes in it. Call "degree of the square" the number zeroes in a "zero" square. Find all possible values of the degree.

2019 USMCA, 11

Tags:
Let $ABC$ be a right triangle with hypotenuse $AB$. Point $E$ is on $AB$ with $AE = 10BE$, and point $D$ is outside triangle $ABC$ such that $DC = DB$ and $\angle CDA = \angle BDE$. Let $[ABC]$ and $[BCD]$ denote the areas of triangles $ABC$ and $BCD$. Determine the value of $\frac{[BCD]}{[ABC]}$.

2016 Saudi Arabia GMO TST, 3

In a school, there are totally $n$ students, with $n \ge 2$. The students take part in $m$ clubs and in each club, there are at least $2$ members (a student may take part in more than $1$ club). Eventually, the Principal notices that: If $2$ clubs share at least $2$ common members then they have different numbers of members. Prove that $$m \le (n - 1)^2$$

1987 AMC 8, 7

The large cube shown is made up of $27$ identical sized smaller cubes. For each face of the large cube, the opposite face is shaded the same way. The total number of smaller cubes that must have at least one face shaded is [asy] unitsize(36); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((3,0)--(5.2,1.4)--(5.2,4.4)--(3,3)); draw((0,3)--(2.2,4.4)--(5.2,4.4)); fill((0,0)--(0,1)--(1,1)--(1,0)--cycle,black); fill((0,2)--(0,3)--(1,3)--(1,2)--cycle,black); fill((1,1)--(1,2)--(2,2)--(2,1)--cycle,black); fill((2,0)--(3,0)--(3,1)--(2,1)--cycle,black); fill((2,2)--(3,2)--(3,3)--(2,3)--cycle,black); draw((1,3)--(3.2,4.4)); draw((2,3)--(4.2,4.4)); draw((.733333333,3.4666666666)--(3.73333333333,3.466666666666)); draw((1.466666666,3.9333333333)--(4.466666666,3.9333333333)); fill((1.73333333,3.46666666666)--(2.7333333333,3.46666666666)--(3.46666666666,3.93333333333)--(2.46666666666,3.93333333333)--cycle,black); fill((3,1)--(3.733333333333,1.466666666666)--(3.73333333333,2.46666666666)--(3,2)--cycle,black); fill((3.73333333333,.466666666666)--(4.466666666666,.93333333333)--(4.46666666666,1.93333333333)--(3.733333333333,1.46666666666)--cycle,black); fill((3.73333333333,2.466666666666)--(4.466666666666,2.93333333333)--(4.46666666666,3.93333333333)--(3.733333333333,3.46666666666)--cycle,black); fill((4.466666666666,1.9333333333333)--(5.2,2.4)--(5.2,3.4)--(4.4666666666666,2.9333333333333)--cycle,black); [/asy] $\text{(A)}\ 10 \qquad \text{(B)}\ 16 \qquad \text{(C)}\ 20 \qquad \text{(D)}\ 22 \qquad \text{(E)}\ 24$

2014 Contests, 2

Given the rational numbers $r$, $q$, and $n$, such that $\displaystyle\frac1{r+qn}+\frac1{q+rn}=\frac1{r+q}$, prove that $\displaystyle\sqrt{\frac{n-3}{n+1}}$ is a rational number.

2012 Online Math Open Problems, 47

Let $ABCD$ be an isosceles trapezoid with bases $AB=5$ and $CD=7$ and legs $BC=AD=2 \sqrt{10}.$ A circle $\omega$ with center $O$ passes through $A,B,C,$ and $D.$ Let $M$ be the midpoint of segment $CD,$ and ray $AM$ meet $\omega$ again at $E.$ Let $N$ be the midpoint of $BE$ and $P$ be the intersection of $BE$ with $CD.$ Let $Q$ be the intersection of ray $ON$ with ray $DC.$ There is a point $R$ on the circumcircle of $PNQ$ such that $\angle PRC = 45^\circ.$ The length of $DR$ can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. What is $m+n$? [i]Author: Ray Li[/i]

2005 Morocco National Olympiad, 3

Consider $n$ points $A_1, A_2, \ldots, A_n$ on a circle. How many ways are there if we want to color these points by $p$ colors, so that each two neighbors points are colored with two different colors?

2003 Federal Math Competition of S&M, Problem 3

Let $ABCD$ be a rectangle. Determine the set of all points $P$ from the region between the parallel lines $AB$ and $CD$ such that $\angle APB=\angle CPD$.

2004 IMO Shortlist, 3

Does there exist a function $s\colon \mathbb{Q} \rightarrow \{-1,1\}$ such that if $x$ and $y$ are distinct rational numbers satisfying ${xy=1}$ or ${x+y\in \{0,1\}}$, then ${s(x)s(y)=-1}$? Justify your answer. [i]Proposed by Dan Brown, Canada[/i]

2022 Polish Junior Math Olympiad Second Round, 1.

Tags: geometry
The line segments $AB$ and $CD$ are perpendicular and intersect at point $X$. Additionally, the following equalities hold: $AC=BD$, $AD=BX$, and $DX=1$. Determine the length of segment $CX$.

2016 Bangladesh Mathematical Olympiad, 4

Consider the set of integers $ \left \{ 1, 2, \dots , 100 \right \} $. Let $ \left \{ x_1, x_2, \dots , x_{100} \right \}$ be some arbitrary arrangement of the integers $ \left \{ 1, 2, \dots , 100 \right \}$, where all of the $x_i$ are different. Find the smallest possible value of the sum $$S = \left | x_2 - x_1 \right | + \left | x_3 - x_2 \right | + \cdots+ \left |x_{100} - x_{99} \right | + \left |x_1 - x_{100} \right | .$$

2021 China Team Selection Test, 6

Given positive integer $n$ and $r$ pairwise distinct primes $p_1,p_2,\cdots,p_r.$ Initially, there are $(n+1)^r$ numbers written on the blackboard: $p_1^{i_1}p_2^{i_2}\cdots p_r^{i_r} (0 \le i_1,i_2,\cdots,i_r \le n).$ Alice and Bob play a game by making a move by turns, with Alice going first. In Alice's round, she erases two numbers $a,b$ (not necessarily different) and write $\gcd(a,b)$. In Bob's round, he erases two numbers $a,b$ (not necessarily different) and write $\mathrm{lcm} (a,b)$. The game ends when only one number remains on the blackboard. Determine the minimal possible $M$ such that Alice could guarantee the remaining number no greater than $M$, regardless of Bob's move.

2000 Stanford Mathematics Tournament, 11

Tags: function
If $ a@b\equal{}\frac{a\plus{}b}{a\minus{}b}$, find $ n$ such that $ 3@n\equal{}3$.

1955 AMC 12/AHSME, 45

Given a geometric sequence with the first term $ \neq 0$ and $ r \neq 0$ and an arithmetic sequence with the first term $ \equal{}0$. A third sequence $ 1,1,2\ldots$ is formed by adding corresponding terms of the two given sequences. The sum of the first ten terms of the third sequence is: $ \textbf{(A)}\ 978 \qquad \textbf{(B)}\ 557 \qquad \textbf{(C)}\ 467 \qquad \textbf{(D)}\ 1068 \\ \textbf{(E)}\ \text{not possible to determine from the information given}$

2018 Online Math Open Problems, 27

Tags:
Let $p=2^{16}+1$ be a prime. Let $N$ be the number of ordered tuples $(A,B,C,D,E,F)$ of integers between $0$ and $p-1$, inclusive, such that there exist integers $x,y,z$ not all divisible by $p$ with $p$ dividing all three of $Ax+Ez+Fy, By+Dz+Fx, Cz+Dy+Ex$. Compute the remainder when $N$ is divided by $10^6$. [i]Proposed by Vincent Huang[/i]

2025 Bulgarian Spring Mathematical Competition, 10.3

In the cell $(i,j)$ of a table $n\times n$ is written the number $(i-1)n + j$. Determine all positive integers $n$ such that there are exactly $2025$ rows not containing a perfect square.