Found problems: 85335
1955 Moscow Mathematical Olympiad, 312
Given $\vartriangle ABC$, points $C_1, A_1, B_1$ on sides $AB, BC, CA$, respectively, such that $\frac{AC_1}{C_1B}= \frac{BA_1}{A_1C}= \frac{CB_1}{B_1A}=\frac{1}{n}$ and points $C_2, A_2, B_2$ on sides $A_1B_1, B_1C_1, C_1A_1$ of $\vartriangle A_1B_1C_1$, respectively, such that $\frac{A_1C_2}{C_2B_1}= \frac{B_1A_2}{A_2C_1}= \frac{C_1B_2}{B_2A_1}= n$. Prove that $A_2C_2 //AC, C_2B_2 // CB, B_2A_2 // BA$.
2023 AMC 8, 4
The numbers from $1$ to $49$ are arranged in a spiral pattern on a square grid, beginning at the center. The first few numbers have been entered into the grid below. Consider the four numbers that will appear in the shaded squares, on the same diagonal as the number $7.$ How many of these four numbers are prime?
[asy]
size(6cm);
fill((4,0)--(5,0)--(5,1)--(4,1)--cycle,mediumgray);
fill((3,1)--(4,1)--(4,2)--(3,2)--cycle,mediumgray);
fill((1,3)--(1,4)--(2,4)--(2,3)--cycle,mediumgray);
fill((0,4)--(0,5)--(1,5)--(1,4)--cycle,mediumgray);
label(scale(.9)*"$1$", (3.5,3.5));
label(scale(.9)*"$2$", (4.5,3.5));
label(scale(.9)*"$3$", (4.5,4.5));
label(scale(.9)*"$4$", (3.5,4.5));
label(scale(.9)*"$5$", (2.5,4.5));
label(scale(.9)*"$6$", (2.5,3.5));
label(scale(.9)*"$7$", (2.5,2.5));
draw((1,0)--(1,7)--(2,7)--(2,0)--(3,0)--(3,7)--(4,7)--(4,0)--(5,0)--(5,7)--(6,7)--(6,0)--(7,0)--(7,7),gray);
draw((0,1)--(7,1)--(7,2)--(0,2)--(0,3)--(7,3)--(7,4)--(0,4)--(0,5)--(7,5)--(7,6)--(0,6)--(0,7)--(7,7),gray);
draw((4,4)--(3,4)--(3,3)--(5,3)--(5,5)--(2,5)--(2,2)--(6,2)--(6,6)--(1,6)--(1,1)--(7,1)--(7,7)--(0,7)--(0,0)--(7,0),linewidth(1.25));
[/asy]
$\textbf{(A) } 0\qquad\textbf{(B) } 1\qquad\textbf{(C) } 2\qquad\textbf{(D) } 3\qquad\textbf{(E) } 4$
2006 Sharygin Geometry Olympiad, 10.5
Can a tetrahedron scan turn out to be a triangle with sides $3, 4$ and $5$ (a tetrahedron can be cut only along the edges)?
2013 Germany Team Selection Test, 3
Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. Prove that there exists a point $J$ such that for any point $X$ inside $ABC$ if $AX,BX,CX$ intersect $\omega$ in $A_1,B_1,C_1$ and $A_2,B_2,C_2$ be reflections of $A_1,B_1,C_1$ in midpoints of $BC,AC,AB$ respectively then $A_2,B_2,C_2,J$ lie on a circle.
2011 F = Ma, 1
A cyclist travels at a constant speed of $\text{22.0 km/hr}$ except for a $20$ minute stop. The cyclist’s average speed was $\text{17.5 km/hr}$. How far did the cyclist travel?
(A) $\text{28.5 km}$
(B) $\text{30.3 km}$
(C) $\text{31.2 km}$
(D) $\text{36.5 km}$
(E) $\text{38.9 km}$
1994 Niels Henrik Abels Math Contest (Norwegian Math Olympiad) Round 2, 1
A walnut-salesman knows that 20% of the nuts are empty. He has found a test for picking these out. This discards 20% of the nuts. However, when cracking the nuts that were discarded, one fourth of them were not empty after all. What proportion of the nuts that passed the test are then empty?
A. 4%
B. 6 and 1/4 %
C. 8%
D. 16%
E. None of these
2010 Today's Calculation Of Integral, 579
Let $ a$ be a positive real number. Find $ \lim_{n\to\infty} \frac{(n\plus{}1)^a\plus{}(n\plus{}2)^a\plus{}\cdots \plus{}(n\plus{}n)^a}{1^{a}\plus{}2^{a}\plus{}\cdots \plus{}n^{a}}$
2006 Sharygin Geometry Olympiad, 1
Two straight lines intersecting at an angle of $46^o$ are the axes of symmetry of the figure $F$ on the plane. What is the smallest number of axes of symmetry this figure can have?
2022 BMT, Tie 2
Call a positive whole number [i]rickety [/i] if it is three times the product of its digits. There are two $2$-digit numbers that are rickety. What is their sum?
2011 Danube Mathematical Competition, 3
Determine all positive integer numbers $n$ satisfying the following condition:
the sum of the squares of any $n$ prime numbers greater than $3$ is divisible by $n$.
Kyiv City MO Seniors Round2 2010+ geometry, 2021.11.3
In the triangle $ABC$, the altitude $BH$ and the angle bisector $BL$ are drawn, the inscribed circle $w$ touches the side of the $AC$ at the point $K$. It is known that $\angle BKA = 45^o$. Prove that the circle with diameter $HL$ touches the circle $w$.
(Anton Trygub)
2019 India National OIympiad, 3
Let $m,n$ be distinct positive integers. Prove that
$$gcd(m,n) + gcd(m+1,n+1) + gcd(m+2,n+2) \le 2|m-n| + 1. $$
Further, determine when equality holds.
2015 CHMMC (Fall), 1
Call a positive integer $x$ $n$-[i]cube-invariant[/i] if the last $n$ digits of $x$ are equal to the last $n$ digits of $x^3$. For example, $1$ is $n$-cube invariant for any integer $n$. How many $2015$-cube-invariant numbers $x$ are there such that $x < 10^{2015}$?
1985 IMO Longlists, 6
On a one-way street, an unending sequence of cars of width $a$, length $b$ passes with velocity $v$. The cars are separated by the distance $c$. A pedestrian crosses the street perpendicularly with velocity $w$, without paying attention to the cars.
[b](a)[/b] What is the probability that the pedestrian crosses the street uninjured?
[b](b)[/b] Can he improve this probability by crossing the road in a direction other than perpendicular?
2017 All-Russian Olympiad, 1
There are $n>3$ different natural numbers, less than $(n-1)!$ For every pair of numbers Ivan divides bigest on lowest and write integer quotient (for example, $100$ divides $7$ $= 14$) and write result on the paper. Prove, that not all numbers on paper are different.
Russian TST 2019, P1
Let $a_0, a_1, \ldots , a_n$ and $b_0, b_1, \ldots , b_n$ be sequences of real numbers such that $a_0 = b_0 \geqslant 0$, $a_n = b_n > 0$ and \[a_i=\sqrt{\frac{a_{i+1}+a_{i-1}}{2}},\quad b_i=\sqrt{\frac{b_{i+1}+b_{i-1}}{2}},\]for all $i=1,\ldots,n-1$. Prove that $a_1 = b_1$.
1999 May Olympiad, 3
The first row of this table is filled with the numbers $1$ through $10$, in that order.
The second row is filled with the numbers from $1$ to $10$, in any order.
In each box of the third row the sum of the two numbers written above is written.
Is there a way to fill in the second row so that the ones digits of the numbers in the third row are all different?
[img]https://cdn.artofproblemsolving.com/attachments/8/5/41117d105cc880bf452fa46132c20f2167aa5b.png[/img]
2005 IberoAmerican Olympiad For University Students, 7
Prove that for any integers $n,p$, $0<n\leq p$, all the roots of the polynomial below are real:
\[P_{n,p}(x)=\sum_{j=0}^n {p\choose j}{p\choose {n-j}}x^j\]
1951 Moscow Mathematical Olympiad, 190
Which number is greater:
$\frac{2.00 000 000 004}{(1.00 000 000 004)^2 + 2.00 000 000 004}$ or $\frac{2.00 000 000 002}{(1.00 000 000 002)^2 + 2.00 000 000 002}$ ?
2022 Middle European Mathematical Olympiad, 7
Determine all functions $f : \mathbb {N} \rightarrow \mathbb {N}$ such that $f$ is increasing (not necessarily strictly) and the numbers $f(n)+n+1$ and $f(f(n))-f(n)$ are both perfect squares for every positive integer $n$.
2005 Iran MO (2nd round), 2
$BC$ is a diameter of a circle and the points $X,Y$ are on the circle such that $XY\perp BC$. The points $P,M$ are on $XY,CY$ (or their stretches), respectively, such that $CY||PB$ and $CX||PM$. Let $K$ be the meet point of the lines $XC,BP$. Prove that $PB\perp MK$.
2020 Online Math Open Problems, 18
The people in an infinitely long line are numbered $1,2,3,\dots$. Then, each person says either ``Karl" or ``Lark" independently and at random. Let $S$ be the set of all positive integers $i$ such that people $i$, $i+1$, and $i+2$ all say ``Karl," and define $X = \sum_{i \in S} 2^{-i}$. Then the expected value of $X^2$ is $\frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$.
[i]Proposed by Ankit Bisain[/i]
2011 All-Russian Olympiad Regional Round, 10.2
$ABC$ is an acute triangle. Points $M$ and $K$ on side $AC$ are such that $\angle ABM = \angle CBK$. Prove that the circumcenters of triangles $ABM$, $ABK$, $CBM$ and $CBK$ are concyclic. (Author: T. Emelyanova)
1968 All Soviet Union Mathematical Olympiad, 106
Medians divide the triangle onto $6$ smaller ones. $4$ of the circles inscribed in those small ones are equal. Prove that the triangle is equilateral.
2023 Brazil Team Selection Test, 1
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$