Of the quadratic trinomials $x^2 + px + q$ where $p$; $q$ are integers and $1\leqslant p, q \leqslant 1997$, which are there more of: those having integer roots or those not having real roots? [i]M. Evdokimov[/i]

[b]p1.[/b] Calculate $A \cdot B +M \cdot C$, where $A = 1$, $B = 2$, $C = 3$, $M = 13$. [b]p2.[/b] What is the remainder of $\frac{2022\cdot2023}{10}$ ? [b]p3.[/b] Daniel and Bryan are rolling fair $7$-sided dice. If the probability that the sum of the numbers that Daniel and Bryan roll is greater than $11$ can be represented as the fraction $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers, what is $a + b$? [b]p4.[/b] Billy can swim the breaststroke at $25$ meters per minute, the butterfly at $30$ meters per minute, and the front crawl at $40$ meters per minute. One day, he swam without stopping or slowing down, swimming $1130$ meters. If he swam the butterfly for twice as long as the breaststroke, plus one additional minute, and the front crawl for three times as long as the butterfly, minus eight minutes, for how many minutes did he swim? [b]p5.[/b] Elon Musk is walking around the circumference of Mars trying to find aliens. If the radius of Mars is $3396.2$ km and Elon Musk is $73$ inches tall, the difference in distance traveled between the top of his head and the bottom of his feet in inches can be expressed as $a\pi$ for an integer $a$. Find $a$. ($1$ yard is exactly $0.9144$ meters). [b]p6.[/b] Lukas is picking balls out of his five baskets labeled $1$,$2$,$3$,$4$,$5$. Each basket has $27$ balls, each labeled with the number of its respective basket. What is the least number of times Lukas must take one ball out of a random basket to guarantee that he has chosen at least $5$ balls labeled ”$1$”? If there are no balls in a chosen basket, Lukas will choose another random basket. [b]p7.[/b] Given $35_a = 42_b$, where positive integers $a$, $b$ are bases, find the minimum possible value of the sum $a + b$ in base $10$. [b]p8.[/b] Jason is playing golf. If he misses a shot, he has a $50$ percent chance of slamming his club into the ground. If a club is slammed into the ground, there is an $80$ percent chance that it breaks. Jason has a $40$ percent chance of hitting each shot. Given Jason must successfully hit five shots to win a prize, what is the expected number of clubs Jason will break before he wins a prize? [b]p9.[/b] Circle $O$ with radius $1$ is rolling around the inside of a rectangle with side lengths $5$ and $6$. Given the total area swept out by the circle can be represented as $a + b\pi$ for positive integers $a$, $b$ find $a + b$. [b]p10.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD$. [b]p11.[/b] Raymond is eating huge burgers. He has been trained in the art of burger consumption, so he can eat one every minute. There are $100$ burgers to start with. However, at the end of every $20$ minutes, one of Raymond’s friends comes over and starts making burgers. Raymond starts with $1$ friend. If each of his friends makes $1$ burger every $20$ minutes, after how long in minutes will there be $0$ burgers left for the first time? [b]p12.[/b] Find the number of pairs of positive integers $(a, b)$ and $b\le a \le 2022$ such that $a\cdot lcm(a, b) = b \cdot gcd(a, b)^2$. [b]p13.[/b] Triangle $ABC$ has sides $AB = 6$, $BC = 10$, and $CA = 14$. If a point $D$ is placed on the opposite side of $AC$ from $B$ such that $\vartriangle ADC$ is equilateral, find the length of $BD$. [b]p14.[/b] If the product of all real solutions to the equation $(x-1)(x-2)(x-4)(x-5)(x-7)(x-8) = -x^2+9x-64$ can be written as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, b, d) = 1$ and $c$ is squarefree, compute $a + b + c + d$. [b]p15.[/b] Joe has a calculator with the keys $1, 2, 3, 4, 5, 6, 7, 8, 9,+,-$. However, Joe is blind. If he presses $4$ keys at random, and the expected value of the result can be written as $\frac{x}{11^4}$ , compute the last $3$ digits of $x$ when $x$ divided by $1000$. (If there are consecutive signs, they are interpreted as the sign obtained when multiplying the two signs values together, e.g $3$,$+$,$-$,$-$, $2$ would return $3 + (-(-(2))) = 3 + 2 = 5$. Also, if a sign is pressed last, it is ignored.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For all positive real numbers $a, b, c$ satisfying $a+b+c=1$, prove that \[ \frac{a^4+5b^4}{a(a+2b)} + \frac{b^4+5c^4}{b(b+2c)} + \frac{c^4+5a^4}{c(c+2a)} \geq 1- ab-bc-ca \]

a) Prove that, for any real $x>0$, it is true that $x^3-3x\ge -2$ . b) Prove that, for any real $x,y,z>0$, it is true that $$\frac{x^2y}{z}+\frac{y^2z}{x}+\frac{z^2x}{y}+2\left(\frac{y}{xz}+\frac{z}{xy}+\frac{x}{yz} \right)\ge 9$$ . When we have equality ?

Consider a function f defined on the positive integers that meets the following conditions: $$f(1) = 1 \, , \,\, f(2n) = 2f(n) \, , \,\, nf(2n + 1) = (2n + 1)(f(n) + n) $$ for all $n \ge 1$. a) Prove that $f(n)$ is an integer for all $n$. b) Find all positive integers $m$ less than $2013$ that satisfy the equation $f(m) = 2m$.

[b]p1.[/b] A tennis net is made of strings tied up together which make a grid consisting of small squares as shown below. [img]https://cdn.artofproblemsolving.com/attachments/9/4/72077777d57408d9fff0ea5e79be5ecb6fe8c3.png[/img] The size of the net is $100\times 10$ small squares. What is the maximal number of sides of small squares which can be cut without breaking the net into two separate pieces? (The side is cut only in the middle, not at the ends). [b]p2.[/b] What number is bigger $2^{300}$ or $3^{200}$ ? [b]p3.[/b] All noble knights participating in a medieval tournament in Camelot used nicknames. In the tournament each knight had combats with all other knights. In each combat one knight won and the second one lost. At the end of tournament the losers reported their real names to the winners and to the winners of their winners. Was there a person who knew the real names of all knights? [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $10$ rocks in the first pile and $12$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] There is an interesting $5$-digit integer. With a $1$ after it, it is three times as large as with a $1$ before it. What is the number? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a \in \mathbb{R}$ be a parameter. (1) Prove that the curves of $y = x^2 + (a + 2)x - 2a + 1$ pass through a fixed point; also, the vertices of these parabolas all lie on the curve of a certain parabola. (2) If the function $x^2 + (a + 2)x - 2a + 1 = 0$ has two distinct real roots, find the value range of the larger root.

The following apply: $a,b,c,d \ge 0$ and $abcd=1$ Prove that $$ a^2+b^2+c^2+d^2+ab+ac+ad+bc+bd+cd \ge 10$$

Consider the following system of $10$ equations in $10$ real variables $v_1, \ldots, v_{10}$: \[v_i = 1 + \frac{6v_i^2}{v_1^2 + v_2^2 + \cdots + v_{10}^2} \qquad (i = 1, \ldots, 10).\] Find all $10$-tuples $(v_1, v_2, \ldots , v_{10})$ that are solutions of this system.

Let $a_1, a_2, a_3, ...$ be a sequence of positive real numbers. Prove that for any positive integer $n$ the inequality holds $\sum_{i=1}^n b_i^2 \le 4 \sum_{i=1}^n a_i^2$ where $b_i$ is the arithmetic mean of the numbers $a_1, a_2, ..., a_n$

Given the following system of equations $a_1 + a_2 + a_3 = 1$ $a_2 + a_3 + a_4 = 2$ $a_3 + a_4 + a_5 = 3$ $...$ $a_{12} + a_{13} + a_{14} = 12$ $a_{13} + a_{14} + a_1 = 13$ $a_{14 }+ a_1 + a_2 = 14$ find the value of $a_{14}$.

Show that for any real number $x$: \[ x^2 \sin{x} + x \cos{x} + x^2 + \frac{1}{2} > 0 . \]

Define $a_k=2^{2^{k-2013}}+k$ for all integers $k$. Simplify $$(a_0+a_1)(a_1-a_0)(a_2-a_1)\cdots(a_{2013}-a_{2012}).$$

Let $n\ge 4$ be a positive integer. Consider any set $A$ formed by $n$ distinct real numbers such that the following condition holds: for every $a\in A$, there exist distinct elements $x, y, z \in A$ such that $\left| x-a \right|, \left| y-a \right|, \left| z-a \right| \ge 1$. For each $n$, find the greatest real number $M$ such that $\sum_{a\in A}^{}\left| a \right|\ge M$.

Find all functions $f: \mathbb{Z}^+\to \mathbb{R}$, which satisfies $f(n+1)\geq f(n)$ for all $n\geq 1$ and $f(mn)=f(m)f(n)$ for all $(m,n)=1$.

Solve in the set $R$ the equation $$\frac{3x+3}{\sqrt{x}}-\frac{x+1}{\sqrt{x^2-x+1}}=4$$

In Kacs Aladár street, houses are only found on one side of the road, so that only odd house numbers are found along the street. There are an odd number of allotments, as well. The middle three allotments belong to Scrooge McDuck, so he only put up the smallest of the three house numbers. The numbering of the other houses is standard, and the numbering begins with $1$. What is the largest number in the street if the sum of house numbers put up is $3133$?

Write the following polynomial as a product of irreducible polynomials in $\mathbb{Z}[X]$ \[ f(X) = X^{2005} - 2005 X + 2004 . \]Justify your answer.

Find all polynomials $p(x)$ satisfying $p(x^3+1)=p(x+1)^3$ for all $x$.

Evaluate $\sum_{k=0}^{37}(-1)^k\binom{75}{2k}$.

Let $n\ge 2$ be an integer. Let $z_1, z_2,..., z_n$ be complex numbers in such a way that for all integers $k$ with $1\le k\le n$: $$\Pi_{i = 1,i\ne k}^{n} (z_k- z_i) = \Pi_{i = 1,i\ne k}^{n} (z_k+ z_i).$$ Show that two of them are the same.

Real numbers $x,y,a$ are such that $x+y=x^2+y^2=x^3+y^3=a$. Find all the possible values of $a$.

Consider a triangle and 2 lines that each go through a corner and intersects the opposing segment, such that the areas are as on the attachment. Find the "?"

Professor Piraldo takes part in soccer matches with a lot of goals and judges a match in his own peculiar way. A match with score of $m$ goals to $n$ goals, $m\geq n$, is [i]tough[/i] when $m\leq f(n)$, where $f(n)$ is defined by $f(0) = 0$ and, for $n \geq 1$, $f(n) = 2n-f(r)+r$, where $r$ is the largest integer such that $r < n$ and $f(r) \leq n$. Let $\phi ={1+\sqrt 5\over 2}$. Prove that a match with score of $m$ goals to $n$, $m\geq n$, is tough if $m\leq \phi n$ and is not tough if $m \geq \phi n+1$.

Determine all pairs of polynomials $(P, Q)$ with real coefficients satisfying $$P(x + Q(y)) = Q(x + P(y))$$ for all real numbers $x$ and $y$.