$x^2 + 2y^2 = 1$ solve in integers.

Call a number "prime-looking" if it is composite but not divisible by 2, 3, or 5. The three smallest prime-looking numbers are 49, 77, and 91. There are 168 prime numbers less than 1000. How many prime-looking numbers are there less than 1000? $ \textbf{(A)}\ 100 \qquad \textbf{(B)}\ 102 \qquad \textbf{(C)}\ 104 \qquad \textbf{(D)}\ 106 \qquad \textbf{(E)}\ 108$

Morteza wishes to take two real numbers $S$ and $P$, and then to arrange six pairwise distinct real numbers on a circle so that for each three consecutive numbers at least one of the two following conditions holds: 1) their sum equals $S$ 2) their product equals $P$. Determine if Morteza’s wish could be fulfilled.

Suppose that $A$ is a set of positive integers less than $N$ and that no two distinct elements of $A$ sum to a perfect square. That is, if $a_1, a_2 \in A$ and $a_1 \neq a_2$ then $|a_1+a_2|$ is not a square of an integer. Prove that the maximum number of elements in $A$ is at least $\left\lfloor\frac{11}{32}N\right\rfloor$ .

A polynomial $P(x) = 1 + x^2 + x^5 + x^{n_1} + ...+ x^{n_s} + x^{2008}$ with $n_1, ..., n_s$ are positive integers and $5 < n_1 < ... <n_s < 2008$ are given. Prove that if $P(x)$ has at least a real root, then the root is not greater than $\frac{1-\sqrt5}{2}$

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function satisfying the following conditions: (1) $f(1)=1$; (2) $\forall n\in \mathbb{N}$, $3f(n) f(2n+1) =f(2n) ( 1+3f(n) )$; (3) $\forall n\in \mathbb{N}$, $f(2n) < 6 f(n)$. Find all solutions of equation $f(k) +f(l)=293$, where $k<l$. ($\mathbb{N}$ denotes the set of all natural numbers).

Determine all pairs of natural numbers $a$ and $b$ such that $\frac{a+1}{b}$ and $\frac{b+1}{a}$ they are natural numbers.

In $\vartriangle ABC$, the external angle bisector of $\angle BAC$ intersects line $BC$ at $D$. $E$ is a point on ray $\overrightarrow{AC}$ such that $\angle BDE = 2\angle ADB$. If $AB = 10$, $AC = 12$, and $CE = 33$, compute $\frac{DB}{DE}$ .

Let $I$ be the incenter of triangle $ABC$ and let $D$ be the midpoint of side $AB$. Prove that if the angle $\angle AOD$ is right, then $AB+BC=3AC$. [I]Proposed by S. Ivanov[/i]

Between any two cities of a country there is only one one-way road. Show that there is a city from that every other city can be reached directly or by going over only one intermediate city. [hide] I'm sure it was posted before but couldn't find it. [/hide]

For non negative reals $a,b$ we know that $a^2+a+b^2\ge a^4+a^3+b^4$. Prove that $$\frac{1-a^4}{a^2}\ge \frac{b^2-1}{b}$$

The circumradius of acute triangle $ABC$ is twice of the distance of its circumcenter to $AB$. If $|AC|=2$ and $|BC|=3$, what is the altitude passing through $C$? $ \textbf{(A)}\ \sqrt {14} \qquad\textbf{(B)}\ \dfrac{3}{7}\sqrt{21} \qquad\textbf{(C)}\ \dfrac{4}{7}\sqrt{21} \qquad\textbf{(D)}\ \dfrac{1}{2}\sqrt{21} \qquad\textbf{(E)}\ \dfrac{2}{3}\sqrt{14} $

Each of the $29$ people attending a party wears one of three different types of hats. Call a person [i]lucky[/i] if at least two of his friends wear different types of hats. Show that it is always possible to replace the hat of a person at this party with a hat of one of the other two types, in a way that the total number of lucky people is not reduced.

Consider all trapezoids in a coordinate plane with interior angles of $90^o, 90^o, 45^o$ and $135^o$ whose bases are parallel to a coordinate axis and whose vertices have integer coordinates. Define the [i]size [/i] of such a trapezoid as the total number of points with integer coordinates inside and on the boundary of the trapezoid. (a) How many pairwise non-congruent such trapezoids of size $2001$ are there? (b) Find all positive integers not greater than $50$ that do not appear as sizes of any such trapezoid.

Find all triples of reals $(x,y,z)$ satisfying: $$\begin{cases} \frac{1}{3} \min \{x,y\} + \frac{2}{3} \max \{x,y\} = 2017 \\ \frac{1}{3} \min \{y,z\} + \frac{2}{3} \max \{y,z\} = 2018 \\ \frac{1}{3} \min \{z,x\} + \frac{2}{3} \max \{z,x\} = 2019 \\ \end{cases}$$

For a non-empty finite set $A$ of positive integers, let $\text{lcm}(A)$ denote the least common multiple of elements in $A$, and let $d(A)$ denote the number of prime factors of $\text{lcm}(A)$ (counting multiplicity). Given a finite set $S$ of positive integers, and $$f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}.$$ Prove that, if $0 \le x \le 2$, then $-1 \le f_S(x) \le 0$.

A cubic function $f(x)$ satisfies the equation $\sin 3t=f(\sin t)$ for all real numbers $t$. Evaluate $\int_0^1 f(x)^2\sqrt{1-x^2}\ dx$.

Let $a_1,a_2,\dots,a_{2023}$ be positive integers such that [list=disc] [*] $a_1,a_2,\dots,a_{2023}$ is a permutation of $1,2,\dots,2023$, and [*] $|a_1-a_2|,|a_2-a_3|,\dots,|a_{2022}-a_{2023}|$ is a permutation of $1,2,\dots,2022$. [/list] Prove that $\max(a_1,a_{2023})\ge 507$.

Let $m,n$ be distinct positive integers. Prove that $$gcd(m,n) + gcd(m+1,n+1) + gcd(m+2,n+2) \le 2|m-n| + 1. $$ Further, determine when equality holds.

Let $p(1), p(2), \ldots, p(k)$ be all primes smaller than $m$, prove that \[\sum^{k}_{i=1} \frac{1}{p(i)} + \frac{1}{p(i)^2} > ln(ln(m)).\]

You can determine all 4-ples $(a,b, c,d)$ of real numbers, which solve the following equation system $\begin{cases} ab + ac = 3b + 3c \\ bc + bd = 5c + 5d \\ ac + cd = 7a + 7d \\ ad + bd = 9a + 9b \end{cases} $

Georg plays the following game. He chooses two positive integers $n$ and $k$. On an $n \times n$ - board where all the tiles are white, Georg paints k of the tiles black. Then he counts the number of black tiles in each row, forms the square of each of these n numbers and adds up the squares. He calls the result $S$. In the same way he counts the number of white tiles in each row, forms the square of each of these n numbers and adds up those squares. He calls the result $H$. Georg would like to achieve $S - H = 49$. Determine all possible values of n and k for which this is possible. Example: If Georg chooses $n = 5$ and$ k = 14$, he could for example paint the board as shown. [img]https://cdn.artofproblemsolving.com/attachments/f/2/d3c778f603f0a43c9aa877a4564734eab50058.png[/img] Then $S = 1^2 + 2^2 + 3^2 + 3^2 + 5^2 = 1 + 4 + 9 + 9 + 25 = 48$, $H = 4^2 + 3^2 + 2^2 + 2^2 + 0^2 = 16 + 9 + 4 + 4 + 0 = 33$, so in this case $S - H = 48 - 33 = 15$.

Solve the system of equations $$\begin{cases} (x+y)(x^2-y^2)=32 \\ (x-y)(x^2+y^2)=20 \end{cases}$$

At a strange party, each person knew exactly $22$ others. For any pair of people $X$ and $Y$ who knew each other, there was no other person at the party that they both knew. For any pair of people $X$ and $Y$ who did not know one another, there were exactly $6$ other people that they both knew. How many people were at the party?

Over each side of a cyclic quadrilateral erect a rectangle whose height is equal to the length of the opposite side. Prove that the centers of these rectangles form another rectangle.