Found problems: 4275
[u]Part 6 [/u]
[b]p16.[/b] Le[b][/b]t $p(x)$ and $q(x)$ be polynomials with integer coefficients satisfying $p(1) = q(1)$. Find the greatest integer $n$ such that $\frac{p(2023)-q(2023)}{n}$ is an integer no matter what $p(x)$ and $q(x)$ are.
[b]p17.[/b] Find all ordered pairs of integers $(m,n)$ that satisfy $n^3 +m^3 +231 = n^2m^2 +nm.$
[b]p18.[/b] Ben rolls the frustum-shaped piece of candy (shown below) in such a way that the lateral area is always in contact with the table. He rolls the candy until it returns to its original position and orientation. Given that $AB = 4$ and $BD =CD = 3$, find the length of the path traced by $A$.
[u]Part 7 [/u]
[b]p19.[/b] In their science class, Adam, Chris, Eddie and Sam are independently and randomly assigned an integer grade between $70$ and $79$ inclusive. Given that they each have a distinct grade, what is the expected value of the maximum grade among their four grades?
[b]p20.[/b] Let $ABCD$ be a regular tetrahedron with side length $2$. Let point $E$ be the foot of the perpendicular
from $D$ to the plane containing $\vartriangle ABC$. There exist two distinct spheres $\omega_1$ and $\omega_2$, centered at points $O_1$ and $O_2$ respectively, such that both $O_1$ and $O_2$ lie on $\overrightarrow{DE}$ and both spheres are tangent to all four of the planes $ABC$, $BCD$, $CDA$, and $DAB$. Find the sum of the volumes of $\omega_1$ and $\omega_2$.
[b]p21.[/b] Evaluate
$$\sum^{\infty}_{i=0}\sum^{\infty}_{j=0}\sum^{\infty}_{k=0} \frac{1}{(i + j +k +1)2^{i+j+k+1}}.$$
[u]Part 8 [/u]
[b]p22.[/b] In $\vartriangle ABC$, let $I_A$, $I_B$ , and $I_C$ denote the $A$, $B$, and $C$-excenters, respectively. Given that $AB = 15$, $BC = 14$ and $C A = 13$, find $\frac{[I_A I_B I_C ]}{[ABC]}$ .
[b]p23.[/b] The polynomial $x +2x^2 +3x^3 +4x^4 +5x^5 +6x^6 +5x^7 +4x^8 +3x^9 +2x^{10} +x^{11}$ has distinct complex roots $z_1, z_2, ..., z_n$. Find $$\sum^n_{k=1} |R(z^2n))|+|I(z^2n)|,$$ where $R(z)$ and $I(z)$ indicate the real and imaginary parts of $z$, respectively. Express your answer in simplest radical form.
[b]p24.[/b] Given that $\sin 33^o +2\sin 161^o \cdot \sin 38^o = \sin n^o$ , compute the least positive integer value of $n$.
[u]Part 9[/u]
[b]p25.[/b] Submit a prime between $2$ and $2023$, inclusive. If you don’t, or if you submit the same number as another team’s submission, you will receive $0$ points. Otherwise, your score will be $\min \left(30, \lfloor 4 \cdot ln(x) \rfloor \right)$, where $x$ is the positive difference between your submission and the closest valid submission made by another team.
[b]p26.[/b] Sam, Derek, Jacob, andMuztaba are eating a very large pizza with $2023$ slices. Due to dietary preferences, Sam will only eat an even number of slices, Derek will only eat a multiple of $3$ slices, Jacob will only eat a multiple of $5$ slices, andMuztaba will only eat a multiple of $7$ slices. How many ways are there for Sam, Derek, Jacob, andMuztaba to eat the pizza, given that all slices are identical and order of slices eaten is irrelevant? If your answer is $A$ and the correct answer is $C$, the number of points you receive will be: irrelevant? If your answer is $A$ and the correct answer is $C$, the number of points you receive will be:
$$\max \left( 0, \left\lfloor 30 \left( 1-2\sqrt{\frac{|A-C|}{C}}\right)\right\rfloor \right)$$
[b]p27.[/b] Let $ \Omega_(k)$ denote the number of perfect square divisors of $k$. Compute $$\sum^{10000}_{k=1} \Omega_(k).$$
If your answer is $A$ and the correct answer is $C$, the number of points you recieve will be
$$\max \left( 0, \left\lfloor 30 \left( 1-4\sqrt{\frac{|A-C|}{C}}\right)\right\rfloor \right)$$
PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3267911p30056982]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $p$, $q$, and $r$ be the distinct roots of the polynomial $x^3 - 22x^2 + 80x - 67$. It is given that there exist real numbers $A$, $B$, and $C$ such that \[\dfrac{1}{s^3 - 22s^2 + 80s - 67} = \dfrac{A}{s-p} + \dfrac{B}{s-q} + \frac{C}{s-r}\] for all $s\not\in\{p,q,r\}$. What is $\tfrac1A+\tfrac1B+\tfrac1C$?
$\textbf{(A) }243\qquad\textbf{(B) }244\qquad\textbf{(C) }245\qquad\textbf{(D) }246\qquad\textbf{(E) } 247$
[b]p1.[/b] Give a fake proof that $0 = 1$ on the back of this page. The most convincing answer to this question at this test site will receive a point.
[b]p2.[/b] It is often said that once you assume something false, anything can be derived from it. You may assume for this question that $0 = 1$, but you can only use other statements if they are generally accepted as true or if your prove them from this assumption and other generally acceptable mathematical statements. With this in mind, on the back of this page prove that every number is the same number.
[b]p3.[/b] Suppose you write out all integers between $1$ and $1000$ inclusive. (The list would look something like $1$, $2$, $3$, $...$ , $10$, $11$, $...$ , $999$, $1000$.) Which digit occurs least frequently?
[b]p4.[/b] Pick a real number between $0$ and $1$ inclusive. If your response is $r$ and the standard deviation of all responses at this site to this question is $\sigma$, you will receive $r(1 - (r - \sigma)^2)$ points.
[b]p5.[/b] Find the sum of all possible values of $x$ that satisfy $243^{x+1} = 81^{x^2+2x}$.
[b]p6.[/b] How many times during the day are the hour and minute hands of a clock aligned?
[b]p7.[/b] A group of $N + 1$ students are at a math competition. All of them are wearing a single hat on their head. $N$ of the hats are red; one is blue. Anyone wearing a red hat can steal the blue hat, but in the process that person’s red hat disappears. In fact, someone can only steal the blue hat if they are wearing a red hat. After stealing it, they would wear the blue hat. Everyone prefers the blue hat over a red hat, but they would rather have a red hat than no hat at all. Assuming that everyone is perfectly rational, find the largest prime $N$ such that nobody will ever steal the blue hat.
[b]p8.[/b] On the back of this page, prove there is no function f$(x)$ for which there exists a (finite degree) polynomial $p(x)$ such that $f(x) = p(x)(x + 3) + 8$ and $f(3x) = 2f(x)$.
[b]p9.[/b] Given a cyclic quadrilateral $YALE$ with $Y A = 2$, $AL = 10$, $LE = 11$, $EY = 5$, what is the area of $YALE$?
[b]p10.[/b] About how many pencils are made in the U.S. every year? If your answer to this question is $p$, and our (good) estimate is $\rho$, then you will receive $\max(0, 1 -\frac 12 | \log_{10}(p) - \log_{10}(\rho)|)$ points.
[b]p11.[/b] The largest prime factor of $520, 302, 325$ has $5$ digits. What is this prime factor?
[b]p12.[/b] The previous question was on the individual round from last year. It was one of the least frequently correctly answered questions. The first step to solving the problem and spotting the pattern is to divide $520, 302, 325$ by an appropriate integer. Unfortunately, when solving the problem many people divide it by $n$ instead, and then they fail to see the pattern. What is $n$?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Prove that there exist integers $a, b, c$ all greater than $2011$ such that
\[(a+\sqrt{b})^c=\ldots 2010 \cdot 2011\ldots\]
[Decimal point separates an integer ending in $2010$ and a decimal part beginning with $2011$.]
Determine all $n \in \mathbb{N}$ for which $n^{10} + n^5 + 1$ is prime.
[u]Round 1[/u]
[b]p1.[/b] Elaine creates a sequence of positive integers $\{s_n\}$. She starts with $s_1 = 2018$. For $n \ge 2$, she sets $s_n =\frac12 s_{n-1}$ if $s_{n-1}$ is even and $s_n = s_{n-1} + 1$ if $s_{n-1}$ is odd. Find the smallest positive integer $n$ such that $s_n = 1$, or submit “$0$” as your answer if no such $n$ exists.
[b]p2.[/b] Alice rolls a fair six-sided die with the numbers $1$ through $6$, and Bob rolls a fair eight-sided die with the numbers $1$ through $8$. Alice wins if her number divides Bob’s number, and Bob wins otherwise. What is the probability that Alice wins?
[b]p3.[/b] Four circles each of radius $\frac14$ are centered at the points $\left( \pm \frac14, \pm \frac14 \right)$, and ther exists a fifth circle is externally tangent to these four circles. What is the radius of this fifth circle?
[u]Round 2 [/u]
[b]p4.[/b] If Anna rows at a constant speed, it takes her two hours to row her boat up the river (which flows at a constant rate) to Bob’s house and thirty minutes to row back home. How many minutes would it take Anna to row to Bob’s house if the river were to stop flowing?
[b]p5.[/b] Let $a_1 = 2018$, and for $n \ge 2$ define $a_n = 2018^{a_{n-1}}$ . What is the ones digit of $a_{2018}$?
[b]p6.[/b] We can write $(x + 35)^n =\sum_{i=0}^n c_ix^i$ for some positive integer $n$ and real numbers $c_i$. If $c_0 = c_2$, what is $n$?
[u]Round 3[/u]
[b]p7.[/b] How many positive integers are factors of $12!$ but not of $(7!)^2$?
[b]p8.[/b] How many ordered pairs $(f(x), g(x))$ of polynomials of degree at least $1$ with integer coefficients satisfy $f(x)g(x) = 50x^6 - 3200$?
[b]p9.[/b] On a math test, Alice, Bob, and Carol are each equally likely to receive any integer score between $1$ and $10$ (inclusive). What is the probability that the average of their three scores is an integer?
[u]Round 4[/u]
[b]p10.[/b] Find the largest positive integer N such that $$(a-b)(a-c)(a-d)(a-e)(b-c)(b-d)(b-e)(c-d)(c-e)(d-e)$$ is divisible by $N$ for all choices of positive integers $a > b > c > d > e$.
[b]p11.[/b] Let $ABCDE$ be a square pyramid with $ABCD$ a square and E the apex of the pyramid. Each side length of $ABCDE$ is $6$. Let $ABCDD'C'B'A'$ be a cube, where $AA'$, $BB'$, $CC'$, $DD'$ are edges of the cube. Andy the ant is on the surface of $EABCDD'C'B'A'$ at the center of triangle $ABE$ (call this point $G$) and wants to crawl on the surface of the cube to $D'$. What is the length the shortest path from $G$ to $D'$? Write your answer in the form $\sqrt{a + b\sqrt3}$, where $a$ and $b$ are positive integers.
[b]p12.[/b] A six-digit palindrome is a positive integer between $100, 000$ and $999, 999$ (inclusive) which is the same read forwards and backwards in base ten. How many composite six-digit palindromes are there?
PS. You should use hide for answers. Rounds 5-7 have been posted [url=https://artofproblemsolving.com/community/c4h2784943p24473026]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Factor $a^{10} + a^5 + 1$ into nonconstant polynomials with integer coefficients
For every non-constant polynomial $p$, let $H_p=\big\{z\in \mathbb{C} \, \big| \, |p(z)|=1\big\}$. Prove that if $H_p=H_q$ for some polynomials $p,q$, then there exists a polynomial $r$ such that $p=r^m$ and $q=\xi\cdot r^n$ for some positive integers $m,n$ and constant $|\xi|=1$.
Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.
$\mathbb{N}_{10}$ is generalization of $\mathbb{N}$ that every hypernumber in $\mathbb{N}_{10}$ is something like: $\overline{...a_2a_1a_0}$ with $a_i \in {0,1..9}$
(Notice that $\overline {...000} \in \mathbb{N}_{10}$)
Also we easily have $+,*$ in $\mathbb{N}_{10}$.
first $k$ number of $a*b$= first $k$ nubmer of (first $k$ number of a * first $k$ number of b)
first $k$ number of $a+b$= first $k$ nubmer of (first $k$ number of a + first $k$ number of b)
Fore example $\overline {...999}+ \overline {...0001}= \overline {...000}$
Prove that every monic polynomial in $\mathbb{N}_{10}[x]$ with degree $d$ has at most $d^2$ roots.
Let $k$ be a positive integer. Find all collection of integers $(a_1, a_2,\cdots, a_k)$ such that there exist a non-linear polynomial $P$ with integer coefficients, so that for all positive integers $n$ there exist a positive integer $m$ satisfying: $$P(n+a_1)+P(n+a_2)+...+P(n+a_k)=P(m)$$
[i]Proposed by Ivan Chan Kai Chin[/i]
Let $\alpha$ be an arbitrary angle and let $x = cos\alpha, y = cosn\alpha$ ($n \in Z$).
i) Prove that to each value $x \in [-1, 1]$ corresponds one and only one value of $y$.
Thus we can write $y$ as a function of $x, y = T_n(x)$.
Compute $T_1(x), T_2(x)$ and prove that $T_{n+1}(x) = 2xT_n(x) - T_{n-1}(x)$.
From this it follows that $T_n(x)$ is a polynomial of degree $n$.
ii) Prove that the polynomial $T_n(x$) has $n$ distinct roots in $[-1, 1]$.
Given that $a$ is a real solution to the polynomial equation $$nx^n-x^{n-1}-x^{n-2}-\cdots-x-1=0$$ where $n$ is a positive integer, show that $a=1$ or $-1<a<0$.
Prove that for any positive integer $ n$, there exists only $ n$ degree polynomial $ f(x),$ satisfying $ f(0) \equal{} 1$ and $ (x \plus{} 1)[f(x)]^2 \minus{} 1$ is an odd function.
a) Year 1872 Texas
3 gold miners found a peice of gold. They have a coin that with possibility of $\frac 12$ it will come each side, and they want to give the piece of gold to one of themselves depending on how the coin will come. Design a fair method (It means that each of the 3 miners will win the piece of gold with possibility of $\frac 13$) for the miners.
b) Year 2005, faculty of Mathematics, Sharif university of Technolgy
Suppose $0<\alpha<1$ and we want to find a way for people name $A$ and $B$ that the possibity of winning of $A$ is $\alpha$. Is it possible to find this way?
c) Year 2005 Ahvaz, Takhti Stadium
Two soccer teams have a contest. And we want to choose each player's side with the coin, But we don't know that our coin is fair or not. Find a way to find that coin is fair or not?
d) Year 2005,summer
In the National mathematical Oympiad in Iran. Each student has a coin and must find a way that the possibility of coin being TAIL is $\alpha$ or no. Find a way for the student.
Consider $p$ a prime number and $p$ consecutive positive integers $m_{1}, m_{2}, \ldots, m_{p}$. Choose a permutation $\sigma$ of $1, 2, \ldots, p$. Show that there exist two different numbers $k,l \in \{1,2, \ldots, p\}$ such that $m_{k}m_{\sigma(k)}-m_{l}m_{\sigma(l)}$ is divisible by $p$.
Let $f(x)$ be a polynomial of degree $3$ with real coefficients satisfying $|f(x)| = 12$ for $x = 1, 2, 3, 5, 6, 7$. Find $|f(0)|$.
A zig-zag in the plane consists of two parallel half-lines connected by a line segment. Find $z_n$, the maximum number of regions into which $n$ zig-zags can divide the plane. For example, $z_1=2,z_2=12$(see the diagram). Of these $z_n$ regions how many are bounded? [The zig-zags can be as narrow as you please.] Express your answers as polynomials in $n$ of degree not exceeding $2$.
[asy]
draw((30,0)--(-70,0), Arrow);
draw((30,0)--(-20,-40));
draw((-20,-40)--(80,-40), Arrow);
draw((0,-60)--(-40,20), dashed, Arrow);
draw((0,-60)--(0,15), dashed);
draw((0,15)--(40,-65),dashed, Arrow);
[/asy]
Let $f$ be a polynomial function with integer coefficients and $p$ be a prime number. Suppose there are at least four distinct integers satisfying $f(x) = p$. Show that $f$ does not have integer zeros.
Given a quadratic trinomial $p(x)$ with integer coefficients such that $p(x)$ is not divisible by $3$ for all integers $x$.
Prove that there exist polynomials $f(x)$ and $h(x)$ with integer coefficients such that
$$
p(x)\cdot f(x)+3h(x)=x^6+x^4+x^2+1.
$$
[i](I. Gorodnin)[/i]
A polynomial is [i]good[/i] if it has integer coefficients, it is monic, all its roots are distinct, and there exists a disk with radius $0.99$ on the complex plane that contains all the roots. Prove that there is no [i]good[/i] polynomial for a sufficient large degree.
[i]Proposed by Rodrigo Sanches Angelo (rsa365), Brazil.[/i]
Let $a_1,\ldots, a_n$ be real numbers. Define polynomials $f,g$ by $$f(x)=\sum_{k=1}^n a_kx^k,\ g(x)=\sum_{k=1}^n \frac{a_k}{2^k-1}x^k.$$ Assume that $g(2016)=0$. Prove that $f(x)$ has a root in $(0;2016)$.
Prove that for any prime $p$ in the interval $\left]n, \frac{4n}{3}\right]$, $p$ divides \[\sum^{n}_{j=0}{{n}\choose{j}}^{4}.\]
In a rectangular coordinate system we call a horizontal line parallel to the $x$ -axis triangular if it intersects the curve with equation \[y = x^4 + px^3 + qx^2 + rx + s\] in the points $A,B,C$ and $D$ (from left to right) such that the segments $AB, AC$ and $AD$ are the sides of a triangle. Prove that the lines parallel to the $x$ - axis intersecting the curve in four distinct points are all triangular or none of them is triangular.
Find all positive integers $n$ such that there exist non-constant polynomials with integer coefficients $f_1(x),...,f_n(x)$ (not necessarily distinct) and $g(x)$ such that $$1 + \prod_{k=1}^{n}\left(f^2_k(x)-1\right)=(x^2+2013)^2g^2(x)$$