Does there exist a rational $x_1$, such that all members of the sequence $x_1, x_2, \ldots, x_{2024}$ defined by $x_{n+1}=x_n+\sqrt{x_n^2-1}$ for $n=1, 2, \ldots, 2023$ are greater than $1$ and rational?

An insurance company believes that people can be divided into 2 classes: those who are accident prone and those who are not. Their statistics show that an accident prone person will have an accident in a yearly period with probability 0.4, whereas this probability is 0.2 for the other kind. Given that 30% of people are accident prone, what is the probability that a new policyholder will have an accident within a year of purchasing a policy?

Consider the assertion that for each positive integer $n\geq2$, the remainder upon dividing $2^{2^n}$ by $2^n-1$ is a power of $4$. Either prove the assertion or find (with proof) a counterexample.

Suppose that $|x+y|+|x-y|=2$. What is the maximum possible value of $x^2-6x+y^2$? $ \textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9 $

Let $ A$, $ B$, and $ C$ be three distinct points on the graph of $ y\equal{}x^2$ such that line $ AB$ is parallel to the $ x$-axis and $ \triangle{ABC}$ is a right triangle with area $ 2008$. What is the sum of the digits of the $ y$-coordinate of $ C$? $ \textbf{(A)}\ 16 \qquad \textbf{(B)}\ 17 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 19 \qquad \textbf{(E)}\ 20$

The Imomi archipelago consists of $n\geq 2$ islands. Between each pair of distinct islands is a unique ferry line that runs in both directions, and each ferry line is operated by one of $k$ companies. It is known that if any one of the $k$ companies closes all its ferry lines, then it becomes impossible for a traveller, no matter where the traveller starts at, to visit all the islands exactly once (in particular, not returning to the island the traveller started at). Determine the maximal possible value of $k$ in terms of $n$. [i]Anton Trygub, Ukraine[/i]

Let $(a_{n})_{n \ge 1}$ be a sequence of integers satisfying the inequality \[ 0\le a_{n-1}+\frac{1-\sqrt{5}}{2}a_{n}+a_{n+1} <1 \] for all $n \ge 2$. Prove that the sequence $(a_{n})$ is periodic. Any Hints or Sols for this hard problem?? :help:

Find all polynomials $P(x)$ with real coefficients satisfying the equation \[(x+1)^{3}P(x-1)-(x-1)^{3}P(x+1)=4(x^{2}-1) P(x)\] for all real numbers $x$.

Let $ ABCDEF$ be a convex hexagon with all the sides of length 1. Prove that one of the radii of the circumcircles of triangles $ ACE$ or $ BDF$ is at least 1.

Let $ a,b,c\in\mathbb{R} , E=(a-b)^2(b-c)^2(c-a)^2, $ and $ S_k=a^k+b^k+c^k,\forall k\in\{ 1,2,3,4\} . $ Write $ E $ in terms of $ S_k. $

Let $ABC$ be a triangle with circumcircle $\Gamma$, and points $E$ and $F$ are chosen from sides $CA$, $AB$, respectively. Let the circumcircle of triangle $AEF$ and $\Gamma$ intersect again at point $X$. Let the circumcircles of triangle $ABE$ and $ACF$ intersect again at point $K$. Line $AK$ intersect with $\Gamma$ again at point $M$ other than $A$, and $N$ be the reflection point of $M$ with respect to line $BC$. Let $XN$ intersect with $\Gamma$ again at point $S$ other that $X$. Prove that $SM$ is parallel to $BC$. [i] Proposed by Ming Hsiao[/i]

Let ${a_n}$ be a non-increasing sequence of positive numbers. Prove that if for $n \ge 2001$, $na_{n} \le 1$, then for any positive integer $m \ge 2001$ and $x \in \mathbb{R}$, the following inequality holds: $\left | \sum_{k=2001}^{m} a_{k} \sin kx \right | \le 1 + \pi$

For $f(x)=x^4+|x|,$ let $I_1=\int_0^\pi f(\cos x)\ dx,\ I_2=\int_0^\frac{\pi}{2} f(\sin x)\ dx.$ Find the value of $\frac{I_1}{I_2}.$

A point $(x,y)$ is a [i]lattice point[/i] if $x,y\in\Bbb Z$. Let $E=\{(x,y):x,y\in\Bbb Z\}$. In the coordinate plane, $P$ and $Q$ are both sets of points in and on the boundary of a convex polygon with vertices on lattice points. Let $T=P\cap Q$. Prove that if $T\ne\emptyset$ and $T\cap E=\emptyset$, then $T$ is a non-degenerate convex quadrilateral region.

Let us denote $\prod = \{(x, y) | y > 0\}$. We call a [i]semicircle[/i] in $\prod$ with center on the $x-\text{axis}$ a [i]semi-line[/i]. Two intersecting [i]semi-lines [/i]determine four [i]semi-angles[/i]. A bisector of a [i]semi-angle [/i]is a [i]semi-line [/i]that bisects the [i]semi-angle[/i]. Prove that in every [i]semi-triangle [/i](determined by three [i]semi-lines[/i]) the bisectors are concurrent.

Let $O$ be a center of circle which passes through vertices of quadrilateral $ABCD$, which has perpendicular diagonals. Prove that sum of distances of point $O$ to sides of quadrilateral $ABCD$ is equal to half of perimeter of $ABCD$.

Determine the smallest positive real number $ k$ with the following property. Let $ ABCD$ be a convex quadrilateral, and let points $ A_1$, $ B_1$, $ C_1$, and $ D_1$ lie on sides $ AB$, $ BC$, $ CD$, and $ DA$, respectively. Consider the areas of triangles $ AA_1D_1$, $ BB_1A_1$, $ CC_1B_1$ and $ DD_1C_1$; let $ S$ be the sum of the two smallest ones, and let $ S_1$ be the area of quadrilateral $ A_1B_1C_1D_1$. Then we always have $ kS_1\ge S$. [i]Author: Zuming Feng and Oleg Golberg, USA[/i]

Do there exist two quadratic trinomials $ax^2 +bx+c$ and $(a+1)x^2 +(b + 1)x + (c + 1)$ with integer coeficients, both of which have two integer roots? [i]N. Agakhanov[/i]

In triangle $ABC$, points $D, E$, and $F$ intersect one-third of the respective sides. Show that the sum of the areas of the three gray triangles is equal to the area of middle triangle. [img]https://1.bp.blogspot.com/-KWrhwMHXfDk/XzcIkhWnK5I/AAAAAAAAMYk/Tj6-PnvTy9ksHgke8cDlAjsj2u421Xa9QCLcBGAsYHQ/s0/1993%2BMohr%2Bp4.png[/img]

Find all integers $n$, such that the following number is a perfect square \[N= n^4 + 6n^3 + 11n^2 +3n+31. \]

For real numbers $a$ and $b$, define the sequence $\{x_{a,b}(n)\}$ as follows: $x_{a,b}(1)=a$, $x_{a,b}(2)=b$, and for $n>1$, $x_{a,b}(n+1)=(x_{a+b}(n-1))^2+(x_{a,b}(n))^2$. For real numbers $c$ and $d$, define the sequence $\{y_{c,d}(n)\}$ as follows: $y_{c,d}(1)=c$, $y_{c,d}(2)=d$, and for $n>1$, $y_{c,d}(n+1)=(y_{c,d}(n-1)+y_{c,d}(n))^2$. Call $(a,b,c)$ a good triple if there exists $d$ such that for all $n$ sufficiently large, $y_{c,d}(n)=(x_{a,b}(n))^2$. For some $(a,b)$ there are exactly three values of $c$ that make $(a,b,c)$ a good triple. Among these pairs $(a,b)$, compute the maximum value of $\lfloor 100(a+b)\rfloor$.

A mathematician investigates methods of finding area of a convex quadrilateral obtains the following formula for the area $A$ of a quadrilateral with consecutive sides $a,b,c,d$: $A =\frac{a+c}{2}\frac{b+d}{2}$ (1) and $A = \sqrt{(p-a)(p-b)(p-c)(p-d)}$ (2) where $p = (a+b+c+d)/2$. However, these formulas are not valid for all convex quadrilaterals. Prove that (1) holds if and only if the quadrilateral is a rectangle, while (2) holds if and only if the quadrilateral is cyclic.

[b]1.[/b] Let $C_{ij}$ ($i,j=1,2,3$) be the coefficients of a real non-involutive orthogonal transformation. Prove that the function $w= \sum_{i,j=1}^{3} c_{ ij}z_{i}\bar{z_{ j}}$ maps the surface of complex unit sphere $\sum_{i=1}^{3} z_{i}\bar{z_{i}} = 1$ onto a triangle of the w-plane. [b](F. 3)[/b]

How many ordered triplets $(a, b, c)$ of positive integers such that $30a + 50b + 70c \leq 343$.

In the $8\times 8$ grid shown, fill in $12$ of the grid cells with the numbers $1-12$ so that the following conditions are satisfied: [list] [*]Each cell contains at most one number, and each number from $1-12$ is used exactly once. [*]Two cells that both contain numbers may not touch, even at a point. [*]A clue outside the grid pointing at a row or column gives the sum of all the numbers in that row or column. Rows and columns without clues have an unknown sum.[/list] You do not need to prove that your configuration is the only one possible; you merely need to find a configuration that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] size(150); defaultpen(linewidth(0.8)); path arrow=(-1/8,1/8)--(1/8,0)--(-1/8,-1/8)--cycle; int sumRows[]={3,13,20,0,21,0,18,3}; int sumCols[]={24,1,3,0,20,13,0,11}; for(int i=0;i<=8;i=i+1) draw((i,0)--(i,8)^^(0,i)--(8,i)); for(int j=0;j<=7;j=j+1) { if(sumRows[j]>0) { filldraw(shift(-1/4,j+1/2)*arrow,black); label("$"+(string)sumRows[j]+"$",(-7/8,j+1/2)); } if(sumCols[j]>0) { filldraw(shift(j+1/2,8+3/8)*(rotate(270,origin)*arrow),black); label("$"+(string)sumCols[j]+"$",(j+1/2,9)); } } [/asy]