Found problems: 4275
Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$.
Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.
َA natural number $n$ is given. Let $f(x,y)$ be a polynomial of degree less than $n$ such that for any positive integers $x,y\leq n, x+y \leq n+1$ the equality $f(x,y)=\frac{x}{y}$ holds. Find $f(0,0)$.
When \[x^5, \quad x+\frac{1}{x}\quad \text{and}\quad 1+\frac{2}{x} + \frac{3}{x^2}\] are multiplied, the product is a polynomial of degree
$ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 8 $
$ n $ is a natural number, and $ S $ is the sum of all the solutions of the equations
$$ x^2+a_k\cdot x+a_k=0,\quad a_k\in\mathbb{R} ,\quad k\in\{ 1,2,...,n\} . $$
Show that if $ |S|>2n\left( \sqrt[n]{n} -1\right) , $ then at least one of the equations has real solutions.
Determine all functions $ f: \mathbb{N}_0 \rightarrow \mathbb{N}_0$ such that $ f(f(n))\plus{}f(n)\equal{}2n\plus{}6$ for all $ n \in \mathbb{N}_0$.
Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.
Let $A_1A_2A_3A_4$ be a non-cyclic quadrilateral. Let $O_1$ and $r_1$ be the circumcentre and the circumradius of the triangle $A_2A_3A_4$. Define $O_2,O_3,O_4$ and $r_2,r_3,r_4$ in a similar way. Prove that
\[\frac{1}{O_1A_1^2-r_1^2}+\frac{1}{O_2A_2^2-r_2^2}+\frac{1}{O_3A_3^2-r_3^2}+\frac{1}{O_4A_4^2-r_4^2}=0.\]
[i]Proposed by Alexey Gladkich, Israel[/i]
[b]p1.[/b] Evaluate $6^4 +5^4 +3^4 +2^4$.
[b]p2.[/b] What digit is most frequent between $1$ and $1000$ inclusive?
[b]p3.[/b] Let $n = gcd \, (2^2 \cdot 3^3 \cdot 4^4,2^4 \cdot 3^3 \cdot 4^2)$. Find the number of positive integer factors of $n$.
[b]p4.[/b] Suppose $p$ and $q$ are prime numbers such that $13p +5q = 91$. Find $p +q$.
[b]p5.[/b] Let $x = (5^3 -5)(4^3 -4)(3^3 -3)(2^3 -2)(1^3 -1)$. Evaluate $2018^x$ .
[b]p6.[/b] Liszt the lister lists all $24$ four-digit integers that contain each of the digits $1,2,3,4$ exactly once in increasing order. What is the sum of the $20$th and $18$th numbers on Liszt’s list?
[b]p7.[/b] Square $ABCD$ has center $O$. Suppose $M$ is the midpoint of $AB$ and $OM +1 =OA$. Find the area of square $ABCD$.
[b]p8.[/b] How many positive $4$-digit integers have at most $3$ distinct digits?
[b]p9.[/b] Find the sumof all distinct integers obtained by placing $+$ and $-$ signs in the following spaces
$$2\_3\_4\_5$$
[b]p10.[/b] In triangle $ABC$, $\angle A = 2\angle B$. Let $I$ be the intersection of the angle bisectors of $B$ and $C$. Given that $AB = 12$, $BC = 14$,and $C A = 9$, find $AI$ .
[b]p11.[/b] You have a $3\times 3\times 3$ cube in front of you. You are given a knife to cut the cube and you are allowed to move the pieces after each cut before cutting it again. What is the minimumnumber of cuts you need tomake in order to cut the cube into $27$ $1\times 1\times 1$ cubes?
p12. How many ways can you choose $3$ distinct numbers fromthe set $\{1,2,3,...,20\}$ to create a geometric sequence?
[b]p13.[/b] Find the sum of all multiples of $12$ that are less than $10^4$ and contain only $0$ and $4$ as digits.
[b]p14.[/b] What is the smallest positive integer that has a different number of digits in each base from $2$ to $5$?
[b]p15.[/b] Given $3$ real numbers $(a,b,c)$ such that $$\frac{a}{b +c}=\frac{b}{3a+3c}=\frac{c}{a+3b},$$ find all possible values of $\frac{a +b}{c}$.
[b]p16.[/b] Let S be the set of lattice points $(x, y, z)$ in $R^3$ satisfying $0 \le x, y, z \le 2$. How many distinct triangles exist with all three vertices in $S$?
[b]p17.[/b] Let $\oplus$ be an operator such that for any $2$ real numbers $a$ and $b$, $a \oplus b = 20ab -4a -4b +1$. Evaluate $$\frac{1}{10} \oplus \frac19 \oplus \frac18 \oplus \frac17 \oplus \frac16 \oplus \frac15 \oplus \frac14 \oplus \frac13 \oplus \frac12 \oplus 1.$$
[b]p18.[/b] A function $f :N \to N$ satisfies $f ( f (x)) = x$ and $f (2f (2x +16)) = f \left(\frac{1}{x+8} \right)$ for all positive integers $x$. Find $f (2018)$.
[b]p19.[/b] There exists an integer divisor $d$ of $240100490001$ such that $490000 < d < 491000$. Find $d$.
[b]p20.[/b] Let $a$ and $b$ be not necessarily distinct positive integers chosen independently and uniformly at random from the set $\{1,2, 3, ... ,511,512\}$. Let $x = \frac{a}{b}$ . Find the probability that $(-1)^x$ is a real number.
[b]p21[/b]. In $\vartriangle ABC$ we have $AB = 4$, $BC = 6$, and $\angle ABC = 135^o$. $\angle ABC$ is trisected by rays $B_1$ and $B_2$. Ray $B_1$ intersects side $C A$ at point $F$, and ray $B_2$ intersects side $C A$ at point $G$. What is the area of $\vartriangle BFG$?
[b]p22.[/b] A level number is a number which can be expressed as $x \cdot \lfloor x \rfloor \cdot \lceil x \rceil$ where $x$ is a real number. Find the number of positive integers less than or equal to $1000$ which are also level numbers.
[b]p23.[/b] Triangle $\vartriangle ABC$ has sidelengths $AB = 13$, $BC = 14$, $C A = 15$ and circumcenter $O$. Let $D$ be the intersection of $AO$ and $BC$. Compute $BD/DC$.
[b]p24.[/b] Let $f (x) = x^4 -3x^3 +2x^2 +5x -4$ be a quartic polynomial with roots $a,b,c,d$. Compute
$$\left(a+1 +\frac{1}{a} \right)\left(b+1 +\frac{1}{b} \right)\left(c+1 +\frac{1}{c} \right)\left(d+1 +\frac{1}{d} \right).$$
[b]p25.[/b] Triangle $\vartriangle ABC$ has centroid $G$ and circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 2018$, $BD =20$, and $CD = 18$, find the area of triangle $\vartriangle DOG$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $Q(x)=a_0+a_1x+\dots+a_nx^n$ be a polynomial with integer coefficients, and $0\le a_i<3$ for all $0\le i\le n$.
Given that $Q(\sqrt{3})=20+17\sqrt{3}$, compute $Q(2)$.
Let $ f(0) \equal{} f(1) \equal{} 0$ and
\[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\]
Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$
Find all polynomials $P(x)$ with integer coefficients such that for all positive integers $n$, we have that $P(n)$ is not zero and $\frac{P(\overline{nn})}{P(n)}$ is an integer, where $\overline{nn}$ is the integer obtained upon concatenating $n$ with itself.
We say $p(x,y)\in \mathbb{R}\left[x,y\right]$ is [i]good[/i] if for any $y \neq 0$ we have $p(x,y) = p\left(xy,\frac{1}{y}\right)$ . Prove that there are good polynomials $r(x,y) ,s(x,y)\in \mathbb{R}\left[x,y\right]$ such that for any good polynomial $p$ there is a $f(x,y)\in \mathbb{R}\left[x,y\right]$ such that \[f(r(x,y),s(x,y))= p(x,y)\]
[i]Proposed by Mohammad Ahmadi[/i]
Polynomial $ f\left(x\right)$ satisfies $ \left(x \minus{} 1\right)f\left(x \plus{} 1\right) \minus{} \left(x \plus{} 2\right)f\left(x\right) \equal{} 0$ for every $ x\in \Re$. If $ f\left(2\right) \equal{} 6$, $ f\left({\tfrac{3}{2}} \right) \equal{} ?$
$\textbf{(A)}\ -6 \qquad\textbf{(B)}\ 0 \qquad\textbf{(C)}\ \frac {3}{2} \qquad\textbf{(D)}\ \frac {15}{8} \qquad\textbf{(E)}\ \text{None}$
A polynomial with integer coefficients takes the value $5$ at five distinct integers. Show that it does not take the value $9$ at any integer.
a) Consider the function $$f(x,y) = x^2 + xy + y^2$$ Prove that for the every point $(x,y)$ there exist such integers $(m,n)$, that $$f((x-m),(y-n)) \le 1/2$$
b) Let us denote with $g(x,y)$ the least possible value of the $f((x-m),(y-n))$ for all the integers $m,n$. The statement a) was equal to the fact $g(x,y) \le 1/2$.
Prove that in fact, $$g(x,y) \le 1/3$$
Find all the points $(x,y)$, where $g(x,y)=1/3$.
c) Consider function $$f_a(x,y) = x^2 + axy + y^2 \,\,\, (0 \le a \le 2)$$
Find any $c$ such that $g_a(x,y) \le c$.
Try to obtain the closest estimation.
Find all polynomials $P(x)$ with integer coefficients, such that for all positive integers $m, n$, $$m+n \mid P^{(m)}(n)-P^{(n)}(m).$$
[i]Proposed by Navid Safaei, Iran[/i]
For positive integers $i$ and $N$, let $k_{N,i}$ be the $i$th smallest positive integer such that the polynomial $\frac{x^2}{2023} + \frac{N_x}{7} - k_{N,i}$ has integer roots. Compute the minimum positive integer $N$ satisfying the condition $\frac{k_{N,2023}}{k_{N,1000}}< 3$.
Submit your answer as a positive integer $E$. If the correct answer is $A$, your score for this question will be
$\max \left( 0, 25 \min \left( \frac{A}{E} , \frac{E}{A}\right)^{\frac32}\right)$, rounded to the nearest integer.
Let $ f(0) \equal{} f(1) \equal{} 0$ and
\[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\]
Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$
We define two polynomials with integer coefficients P,Q to be similar if the coefficients of P are a permutation of the coefficients of Q.
a) if P,Q are similar, then $P(2007)-Q(2007)$ is even
b) does there exist an integer $k > 2$ such that $k \mid P(2007)-Q(2007)$ for all similar polynomials P,Q?
[u]Round 1[/u]
[b]1.1.[/b] Suppose a certain menu has $3$ sandwiches and $5$ drinks. How many ways are there to pick a meal so that you have exactly a drink and a sandwich?
[b]1.2.[/b] If $a + b = 4$ and $a + 3b = 222222$, find $10a + b$.
[b]1.3.[/b] Compute $$\left\lfloor \frac{2019 \cdot 2017}{2018} \right\rfloor $$ where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.
[u]Round 2[/u]
[b]2.1.[/b] Andrew has $10$ water bottles, each of which can hold at most $10$ cups of water. Three bottles are thirty percent filled, five are twenty-four percent filled, and the rest are empty. What is the average amount of water, in cups, contained in the ten water bottles?
[b]2.2.[/b] How many positive integers divide $195$ evenly?
[b]2.3.[/b] Square $A$ has side length $\ell$ and area $128$. Square $B$ has side length $\ell/2$. Find the length of the diagonal of Square $B$.
[u]Round 3[/u]
[b]3.1.[/b] A right triangle with area $96$ is inscribed in a circle. If all the side lengths are positive integers, what is the area of the circle? Express your answer in terms of $\pi$.
[b]3.2.[/b] A circular spinner has four regions labeled $3, 5, 6, 10$. The region labeled $3$ is $1/3$ of the spinner, $5$ is $1/6$ of the spinner, $6$ is $1/10$ of the spinner, and the region labeled $10$ is $2/5$ of the spinner. If the spinner is spun once randomly, what is the expected value of the number on which it lands?
[b]3.3.[/b] Find the integer k such that $k^3 = 8353070389$
[u]Round 4[/u]
[b]4.1.[/b] How many ways are there to arrange the letters in the word [b]zugzwang [/b] such that the two z’s are not consecutive?
[b]4.2.[/b] If $O$ is the circumcenter of $\vartriangle ABC$, $AD$ is the altitude from $A$ to $BC$, $\angle CAB = 66^o$ and $\angle ABC = 44^o$, then what is the measure of $\angle OAD$ ?
[b]4.3.[/b] If $x > 0$ satisfies $x^3 +\frac{1}{x^3} = 18$, find $x^5 +\frac{1}{x^5}$
[u]Round 5[/u]
[b]5.1.[/b] Let $C$ be the answer to Question $3$. Neethen decides to run for school president! To be entered onto the ballot, however, Neethen needs $C + 1$ signatures. Since no one else will support him, Neethen gets the remaining $C$ other signatures through bribery. The situation can be modeled by $k \cdot N = 495$, where $k$ is the number of dollars he gives each person, and $N$ is the number of signatures he will get. How many dollars does Neethen have to bribe each person with to get exactly C signatures?
[b]5.2.[/b] Let $A$ be the answer to Question $1$. With $3A - 1$ total votes, Neethen still comes short in the election, losing to Serena by just $1$ vote. Darn! Neethen sneaks into the ballot room, knowing that if he destroys just two ballots that voted for Serena, he will win the election. How many ways can Neethen choose two ballots to destroy?
[b]5.3.[/b] Let $B$ be the answer to Question $2$. Oh no! Neethen is caught rigging the election by the principal! For his punishment, Neethen needs to run the perimeter of his school three times. The school is modeled by a square of side length $k$ furlongs, where $k$ is an integer. If Neethen runs $B$ feet in total, what is $k + 1$? (Note: one furlong is $1/8$ of a mile).
[u]Round 6[/u]
[b]6.1.[/b] Find the unique real positive solution to the equation $x =\sqrt{6 + 2\sqrt6 + 2x}- \sqrt{6 - 2\sqrt6 - 2x} -\sqrt6$.
[b]6.2.[/b] Consider triangle ABC with $AB = 13$ and $AC = 14$. Point $D$ lies on $BC$, and the lengths of the perpendiculars from $D$ to $AB$ and $AC$ are both $\frac{56}{9}$. Find the largest possible length of $BD$.
[b]6.3.[/b] Let $f(x, y) = \frac{m}{n}$, where $m$ is the smallest positive integer such that $x$ and $y$ divide $m$, and $n$ is the largest positive integer such that $n$ divides both $x$ and $y$. If $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$, what is the median of the distinct values that $f(a, b)$ can take, where $a, b \in S$?
[u]Round 7[/u]
[b]7.1.[/b] The polynomial $y = x^4 - 22x^2 - 48x - 23$ can be written in the form $$y = (x - \sqrt{a} - \sqrt{b} - \sqrt{c})(x - \sqrt{a} +\sqrt{b} +\sqrt{c})(x +\sqrt{a} -\sqrt{b} +\sqrt{c})(x +\sqrt{a} +\sqrt{b} -\sqrt{c})$$ for positive integers $a, b, c$ with $a \le b \le c$. Find $(a + b)\cdot c$.
[b]7.2.[/b] Varun is grounded for getting an $F$ in every class. However, because his parents don’t like him, rather than making him stay at home they toss him onto a number line at the number $3$. A wall is placed at $0$ and a door to freedom is placed at $10$. To escape the number line, Varun must reach 10, at which point he walks through the door to freedom. Every $5$ minutes a bell rings, and Varun may walk to a different number, and he may not walk to a different number except when the bell rings. Being an $F$ student, rather than walking straight to the door to freedom, whenever the bell rings Varun just randomly chooses an adjacent integer with equal chance and walks towards it. Whenever he is at $0$ he walks to $ 1$ with a $100$ percent chance. What is the expected number of times Varun will visit $0$ before he escapes through the door to freedom?
[b]7.3.[/b] Let $\{a_1, a_2, a_3, a_4, a_5, a_6\}$ be a set of positive integers such that every element divides $36$ under the condition that $a_1 < a_2 <... < a_6$. Find the probability that one of these chosen sets also satisfies the condition that every $a_i| a_j$ if $i|j$.
[u]Round 8[/u]
[b]8.[/b] How many numbers between $1$ and $100, 000$ can be expressed as the product of at most $3$ distinct primes?
Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input.
$$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $n\ge3$ be a positive integer. Find the real numbers $x_1\ge0,\ldots,x_n\ge 0$, with $x_1+x_2+\ldots +x_n=n$, for which the expression \[(n-1)(x_1^2+x_2^2+\ldots+x_n^2)+nx_1x_2\ldots x_n\] takes a minimal value.
Suppose $P(x,y)$ is a homogenous non-constant polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for all real $t$. Prove that $P(x,y) = (x^2+y^2)^k$ for some positive integer $k$.
(A polynomial $A(x,y)$ with real coefficients and having a degree of $n$ is homogenous if it is the sum of $a_ix^iy^{n-i}$ for some real number $a_i$, for all integer $0 \le i \le n$.)
Let $k$ and $n$ be positive integers and let $x_1, x_2, \cdots, x_k, y_1, y_2, \cdots, y_n$ be distinct integers. A polynomial $P$ with integer coefficients satisfies
\[P(x_1)=P(x_2)= \cdots = P(x_k)=54\]
\[P(y_1)=P(y_2)= \cdots = P(y_n)=2013.\]
Determine the maximal value of $kn$.
We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets.
For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$.
[i]Proposed by Victor Wang[/i]
Let $k$ be any fixed positive integer. Let's look at integer pairs $(a, b)$, for which the quadratic equations $x^2 - 2ax + b = 0$ and $y^2 + 2ay + b = 0$ are real solutions (not necessarily different), which can be denoted by $x_1, x_2$ and $y_1, y_2$, respectively, in such an order that the equation $x_1 y_1 - x_2 y_2 = 4k$.
a) Find the largest possible value of the second component $b$ of such a pair of numbers ($a, b)$.
b) Find the sum of the other components of all such pairs of numbers.