Csenge and Eszter ate a whole basket of cherries. Csenge ate a quarter of all cherries while Eszter ate four-sevenths of all cherries and forty more. How many cherries were in the basket in total?

Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.

Let $n$ a positive integer and let $f\colon [0,1] \to \mathbb{R}$ an increasing function. Find the value of : \[ \max_{0\leq x_1\leq\cdots\leq x_n\leq 1}\sum_{k=1}^{n}f\left ( \left | x_k-\frac{2k-1}{2n} \right | \right )\]

$f$ is a function twice differentiable on $[0,1]$ and such that $f''$ is continuous. We suppose that : $f(1)-1=f(0)=f'(1)=f'(0)=0$. Prove that there exists $x_0$ on $[0,1]$ such that $|f''(x_0)| \geq 4$

Laura and Daniel play with quadratic polynomials. First Laura says a nonzero real number $r$. Then Daniel says a nonzero real number $s$, and then again Laura says another nonzero real number $t$. Finally. Daniel writes the polynomial $P(x) = ax^2 + bx + c$ where $a,b$, and $c$ are $r,s$, and $t$ in some order Daniel chooses. Laura wins if the equation $P(x) = 0$ has two different real solutions, and Daniel wins otherwise. Determine who has a winning strategy and describe that strategy.

Let $f$ be a function with the following properties: 1) $f(n)$ is defined for every positive integer $n$; 2) $f(n)$ is an integer; 3) $f(2)=2$; 4) $f(mn)=f(m)f(n)$ for all $m$ and $n$; 5) $f(m)>f(n)$ whenever $m>n$. Prove that $f(n)=n$.

Consider ten concentric circles and ten rays as in the following figure. At the points where the inner circle is intersected by the rays write successively, in direction clockwise, the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9, 10$. In the next circle we write the numbers $11, 12, 13, 14, 15, 16, 17, 18, 19,20$ successively, and so on successively until the last round were we write the numbers $91, 92, 93, 94, 95, 96, 97, 98, 99, 100$ successively. In this orde, the numbers $1, 11, 21, 31, 41, 51, 61, 71, 81, 91$ are in the same ray, and similarly for the other rays. In front of $50$ of those $100$ numbers, we use the sign ''$-$'' such as: a) in each of the ten rays, exist exactly $5$ signs ''$-$'' , and also b) in each of the ten concentric circles, to be exactly $5$ signs ''$-$''. Prove that the sum of the $100$ signed numbers that occur, equals zero. [img]https://cdn.artofproblemsolving.com/attachments/9/d/ffee6518fcd1b996c31cf06d0ce484a821b4ae.gif[/img]

For real positive numbers $a, b, c$, the equality $abc = 1$ holds. Prove that $$\frac{a^{2014}}{1 + 2 bc}+\frac{b^{2014}}{1 + 2ac}+\frac{c^{2014}}{1 + 2ab} \ge \frac{3}{ab+bc+ca}.$$

Find a positive integer $N$ and $a_1, a_2, \cdots, a_N$ where $a_k = 1$ or $a_k = -1$, for each $k=1,2,\cdots,N,$ such that $$a_1 \cdot 1^3 + a_2 \cdot 2^3 + a_3 \cdot 3^3 \cdots + a_N \cdot N^3 = 20162016$$ or show that this is impossible.

Fix a real polynomial $P$ with degree at least $1$, and a real number $c$. Prove that there exist a real number $k$ such that for all reals $a$ and $b$, $$P(a)+P(b)=c \quad \Rightarrow \quad |a+b|<k$$ [i]Proposed by Wong Jer Ren[/i]

$a_{n}$ ($n$ is integer) is a sequence from positive reals that \[a_{n}\geq \frac{a_{n+2}+a_{n+1}+a_{n-1}+a_{n-2}}4\] Prove $a_{n}$ is constant.

Determine all functions $f : N_0 \to R$ satisfying $f (x+y)+ f (x-y)= f (3x)$ for all $x,y$.

One point of the plane is called $rational$ if both coordinates are rational and $irrational$ if both coordinates are irrational. Check whether the following statements are true or false: [b]a)[/b] Every point of the plane is in a line that can be defined by $2$ rational points. [b]b)[/b] Every point of the plane is in a line that can be defined by $2$ irrational points. This maybe is not algebra so sorry if I putted it in the wrong category!

If we define $\otimes(a,b,c)$ by \begin{align*} \otimes(a,b,c) = \frac{\max(a,b,c)- \min(a,b,c)}{a+b+c-\min(a,b,c)-\max(a,b,c)}, \end{align*} compute $\otimes(\otimes(7,1,3),\otimes(-3,-4,2),1)$.

Prove that if $m,n$ are relatively prime positive integers, $x^m-y^n$ is irreducible in the complex numbers. (A polynomial $P(x,y)$ is irreducible if there do not exist nonconstant polynomials $f(x,y)$ and $g(x,y)$ such that $P(x,y) = f(x,y)g(x,y)$ for all $x,y$.) [i]David Yang.[/i]

[b]p1.[/b] If $A = 0$, $B = 1$, $C = 2$, $...$, $Z = 25$, then what is the sum of $A + B + M+ C$? [b]p2.[/b] Eric is playing Tetris against Bryan. If Eric wins one-fifth of the games he plays and he plays $15$ games, find the expected number of games Eric will win. [b]p3.[/b] What is the sum of the measures of the exterior angles of a regular $2023$-gon in degrees? [b]p4.[/b] If $N$ is a base $10$ digit of $90N3$, what value of $N$ makes this number divisible by $477$? [b]p5.[/b] What is the rightmost non-zero digit of the decimal expansion of $\frac{1}{2^{2023}}$ ? [b]p6.[/b] if graphs of $y = \frac54 x + m$ and $y = \frac32 x + n$ intersect at $(16, 27)$, what is the value of $m + n$? [b]p7.[/b] Bryan is hitting the alphabet keys on his keyboard at random. If the probability he spells out ABMC at least once after hitting $6$ keys is $\frac{a}{b^c}$ , for positive integers $a$, $b$, $c$ where $b$, $c$ are both as small as possible, find $a+b+c$. Note that the letters ABMC must be adjacent for it to count: AEBMCC should not be considered as correctly spelling out ABMC. [b]p8.[/b] It takes a Daniel twenty minutes to change a light bulb. It takes a Raymond thirty minutes to change a light bulb. It takes a Bryan forty-five minutes to change a light bulb. In the time that it takes two Daniels, three Raymonds, and one and a half Bryans to change $42$ light bulbs, how many light bulbs could half a Raymond change? Assume half a person can work half as productively as a whole person. [b]p9.[/b] Find the value of $5a + 4b + 3c + 2d + e$ given $a, b, c, d, e$ are real numbers satisfying the following equations: $$a^2 = 2e + 23$$ $$b^2 = 10a - 34$$ $$c^2 = 8b - 23$$ $$d^2 = 6c - 14$$ $$e^2 = 4d - 7.$$ [b]p10.[/b] How many integers between $1$ and $1000$ contain exactly two $1$’s when written in base $2$? [b]p11.[/b] Joe has lost his $2$ sets of keys. However, he knows that he placed his keys in one of his $12$ mailboxes, each labeled with a different positive integer from $1$ to $12$. Joe plans on opening the $2$ mailbox labeled $1$ to see if any of his keys are there. However, a strong gust of wind blows by, opening mailboxes $11$ and $12$, revealing that they are empty. If Joe decides to open one of the mailboxes labeled $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ , or $10$, the probability that he finds at least one of his sets of keys can be expressed as $\frac{a}{b}$, where a and b are relatively prime positive integers. Find the sum $a + b$. Note that a single mailbox can contain $0$, $1$, or $2$ sets of keys, and the mailboxes his sets of keys were placed in are determined independently at random. [b]p12.[/b] As we all know, the top scientists have recently proved that the Earth is a flat disc. Bob is standing on Earth. If he takes the shortest path to the edge, he will fall off after walking $1$ meter. If he instead turns $90$ degrees away from the shortest path and walks towards the edge, he will fall off after $3$ meters. Compute the radius of the Earth. [b]p13.[/b] There are $999$ numbers that are repeating decimals of the form $0.abcabcabc...$ . The sum of all of the numbers of this form that do not have a $1$ or $2$ in their decimal representation can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Find $a + b$. [b]p14.[/b] An ant is crawling along the edges of a sugar cube. Every second, it travels along an edge to another adjacent vertex randomly, interested in the sugar it notices. Unfortunately, the cube is about to be added to some scalding coffee! In $10$ seconds, it must return to its initial vertex, so it can get off and escape. If the probability the ant will avoid a tragic doom can be expressed as $\frac{a}{3^{10}}$ , where $a$ is a positive integer, find $a$. Clarification: The ant needs to be on its initial vertex in exactly $10$ seconds, no more or less. [b]p15.[/b] Raymond’s new My Little Pony: Friendship is Magic Collector’s book arrived in the mail! The book’s pages measure $4\sqrt3$ inches by $12$ inches, and are bound on the longer side. If Raymond keeps one corner in the same plane as the book, what is the total area one of the corners can travel without ripping the page? If the desired area in square inches is $a\pi+b\sqrt{c}$ where $a$, $b$, and $c$ are integers and $c$ is squarefree, find $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Numbers $1,2,3,...,2n$ are divided onto two equal groups. Let $a_1,a_2,...,a_n$ be the first group numbers in the increasing order, and $b_1,b_2,...,b_n$ -- the second group numbers in the decreasing order. Prove that $$|a_1 - b_1| + |a_2 - b_2| + ... + |a_n - b_n| = n^2$$

Let $\alpha$ and $\beta$ be the roots of $x^{2} - qx + 1$, where $q$ is a rational number larger than $2$. Let $s_1 = \alpha + \beta$, $t_1 = 1$, and for all integers $n \geq 2$: $s_n = \alpha^n + \beta^n$ $t_n = s_{n-1} + 2s_{n-2} + \cdot \cdot \cdot + (n - 1)s_{1} + n$ Prove that, for all odd integers $n$, $t_n$ is the square of a rational number.

The polynomials $P_{n}(x)$ are defined by $P_{0}(x)=0,P_{1}(x)=x$ and \[P_{n}(x)=xP_{n-1}(x)+(1-x)P_{n-2}(x) \quad n\geq 2\] For every natural number $n\geq 1$, find all real numbers $x$ satisfying the equation $P_{n}(x)=0$.

A function $f: Z \to Z$ has the following properties: $f (92 + x) = f (92 - x)$ $f (19 \cdot 92 + x) = f (19 \cdot 92 - x)$ ($19 \cdot 92 = 1748$) $f (1992 + x) = f (1992 - x)$ for all integers $x$. Can all positive divisors of $92$ occur as values of f?

Prove that there are no integers $a,b,c,d$ such that the polynomial $ax^3+bx^2+cx+d$ equals $1$ at $x=19$, and equals $2$ at $x=62$.

Determine all positive real numbers $x$ for which $$\left [x\right ]+\left [\sqrt{1996x}\right ]=1996$$ is verified Clarification:The brackets indicate the integer part of the number they enclose.

Suppose that $P(x)$ is a polynomial with real coefficients, such that for some positive real numbers $c$ and $d$, and for all natural numbers $n$, we have $c|n|^3\leq |P(n)|\leq d|n|^3$. Prove that $P(x)$ has a real zero.

For positive integers $a$ and $k$, define the sequence $a_1,a_2,\ldots$ by \[a_1=a,\qquad\text{and}\qquad a_{n+1}=a_n+k\cdot\varrho(a_n)\qquad\text{for } n=1,2,\ldots\] where $\varrho(m)$ denotes the product of the decimal digits of $m$ (for example, $\varrho(413)=12$ and $\varrho(308)=0$). Prove that there are positive integers $a$ and $k$ for which the sequence $a_1,a_2,\ldots$ contains exactly $2009$ different numbers.

Let $a,b,c$ be three integers for which the sum \[ \frac{ab}{c}+ \frac{ac}{b}+ \frac{bc}{a}\] is integer. Prove that each of the three numbers \[ \frac{ab}{c}, \quad \frac{ac}{b},\quad \frac{bc}{a}\] is integer. (Proposed by Gerhard J. Woeginger)