[b]p1.[/b] Martin’s car insurance costed $\$6000$ before he switched to Geico, when he saved $15\%$ on car insurance. When Mayhem switched to Allstate, he, a safe driver, saved $40\%$ on car insurance. If Mayhem and Martin are now paying the same amount for car insurance, how much was Mayhem paying before he switched to Allstate? [b]p2.[/b] The $7$-digit number $N$ can be written as $\underline{A} \,\, \underline{2} \,\,\underline{0} \,\,\underline{B} \,\,\underline{2} \,\, \underline{1} \,\,\underline{5}$. How many values of $N$ are divisible by $9$? [b]p3.[/b] The solutions to the equation $x^2-18x-115 = 0$ can be represented as $a$ and $b$. What is $a^2+2ab+b^2$? [b]p4.[/b] The exterior angles of a regular polygon measure to $4$ degrees. What is a third of the number of sides of this polygon? [b]p5.[/b] Charlie Brown is having a thanksgiving party. $\bullet$ He wants one turkey, with three different sizes to choose from. $\bullet$ He wants to have two or three vegetable dishes, when he can pick from Mashed Potatoes, Saut´eed Brussels Sprouts, Roasted Butternut Squash, Buttery Green Beans, and Sweet Yams; $\bullet$ He wants two desserts out of Pumpkin Pie, Apple Pie, Carrot Cake, and Cheesecake. How many different combinations of menus are there? [b]p6.[/b] In the diagram below, $\overline{AD} \cong \overline{CD}$ and $\vartriangle DAB$ is a right triangle with $\angle DAB = 90^o$. Given that the radius of the circle is $6$ and $m \angle ADC = 30^o$, if the length of minor arc $AB$ is written as $a\pi$, what is $a$? [img]https://cdn.artofproblemsolving.com/attachments/d/9/ea57032a30c16f4402886af086064261d6828b.png[/img] [b]p7.[/b] This Halloween, Owen and his two friends dressed up as guards from Squid Game. They needed to make three masks, which were black circles with a white equilateral triangle, circle, or square inscribed in their upper halves. Resourcefully, they used black paper circles with a radius of $5$ inches and white tape to create these masks. Ignoring the width of the tape, how much tape did they use? If the length can be expressed $a\sqrt{b}+c\sqrt{d}+ \frac{e}{f} \pi$ such that $b$ and $d$ are not divisible by the square of any prime, and $e$ and $f$ are relatively prime, find $a + b + c + d + e + f$. [img]https://cdn.artofproblemsolving.com/attachments/0/c/bafe3f9939bd5767ba5cf77a51031dd32bbbec.png[/img] [b]p8.[/b] Given $LCM (10^8, 8^{10}, n) = 20^{15}$, where $n$ is a positive integer, find the total number of possible values of $n$. [b]p9.[/b] If one can represent the infinite progression $\frac{1}{11} + \frac{2}{13} + \frac{3}{121} + \frac{4}{169} + \frac{5}{1331} + \frac{6}{2197}+ ...$ as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers, what is $a$? [b]p10.[/b] Consider a tiled $3\times 3$ square without a center tile. How many ways are there to color the squares such that no two colored squares are adjacent (vertically or horizontally)? Consider rotations of an configuration to be the same, and consider the no-color configuration to be a coloring. [b]p11.[/b] Let $ABC$ be a triangle with $AB = 4$ and $AC = 7$. Let $AD$ be an angle bisector of triangle $ABC$. Point $M$ is on $AC$ such that $AD$ intersects $BM$ at point $P$, and $AP : PD = 3 : 1$. If the ratio $AM : MC$ can be expressed as $\frac{a}{b}$ such that $a$, $b$ are relatively prime positive integers, find $a + b$. [b]p12.[/b] For a positive integer $n$, define $f(n)$ as the number of positive integers less than or equal to $n$ that are coprime with $n$. For example, $f(9) = 6$ because $9$ does not have any common divisors with $1$, $2$, $4$, $5$, $7$, or $8$. Calculate: $$\sum^{100}_{i=2} \left( 29^{f(i)}\,\,\, mod \,\,i \right).$$ [b]p13.[/b] Let $ABC$ be an equilateral triangle. Let $P$ be a randomly selected point in the incircle of $ABC$. Find $a+b+c+d$ if the probability that $\angle BPC$ is acute can be expressed as $\frac{a\sqrt{b} -c\pi}{d\pi }$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c, d) = 1$ and $b$ is not divisible by the square of any prime. [b]p14.[/b] When the following expression is simplified by expanding then combining like terms, how many terms are in the resulting expression? $$(a + b + c + d)^{100} + (a + b - c - d)^{100}$$ [b]p15.[/b] Jerry has a rectangular box with integral side lengths. If $3$ units are added to each side of the box, the volume of the box is tripled. What is the largest possible volume of this box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are n points marked on the circle. It is known that among all possible distances between two marked points there are no more than $100$ different ones. What is the largest possible value for $n$?

Nine points form a grid of size $3\times 3$. How many triangles are there with $3$ vertices at these points?

In a country there are $2021$ cities. Each pair of cities is either linked by a single road or not linked at all. It is known that for any subset of $2019$ cities, the total number of roads between them is the same. If the total number of roads in that country is $A$, find all possible values of $A$.

Let $ \sigma = (a_1, a_2, \cdots , a_n)$ be permutation of $ (1, 2 ,\cdots, n)$. A pair $ (a_i, a_j)$ is said to correspond to an [b]inversion[/b] of $\sigma$ if $ i<j$ but $ a_i>a_j$. How many permutations of $ (1,2,\cdots,n)$, $ n \ge 3$, have exactly [b]two[/b] inversions? For example, In the permutation $(2,4,5,3,1)$, there are 6 inversions corresponding to the pairs $ (2,1),(4,3),(4,1),(5,3),(5,1),(3,1)$.

Let $n$ be a positive integer. Ana and Banana are playing the following game: First, Ana arranges $2n$ cups in a row on a table, each facing upside-down. She then places a ball under a cup and makes a hole in the table under some other cup. Banana then gives a finite sequence of commands to Ana, where each command consists of swapping two adjacent cups in the row. Her goal is to achieve that the ball has fallen into the hole during the game. Assuming Banana has no information about the position of the hole and the position of the ball at any point, what is the smallest number of commands she has to give in order to achieve her goal?

Write two ones, then a $2$ between them, then a $3$ between the numbers whose sum is $3$, then a $4$ between the numbers whose sum is $4$, as shown below: $$(1, 1), (1, 2, 1),(1, 3, 2, 3, 1), (1, 4, 3, 2, 3, 4, 1)$$ and so on. Prove that the number of times $n$ appears, ($n\ge 2$), is equal to the number of positive integers less than $n$ and relative prime with $n$..

There are $n$ children in a room. Each child has at least one piece of candy. In Round $1$, Round $2$, etc., additional pieces of candy are distributed among the children according to the following rule: In Round $k$, each child whose number of pieces of candy is relatively prime to $k$ receives an additional piece. Show that after a sufficient number of rounds the children in the room have at most two different numbers of pieces of candy. [i](Proposed by Theresia Eisenkölbl)[/i]

The tennis federation has assigned numbers to $1024$ sportsmen, participating in the tournament, according to their skill. (The tennis federation uses the olympic system of tournaments. The looser in the pair leaves, the winner meets with the winner of another pair. Thus, in the second tour remains $512$ participants, in the third -- $256$, et.c. The winner is determined after the tenth tour.) It comes out, that in the play between the sportsmen whose numbers differ more than on $2$ always win that whose number is less. What is the greatest possible number of the winner?

Pepito's mother wants to prepare $n$ packages of $3$ candies to give away at the birthday party, and for this she will buy assorted candies of $3$ different flavors. You can buy any number of candies but you can't choose how many of each taste. She wants to put one candy of each flavor in each package, and if this is not possible she will use only candy of one flavor and all the packages will have $3$ candies of that flavor. Determine the least number of candies that must be purchased in order to assemble the n packages. He explains why if he buys fewer candies, he is not sure that he will be able to assemble the packages the way he wants.

Within an arithmetic progression of length $ 2005, $ find the number of arithmetic subprogressions of length $ 501 $ that don't contain the $ \text{1000-th} $ term of the progression.

Determine the smallest integer $n\geq 4$ for which one can choose four different numbers $a,b,c$ and $d$ from any $n$ distinct integers such that $a+b-c-d$ is divisible by $20$.

Catherine has a plate containing $300$ circular crumbling mooncakes, arranged as follows: [asy] unitsize(10); for (int i = 0; i < 16; ++i){ for (int j = 0; j < 3; ++j){ draw(circle((sqrt(3)*i,j),0.5)); draw(circle((sqrt(3)*(i+0.5),j-0.5),0.5)); } } dot((16*sqrt(3)+.5,.75)); dot((16*sqrt(3)+1,.75)); dot((16*sqrt(3)+1.5,.75)); [/asy] (This continues for $100$ total columns). She wants to pick some of the mooncakes to eat, however whenever she takes a mooncake all adjacent mooncakes will be destroyed and cannot be eaten. Let $M$ be the maximal number of mooncakes she can eat, and let $n$ be the number of ways she can pick $M$ mooncakes to eat (Note: the order in which she picks mooncakes does not matter). Compute the ordered pair ($M$, $n$).

Given a regular $(6n+3)$-gon, $3n$ of its vertices are used to form $n$ acute triangles with distinct vertices. Prove that the other $3n+3$ vertices can be used to form $n+1$ acute triangles with distinct vertices. [i]Lim Jeck[/i]

Consider a pyramid with a regular $n$-gon as its base. We colour all the segments connecting two of the vertices of the pyramid except for the sides of the base either red or blue. Show that if $n=9$ then for each such colouring there are three vertices of the pyramid connecting by three segments of the same colour, and that this is not necessarily the case if $n=8$.

There are $15$ people attending math team: $12$ students and $3$ captains. One of the captains brings $33$ identical snacks. A nonnegative number of names (students and/or captains) are written on the NO SNACK LIST. At the end of math team, all students each get n snacks, and all captains get $n +1$ snacks, unless the person’s name is written on the board. After everyone’s snacks are distributed, there are none left. Find the number of possible integer values of $n$.

Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties: (a) if $x\le y$, then $f(x)\le f(y)$; and (b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$. Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$. [i](United Kingdom) Ben Elliott[/i]

Consider all sets of $n$ distinct positive integers, no three of which form an arithmetic progression. Prove that among all such sets there is one which has the largest sum of the reciprocals of its elements.

A country has $2023$ cities and there are flights between these cities. Each flight connects two cities in both directions. We know that you can get from any city to any other using these flights, and from each city there are flights to at most $4$ other cities. What is the maximum possible number of cities in the country from which there is a flight to only one city?

Seven points are given in space, no four of which are on a plane. Each of the segments with the endpoints in these points is painted black or red. Prove that there are two monochromatic triangles (not necessarily both of the same color) with no common edge. Does the statement hold for six points?

Suppose that $2018$ numbers $1$ and $-1$ are written around a circle. For every two adjacent numbers, their product is taken. Suppose that the sum of all $2018$ products is negative. Find all possible values of sum of $2018$ given numbers.

Each vertex of the 3-dimensional Euclidean space either is coloured red or blue. Prove that within those squares being possible in this space with edge length 1 there is at least one square either with three red vertices or four blue vertices !

On a circular table are sitting $ 2n$ people, equally spaced in between. $ m$ cookies are given to these people, and they give cookies to their neighbors according to the following rule. (i) One may give cookies only to people adjacent to himself. (ii) In order to give a cookie to one's neighbor, one must eat a cookie. Select arbitrarily a person $ A$ sitting on the table. Find the minimum value $ m$ such that there is a strategy in which $ A$ can eventually receive a cookie, independent of the distribution of cookies at the beginning.

Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when: a) $n=2014$ b) $n=2015 $ c) $n=2018$

Find the number of functions $f : \{1, 2, . . . , n\} \to \{1995, 1996\}$ such that $f(1) + f(2) + ... + f(1996)$ is odd.