Found problems: 15460
2017 Czech And Slovak Olympiad III A, 6
Given is a nonzero integer $k$.
Prove that equation $k =\frac{x^2 - xy + 2y^2}{x + y}$ has an odd number of ordered integer pairs $(x, y)$ just when $k$ is divisible by seven.
2009 Paraguay Mathematical Olympiad, 3
Find out how many positive integers $n$ not larger than $2009$ exist such that the last digit of $n^{20}$ is $1$.
1969 Leningrad Math Olympiad, grade 8
[url=https://artofproblemsolving.com/community/c893771h1861957p12597232]8.1[/url] The point $E$ lies on the base $[AD]$ of the trapezoid $ABCD$. The perimeters of the triangles $ABE, BCE$ and $CDE$ are equal. Prove that $|BC| = |AD|/2$
[b]8.2[/b] In a convex pentagon, the lengths of all sides are equal. Find the point on the longest diagonal from which all sides are visible underneath angles not exceeding a right angle.
[url=https://artofproblemsolving.com/community/c893771h1862007p12597620]8.3[/url] Every city in the certain state is connected by airlines with no more than with three other ones, but one can get from every city to every other city changing a plane once only or directly. What is the maximal possible number of the cities?
[url=https://artofproblemsolving.com/community/c893771h1861966p12597273]8.4*/7.4*[/url] (asterisk problems in separate posts)
[url=https://artofproblemsolving.com/community/c893771h1862002p12597605]8.5[/url] Four different three-digit numbers starting with the same digit have the property that their sum is divisible by three of them without a remainder. Find these numbers.
[url=https://artofproblemsolving.com/community/c893771h1861967p12597280]8.6[/url] Given a finite sequence of zeros and ones, which has two properties:
a) if in some arbitrary place in the sequence we select five digits in a row and also select five digits in any other place in a row, then these fives will be different (they may overlap);
b) if you add any digit to the right of the sequence, then property (a) will no longer hold true.
Prove that the first four digits of our sequence coincide with the last four.
PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988085_1969_leningrad_math_olympiad]here[/url].
2002 Vietnam National Olympiad, 2
Determine for which $ n$ positive integer the equation: $ a \plus{} b \plus{} c \plus{} d \equal{} n \sqrt {abcd}$ has positive integer solutions.
1997 Canada National Olympiad, 1
Determine the number of pairs of positive integers $x,y$ such that $x\le y$, $\gcd (x,y)=5!$ and $\text{lcm}(x,y)=50!$.
2012 AMC 12/AHSME, 24
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 $
2013 Tournament of Towns, 4
Is it true that every integer is a sum of finite number of cubes of distinct integers?
2015 China Team Selection Test, 3
Let $a,b$ be two integers such that their gcd has at least two prime factors. Let $S = \{ x \mid x \in \mathbb{N}, x \equiv a \pmod b \} $ and call $ y \in S$ irreducible if it cannot be expressed as product of two or more elements of $S$ (not necessarily distinct). Show there exists $t$ such that any element of $S$ can be expressed as product of at most $t$ irreducible elements.
1966 Poland - Second Round, 4
Prove that if the natural numbers $ a $ and $ b $ satisfy the equation $ a^2+a = 3b^2 $, then the number $ a+1 $ is the square of an integer.
2019 Brazil National Olympiad, 4
Prove that for every positive integer $m$ there exists a positive integer $n_m$ such that for every positive integer $n \ge n_m$, there exist positive integers $a_1, a_2, \ldots, a_n$ such that $$\frac{1}{a_1^m}+\frac{1}{a_2^m}+\ldots+\frac{1}{a_n^m}=1.$$
2014 Korea Junior Math Olympiad, 4
Positive integers $p, q, r$ satisfy $gcd(a,b,c) = 1$.
Prove that there exists an integer $a$ such that $gcd(p,q+ar) = 1$.
2000 Baltic Way, 15
Let $n$ be a positive integer not divisible by $2$ or $3$. Prove that for all integers $k$, the number $(k+1)^n-k^n-1$ is divisible by $k^2+k+1$.
2019 Gulf Math Olympiad, 2
1. Find $N$, the smallest positive multiple of $45$ such that all of its digits are either $7$ or $0$.
2. Find $M$, the smallest positive multiple of $32$ such that all of its digits are either $6$ or $1$.
3. How many elements of the set $\{1,2,3,...,1441\}$ have a positive multiple such that all of its digits are either $5$ or $2$?
2004 Finnish National High School Mathematics Competition, 4
The numbers $2005! + 2, 2005! + 3, ... , 2005! + 2005$ form a sequence of $2004$ consequtive integers, none of which is a prime number.
Does there exist a sequence of $2004$ consequtive integers containing exactly $12$ prime numbers?
2017 Czech-Polish-Slovak Match, 3
Let ${k}$ be a fixed positive integer. A finite sequence of integers ${x_1,x_2, ..., x_n}$ is written on a blackboard. Pepa and Geoff are playing a game that proceeds in rounds as follows.
- In each round, Pepa first partitions the sequence that is currently on the blackboard into two or more contiguous subsequences (that is, consisting of numbers appearing consecutively). However, if the number of these subsequences is larger than ${2}$, then the sum of numbers in each of them has to be divisible by ${k}$.
- Then Geoff selects one of the subsequences that Pepa has formed and wipes all the other subsequences from the blackboard.
The game finishes once there is only one number left on the board. Prove that Pepa may choose his moves so that independently of the moves of Geoff, the game finishes after at most ${3k}$ rounds.
(Poland)
1993 APMO, 2
Find the total number of different integer values the function \[ f(x) = [x] + [2x] + [\frac{5x}{3}] + [3x] + [4x] \] takes for real numbers $x$ with $0 \leq x \leq 100$.
2021 Durer Math Competition Finals, 14
How many functions $f : \{1, 2, . . . , 16\} \to \{1, 2, . . . , 16\}$ have the property that $f(f(x))-4x$ is divisible by $17$ for all integers $1 \le x \le 16$?
PEN J Problems, 11
Prove that ${d((n^2 +1)}^2)$ does not become monotonic from any given point onwards.
2001 Moldova Team Selection Test, 12
Let $n{}$ $(n\geq 1)$ be an integer and a set $A=\{1,2,\ldots,n\}$. The set $A{}$ is $k-partitionable$ if it can be partitioned in $k{}$ disjoint sets with the same sum of elements. Show that $A{}$ is $k-partitionable$ if and only if $2k$ divides $n(n+1)$ and $2k\leq n+1$.
2013 Math Prize for Girls Olympiad, 3
$10000$ nonzero digits are written in a $100$-by-$100$ table, one digit per cell. From left to right, each row forms a $100$-digit integer. From top to bottom, each column forms a $100$-digit integer. So the rows and columns form $200$ integers (each with $100$ digits), not necessarily distinct. Prove that if at least $199$ of these $200$ numbers are divisible by $2013$, then all of them are divisible by $2013$.
1969 Poland - Second Round, 2
Find all four-digit numbers in which the thousands digit is equal to the hundreds digit and the tens digit is equal to the units digit and which are squares of integers.
2019 Belarus Team Selection Test, 6.3
Let $n \ge 2018$ be an integer, and let $a_1, a_2, \dots, a_n, b_1, b_2, \dots, b_n$ be pairwise distinct positive integers not exceeding $5n$. Suppose that the sequence
\[ \frac{a_1}{b_1}, \frac{a_2}{b_2}, \dots, \frac{a_n}{b_n} \]
forms an arithmetic progression. Prove that the terms of the sequence are equal.
2009 Germany Team Selection Test, 1
For which $ n \geq 2, n \in \mathbb{N}$ are there positive integers $ A_1, A_2, \ldots, A_n$ which are not the same pairwise and have the property that the product $ \prod^n_{i \equal{} 1} (A_i \plus{} k)$ is a power for each natural number $ k.$
India EGMO 2024 TST, 4
Let $N \geq 3$ be an integer, and let $a_0, \dots, a_{N-1}$ be pairwise distinct reals so that $a_i \geq a_{2i}$ for all $i$ (indices are taken $\bmod~ N$). Find all possible $N$ for which this is possible.
[i]Proposed by Sutanay Bhattacharya[/i]
MOAA Gunga Bowls, 2022
[u]Set 7[/u]
[b]G19.[/b] How many ordered triples $(x, y, z)$ with $1 \le x, y, z \le 50$ are there such that both $x + y + z$ and $xy + yz + zx$ are divisible by$ 6$?
[b]G20.[/b] Triangle $ABC$ has orthocenter $H$ and circumcenter $O$. If $D$ is the foot of the perpendicular from $A$ to $BC$, then $AH = 8$ and $HD = 3$. If $\angle AOH = 90^o$, find $BC^2$.
[b]G21.[/b] Nate flips a fair coin until he gets two heads in a row, immediately followed by a tails. The probability that he flips the coin exactly $12$ times is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
[u]Set 8[/u]
[b]G22.[/b] Let $f$ be a function defined by $f(1) = 1$ and $$f(n) = \frac{1}{p}f\left(\frac{n}{p}\right)f(p) + 2p - 2,$$ where $p$ is the least prime dividing $n$, for all integers $n \ge 2$. Find $f(2022)$.
[b]G23.[/b] Jessica has $15$ balls numbered $1$ through $15$. With her left hand, she scoops up $2$ of the balls. With her right hand, she scoops up $2$ of the remaining balls. The probability that the sum of the balls in her left hand is equal to the sum of the balls in her right hand can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
[b]G24.[/b] Let $ABCD$ be a cyclic quadrilateral such that its diagonal $BD = 17$ is the diameter of its circumcircle. Given $AB = 8$, $BC = CD$, and that a line $\ell$ through A intersects the incircle of $ABD$ at two points $P$ and $Q$, the maximum area of $CP Q$ can be expressed as a fraction $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$.
[u]Set 9[/u]
[i]This set consists of three estimation problems, with scoring schemes described.[/i]
[b]G25.[/b] Estimate $N$, the total number of participants (in person and online) at MOAA this year. An estimate of $e$ gets a total of max $ \left( 0, \lfloor 150 \left( 1- \frac{|N-e|}{N}\right) \rfloor -120 \right)$ points.
[b]G26.[/b] If $A$ is the the total number of in person participants at MOAA this year, and $B$ is the total number of online participants at MOAA this year, estimate $N$, the product $AB$. An estimate of $e$ gets a total of max $(0, 30 - \lceil \log10(8|N - e| + 1)\rceil )$ points.
[b]G27.[/b] Estimate $N$, the total number of letters in all the teams that signed up for MOAA this year, both in person and online. An estimate of e gets a total of max $(0, 30 - \lceil 7 log5(|N - E|)\rceil )$ points.
PS. You should use hide for answers. Sets 1-3 have been posted [url=https://artofproblemsolving.com/community/c3h3131303p28367061]here [/url] and 4-6 [url=https://artofproblemsolving.com/community/c3h3131305p28367080]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].