Let $n\ge 4$ be a positive integer and let $M$ be a set of $n$ points in the plane, where no three points are collinear and not all of the $n$ points being concyclic. Find all real functions $f:M\to\mathbb{R}$ such that for any circle $\mathcal{C}$ containing at least three points from $M$, the following equality holds: \[\sum_{P\in\mathcal{C}\cap M} f(P)=0\] [i]Dorel Mihet[/i]

Find $x+y+z$ when $$a_1x+a_2y+a_3z= a$$$$b_1x+b_2y+b_3z=b$$$$c_1x+c_2y+c_3z=c$$ Given that $$a_1\left(b_2c_3-b_3c_2\right)-a_2\left(b_1c_3-b_3c_1\right)+a_3\left(b_1c_2-b_2c_1\right)=9$$$$a\left(b_2c_3-b_3c_2\right)-a_2\left(bc_3-b_3c\right)+a_3\left(bc_2-b_2c\right)=17$$$$a_1\left(bc_3-b_3c\right)-a\left(b_1c_3-b_3c_1\right)+a_3\left(b_1c-bc_1\right)=-8$$$$a_1\left(b_2c-bc_2\right)-a_2\left(b_1c-bc_1\right)+a\left(b_1c_2-b_2c_1\right)=7.$$ [i]2017 CCA Math Bonanza Lightning Round #5.1[/i]

[b]p1.[/b] The remainder of a number when divided by $7$ is $5$. If I multiply the number by $32$ and add $18$ to the product, what is the new remainder when divided by $7$? [b]p2.[/b] If a fair coin is flipped $15$ times, what is the probability that there are more heads than tails? [b]p3.[/b] Let $-\frac{\sqrt{p}}{q}$ be the smallest nonzero real number such that the reciprocal of the number is equal to the number minus the square root of the square of the number, where $p$ and $q$ are positive integers and $p$ is not divisible the square of any prime. Find $p + q$. [b]p4.[/b] Rachel likes to put fertilizers on her grass to help her grass grow. However, she has cows there as well, and they eat $3$ little fertilizer balls on average. If each ball is spherical with a radius of $4$, then the total volume that each cow consumes can be expressed in the form $a\pi$ where $a$ is an integer. What is $a$? [b]p5.[/b] One day, all $30$ students in Precalc class are bored, so they decide to play a game. Everyone enters into their calculators the expression $9 \diamondsuit 9 \diamondsuit 9 ... \diamondsuit 9$, where $9$ appears $2020$ times, and each $\diamondsuit$ is either a multiplication or division sign. Each student chooses the signs randomly, but they each choose one more multiplication sign than division sign. Then all $30$ students calculate their expression and take the class average. Find the expected value of the class average. [b]p6.[/b] NaNoWriMo, or National Novel Writing Month, is an event in November during which aspiring writers attempt to produce novel-length work - formally defined as $50,000$ words or more - within the span of $30$ days. Justin wants to participate in NaNoWriMo, but he's a busy high school student: after accounting for school, meals, showering, and other necessities, Justin only has six hours to do his homework and perhaps participate in NaNoWriMo on weekdays. On weekends, he has twelve hours on Saturday and only nine hours on Sunday, because he goes to church. Suppose Justin spends two hours on homework every single day, including the weekends. On Wednesdays, he has science team, which takes up another hour and a half of his time. On Fridays, he spends three hours in orchestra rehearsal. Assume that he spends all other time on writing. Then, if November $1$st is a Friday, let $w$ be the minimum number of words per minute that Justin must type to finish the novel. Round $w$ to the nearest whole number. [b]p7.[/b] Let positive reals $a$, $b$, $c$ be the side lengths of a triangle with area $2030$. Given $ab + bc + ca = 15000$ and $abc = 350000$, find the sum of the lengths of the altitudes of the triangle. [b]p8.[/b] Find the minimum possible area of a rectangle with integer sides such that a triangle with side lengths $3$, $4$, $5$, a triangle with side lengths $4$, $5$, $6$, and a triangle with side lengths $\frac94$, $4$, $4$ all fit inside the rectangle without overlapping. [b]p9.[/b] The base $16$ number $10111213...99_{16}$, which is a concatenation of all of the (base $10$) $2$-digit numbers, is written on the board. Then, the last $2n$ digits are erased such that the base $10$ value of remaining number is divisible by $51$. Find the smallest possible integer value of $n$. [b]p10.[/b] Consider sequences that consist entirely of $X$'s, $Y$ 's and $Z$'s where runs of consecutive $X$'s, $Y$ 's, and $Z$'s are at most length $3$. How many sequences with these properties of length $8$ are there? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there is a polynomial $P(x)$ with integer coefficients such that for all $x$ in the interval $\left[ \frac{1}{10} , \frac{9}{10}\right]$ we have $$\left|P(x) -\frac12 \right| < \frac{ 1}{1000 }.$$

$\textbf{Problem C.1}$ There are two piles of coins, each containing $2010$ pieces. Two players $A$ and $B$ play a game taking turns ($A$ plays first). At each turn, the player on play has to take one or more coins from one pile or exactly one coin from each pile. Whoever takes the last coin is the winner. Which player will win if they both play in the best possible way?

If $x_i$ is an integer greater than 1, let $f(x_i)$ be the greatest prime factor of $x_i,x_{i+1} =x_i-f(x_i)$ ($i\ge 0$ and i is an integer). (1) Prove that for any integer $x_0$ greater than 1, there exists a natural number$k(x_0)$, such that $x_{k(x_0)+1}=0$ Grade 10: (2) Let $V_{(x_0)}$ be the number of different numbers in $f(x_0),f(x_1),\cdots,f(x_{k(x_0)})$. Find the largest number in $V(2),V(3),\cdots,V(781)$ and give reasons. Note: Bai Lu Zhou Academy was founded in 1241 and has a history of 781 years. Grade 11: (2) Let $V_{(x_0)}$ be the number of different numbers in $f(x_0),f(x_1),\cdots,f(x_{k(x_0)})$. Find the largest number in $V(2),V(3),\cdots,V(2022)$ and give reasons.

A positive integer $n$ between $1$ and $N=2007^{2007}$ inclusive is selected at random. If $a$ and $b$ are natural numbers such that $a/b$ is the probability that $N$ and $n^3-36n$ are relatively prime, find the value of $a+b$.

Gary has $2$ children. We know one is a boy born on a Friday. Assume birthing boys and girls are equally likely, being born on any day of the week is equally likely, and that these properties are independent of each other, as well as independent from child to child. The probability that both of Gary's children are boys is $\tfrac{a}{b}$ where $a$ and $b$ are relatively prime integers. Find $a + b.$

The real numbers $a_1,a_2,\dots,a_n$ are given such that $|a_i|\leq 1$ for all $i=1,2,\dots,n$ and $a_1+a_2+\cdots+a_n=0$. a) Prove that there exists $k\in\{1,2,\dots,n\}$ such that \[ |a_1+2a_2+\cdots+ka_k|\leq\frac{2k+1}{4}. \] b) Prove that for $n > 2$ the bound above is the best possible. [i]Radu Gologan, Dan Schwarz[/i]

Find the largest positive integer $n$ that cannot be written as $n = 20a + 28b + 35c$ for nonnegative integers $a, b$, and $c$.

a) Find a pair(s) of integers $(x,y)$ such that: $y^2=x^3+2017$ b) Prove that there isn't integers $x$ and $y$, with $y$ not divisible by $3$, such that: $y^2=x^3-2017$

There is tetrahedron and square pyramid, both with all edges equal $1$. Show how to cut them into several parts and glue together from these parts a cube (without voids and cracks, all parts must be used)

Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have : $$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$ Who has the winning strategy. Proposed by [i]Alireza Haghi[/i]

Prove that the number $ 10^{10}$ can't be written as the product of two natural numbers which do not contain the digit "$ 0$" in their decimal representation.

Prove that for all positive real numbers $a, b$, and $c$ , $\sqrt[3]{abc}+\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \ge 2\sqrt3$. When does the equality occur?

Prove that $\sqrt1+ \sqrt2+\sqrt3+...+ \sqrt{n^2-1}+\sqrt{n^2} \ge \frac{2n^3+n}{3}$ for any positive integer $n$.

[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$ ($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits). [b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table: the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game. a) The player who makes the first move can win the game. What is the winning first move? b) How can he win? (Describe his strategy.) [b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover? [b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back. [b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

One morning a baker notices that she has $188$ cups of flour and $113$ cups of sugar available. Each loaf of bread that the baker makes takes three cups of flour and a half cup of sugar. Each cake that the baker makes takes two cups of flour and two cups of sugar. The baker decides to make some loaves of bread and some cakes so that she exactly uses up all of her supplies of flour and sugar. Find the number of cakes she should make.

$\boxed{\text{N4}}$ Find all primes $p,q$ such that $2p^3-q^2=2(p+q)^2$.

Isabella has $6$ coupons that can be redeemed for free ice cream cones at Pete's Sweet Treats. In order to make the coupons last, she decides that she will redeem one every 10 days until she has used them all. She knows that Pete's is closed on Sundays, but as she circles the 6 dates on her calender, she realizes that no circled date falls on a Sunday. On what day of the week does Isabella redeem her first coupon? $\textbf{(A) }\text{Monday}\qquad\textbf{(B) }\text{Tuesday}\qquad\textbf{(C) }\text{Wednesday}\qquad\textbf{(D) }\text{Thursday}\qquad\textbf{(E) }\text{Friday}$

How many pairs of parallel edges, such as $\overline{AB}$ and $\overline{GH}$ or $\overline{EH}$ and $\overline{FG}$, does a cube have? $\textbf{(A) }6 \qquad\textbf{(B) }12 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 24 \qquad \textbf{(E) } 36$ [asy] import three; currentprojection=orthographic(1/2,-1,1/2); /* three - currentprojection, orthographic */ draw((0,0,0)--(1,0,0)--(1,1,0)--(0,1,0)--cycle); draw((0,0,0)--(0,0,1)); draw((0,1,0)--(0,1,1)); draw((1,1,0)--(1,1,1)); draw((1,0,0)--(1,0,1)); draw((0,0,1)--(1,0,1)--(1,1,1)--(0,1,1)--cycle); label("$D$",(0,0,0),S); label("$A$",(0,0,1),N); label("$H$",(0,1,0),S); label("$E$",(0,1,1),N); label("$C$",(1,0,0),S); label("$B$",(1,0,1),N); label("$G$",(1,1,0),S); label("$F$",(1,1,1),N); [/asy]

Let $ABC$ be isosceles triangle ($AB=BC$) and $K$ and $M$ be the midpoints of $AB$ and $AC,$ respectively.Let the circumcircle of $\triangle BKC$ meets the line $BM$ at $N$ other than $B.$ Let the line passing through $N$ and parallel to $AC$ intersects the circumcircle of $\triangle ABC$ at $A_1$ and $C_1.$ Prove that $\triangle A_1BC_1$ is equilateral.

A $n \times n$ table is filled with the numbers as follows: the first column is filled with $1$’s, the second column with $2$’s, and so on. Then, the numbers on the main diagonal (from top-left to bottom-right) are erased. Prove that the total sums of the numbers on both sides of the main diagonal differ in exactly two times. [i](3 points)[/i]

Consider the complex numbers $x,y,z$ such that $|x|=|y|=|z|=1$. Define the number $$a=\left (1+\frac xy\right )\left (1+\frac yz\right )\left (1+\frac zx\right ).$$ $\textbf{(a)}$ Prove that $a$ is a real number. $\textbf{(b)}$ Find the minimal and maximal value $a$ can achieve, when $x,y,z$ vary subject to $|x|=|y|=|z|=1$. [i] (Stefan Bălăucă & Vlad Robu)[/i]

It is known that $m$ and $n$ are positive integers, $m > n^{n-1}$, and all the numbers $m+1$, $m+2$, \dots, $m+n$ are composite. Prove that there exist such different primes $p_1$, $p_2$, \dots, $p_n$ that $p_k$ divides $m+k$ for $k = 1$, 2, \dots, $n$. [i]Proposed by C. A. Grimm [/i]