Found problems: 85335
Prove that $n^2 + 3n + 5$ is not divisible by $121$ for any positive integer $n$.
For every real number $ b$ determine all real numbers $ x$ satisfying $ x\minus{}b\equal{} \sum_{k\equal{}0}^{\infty}x^k$.
From the point $ S $ of space arise $ 3 $ half-lines: $ SA $, $ SB $ and $ SC $, none of which is perpendicular to both others. Through each of these rays, a plane is drawn perpendicular to the plane containing the other two rays. Prove that the drawn planes intersect along one line $ d $.
Which of the following divides $3^{3n+1} + 5^{3n+2}+7^{3n+3}$ for every positive integer $n$?
$
\textbf{(A)}\ 3
\qquad\textbf{(B)}\ 5
\qquad\textbf{(C)}\ 7
\qquad\textbf{(D)}\ 11
\qquad\textbf{(E)}\ 53
$
An unordered triple of numbers $(a,b,c)$ in one move you can change to either $(a,b,2a+2b-c)$, $(a,2a+2c-b,c)$ or $(2b+2c-a,b,c)$.
Can you from the triple $(3,5,14)$ get the triple $(3,13,6)$ in finite amount of moves?
A scanning code consists of a $7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$ squares. A scanning code is called [i]symmetric[/i] if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$
Suppose $P(x) = x^n + a_{n-1} x^{n-1} + \cdots + a_1x + a_0$ where $a_0, a_1, \ldots, a_{n-1}$ are reals for $n\geq 1$ (monic $n$th-degree polynomial with real coefficients). If the inequality
\[ 3(P(x)+P(y)) \geq P(x+y) \] holds for all reals $x,y$, determine the minimum possible value of $P(2024)$.
Let $ \mathbb{Z}$ be the set of all integers. Define the set $ \mathbb{H}$ as follows:
(1). $ \dfrac{1}{2} \in \mathbb{H}$,
(2). if $ x \in \mathbb{H}$, then $ \dfrac{1}{1\plus{}x} \in \mathbb{H}$ and also $ \dfrac{x}{1\plus{}x} \in \mathbb{H}$.
Prove that there exists a bijective function $ f: \mathbb{Z} \rightarrow \mathbb{H}$.
The real numbers $a_1,a_2,\ldots,a_{100}$ satisfy the relationship
\[ a_1^2+ a_2^2 + \cdots +a_{100}^2 + ( a_1+a_2 + \cdots + a_{100})^2 = 101. \]
Prove that $|a_k|\leq 10$, for all $k=1,2,\ldots,100$.
Point $P$ is taken inside the square $ABCD$ such that $BP + DP=25$, $CP - AP = 15$ and $\angle$[b]ABP =[/b] $\angle$[b]ADP[/b]. What is the radius of the circumcircle of $ABCD$?
Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.
In a convex hexagon $ABCDEF$ equalities $\angle ABC= \angle CDE= \angle EFA$ hold, and the angle bisectors of angles $ABC$, $CDE$ and $EFA$ intersect in one point. Rays $AB$ and $DC$ intersect at $P$, rays $BC$ and $ED$ - at $Q$, rays $CD$ and $FE$ - at $R$, rays $DE$ and $AF$ - at $S$.
Prove that $PR=QS$
[i]M. Zorka[/i]
For any $16$ positive integers $n,a_1,a_2,...,a_{15}$ we define $T(n,a_1,a_2,...,a_{15}) = (a_1^n+a_2^n+ ...+a_{15}^n)a_1a_2...a_{15}$.
Find the smallest $n$ such that $T(n,a_1,a_2,...,a_{15})$ is divisible by $15$ for any choice of $a_1,a_2,...,a_{15}$.
Find all polynomials $P(x)$ such that
\[
P(x^3+1)=P(x^3)+P(x^2).
\]
[i]Proposed by A. Golovanov[/i]
The figure on the right shows the ellipse $\frac{(x-19)^2}{19}+\frac{(x-98)^2}{98}=1998$.
Let $R_1,R_2,R_3,$ and $R_4$ denote those areas within the ellipse that are in the first, second, third, and fourth quadrants, respectively. Determine the value of $R_1-R_2+R_3-R_4$.
[asy]
defaultpen(linewidth(0.7));
pair c=(19,98);
real dist = 30;
real a = sqrt(1998*19),b=sqrt(1998*98);
xaxis("x",c.x-a-dist,c.x+a+3*dist,EndArrow);
yaxis("y",c.y-b-dist*2,c.y+b+3*dist,EndArrow);
draw(ellipse(c,a,b));
label("$R_1$",(100,200));
label("$R_2$",(-80,200));
label("$R_3$",(-60,-150));
label("$R_4$",(70,-150));[/asy]
The positive integers from 1 to $n^2$ are placed arbitrarily on the $n^2$ squares of a $n\times n$ chessboard. Two squares are called [i]adjacent[/i] if they have a common side. Show that two opposite corner squares can be joined by a path of $2n-1$ adjacent squares so that the sum of the numbers placed on them is at least $\left\lfloor \frac{n^3} 2 \right\rfloor + n^2 - n + 1$.
[i]Radu Gologan[/i]
In a circle with center $M$, two chords $AC$ and $BD$ intersect perpendicularly.
The circle of diameter $AM$ intersects the circle of diameter $BM$ besides $M$ also in point $P$. The circle of diameter $BM$ intersects the circle with diameter $CM$ besides $M$ also in point $Q$. The circle of diameter $CM$ intersects the circle of diameter $DM$ besides $M$ also in point $R$. The circle of diameter $DM$ intersects the circle of diameter $AM$ besides $M$ also in point $S$. Prove that quadrilateral $PQRS$ is a rectangle.
[asy]
unitsize (3 cm);
pair A, B, C, D, M, P, Q, R, S;
M = (0,0);
A = dir(170);
C = dir(10);
B = dir(120);
D = dir(240);
draw(Circle(M,1));
draw(A--C);
draw(B--D);
draw(Circle(A/2,1/2));
draw(Circle(B/2,1/2));
draw(Circle(C/2,1/2));
draw(Circle(D/2,1/2));
P = (A + B)/2;
Q = (B + C)/2;
R = (C + D)/2;
S = (D + A)/2;
dot("$A$", A, A);
dot("$B$", B, B);
dot("$C$", C, C);
dot("$D$", D, D);
dot("$M$", M, E);
dot("$P$", P, SE);
dot("$Q$", Q, SE);
dot("$R$", R, NE);
dot("$S$", S, NE);
[/asy]
Find all positive integers $m$ such that
$$\{\sqrt{m}\} = \{\sqrt{m+ 2011}\}.$$
A point $D$ is marked on the side $AC$ of triangle $ABC$. The circumscribed circle of triangle $ABD$ passes through the center of the inscribed circle of triangle $BCD$. Find $\angle ACB$ if $\angle ABC = 40^o$.
While taking the SAT, you become distracted by your own answer sheet. Because you are not bound to the College Board's limiting rules, you realize that there are actually $32$ ways to mark your answer for each question, because you could fight the system and bubble in multiple letters at once: for example, you could mark $AB$, or $AC$, or $ABD$, or even $ABCDE$, or nothing at all!
You begin to wonder how many ways you could mark off the 10 questions you haven't yet answered. To increase the challenge, you wonder how many ways you could mark off the rest of your answer sheet without ever marking the same letter twice in a row. (For example, if $ABD$ is marked for one question, $AC$ cannot be marked for the next one because $A$ would be marked twice in a row.) If the number of ways to do this can be expressed in the form $2^m p^n$, where $m,n > 1$ are integers and $p$ is a prime, compute $100m+n+p$.
[i]Proposed by Alexander Dai[/i]
Determine all functions $f:\mathbb{R}_+\to\mathbb{R}_+$ which satisfy \[f\left(\frac{y}{f(x)}\right)+x=f(xy)+f(f(x)),\]for any positive real numbers $x$ and $y$.
[i]Proposed by Pavel Ciurea[/i]
Let $ABCD$ be a convex quadrilateral with $AB = AD$ and $CB = CD$. The bisector of $\angle BDC$ intersects $BC$ at $L$, and $AL$ intersects $BD$ at $M$, and it is known that $BL = BM$. Determine the value of $2\angle BAD + 3\angle BCD$.
Let $ABC$ be an acute-angled triangle with circumcenter $O$. The circumcircle of $\triangle{BOC}$ meets the lines $AB, AC$ at points $A_1, A_2$, respectively. Let $\omega_{A}$ be the circumcircle of triangle $AA_1A_2$. Define $\omega_B$ and $\omega_C$ analogously. Prove that the circles $\omega_A, \omega_B, \omega_C$ concur on $\odot(ABC)$.
Triangle \(ABC\) has \(AB > AC\) and \(\angle A = 60^\circ \). Let \(M\) be the midpoint of \(BC\), \(N\) be the point on segment \(AB\) such that \(\angle BNM = 30^\circ\). Let \(D,E\) be points on \(AB, AC\) respectively. Let \(F, G, H\) be the midpoints of \(BE, CD, DE\) respectively. Let \(O\) be the circumcenter of triangle \(FGH\). Prove that \(O\) lies on line \(MN\).
In a Cartesian coordinate system (with the same scale on the x and y axes)there is a graph of the exponential function $y=3^x$. Then the y-axis and all marks on the x-axis erased. Only the graph of the function and the x-axis remained without a scale and a mark of $0$.
How can you restore the y-axis using a compass and ruler?