There are five guys named Alan, Bob, Casey, Dan, and Eric. Each one either always tells the truth or always lies. You overhear the following discussion between them: Alan: [i]"All of us are truth-tellers."[/i] Bob: [i]"No, only Alan and I are truth-tellers."[/i] Casey: [i]"You are both liars."[/i] Dan:[i] "If Casey is a truth-teller, then Eric is too."[/i] Eric: [i]"An odd number of us are liars."[/i] Who are the liars?

Betty has a $4$-by-$4$ square box of chocolates. Every time Betty eats a chocolate, she picks one from a row with the greatest number of remaining chocolates. In how many ways can Betty eat $5$ chocolates from her box, where order matters?

Let $n \ge 2$ be an integer. Consider an $n \times n$ chessboard consisting of $n^2$ unit squares. A configuration of $n$ rooks on this board is [i]peaceful[/i] if every row and every column contains exactly one rook. Find the greatest positive integer $k$ such that, for each peaceful configuration of $n$ rooks, there is a $k \times k$ square which does not contain a rook on any of its $k^2$ unit squares.

$32$ real and $32$ fake coins are given the same appearance. All fake coins weigh equally and less than the real ones, which also all weigh the same. How to determine the type of at least seven coins in six weighings on a scale with two bowls?

Consider a $12$-card deck containing all four suits of $2, 3,$ and $4.$ A [i]double[/i] is defined as two cards directly next to each other in the deck, with the same value. Suppose we scan the deck left to right, and whenever we encounter a double, we remove all the cards up to that point (including the double). Let $N$ denote the number of times we have to remove cards. What is the expected value of $N$?

A computer is programmed to randomly generate a string of six symbols using only the letters $A,B,C$. What is the probability that the string will not contain three consecutive $A$'s?

A magician wants to demonstrate the following trick to an audience of $n \ge 16$ people. He gives them $15$ hats and after giving instructions to his assistant (which the audience does not hear), leaves the hall. Some $15$ people in the audience put on one of the hats. The assistant tags in front of everyone, one of the hats with a marker and then the person with an unmarked hat takes it off. The magician then returns back to the hall and after surveying the situation, knows who in the audience has taken off his hat. For what $n$ is this possible? [hide=original wording]Магьосник иска да покаже следния фокус пред публика от $n \ge 16$ души. Той им дава $15$ шапки и след като даде инструкции на помощника си (които публиката не чува), напуска залата. Някои $15$ души от публиката си слагат по една от шапките. Асистентът маркира пред всички една от шапките с маркер и след това човек с немаркирана шапка си я сваля. След това магьосникът се връща обратно в залата и след оглед на ситуацията познава кой от публиката си е свалил шапката. За кои $n$ е възможно това?[/hide]

We put pebbles on some unit squares of a $2013 \times 2013$ chessboard such that every unit square contains at most one pebble. Determine the minimum number of pebbles on the chessboard, if each $19\times 19$ square formed by unit squares contains at least $21$ pebbles.

There are 105 users on the social media platform Mathsenger, every pair of which has a direct messaging channel. Prove that each messaging channel may be assigned one of 100 encryption keys, such that no 4 users have the 6 pairwise channels between them all being assigned the same encryption key. [i]Proposed by Fredy Yip[/i]

Given a $32 \times 32$ table, we put a mouse (facing up) at the bottom left cell and a piece of cheese at several other cells. The mouse then starts moving. It moves forward except that when it reaches a piece of cheese, it eats a part of it, turns right, and continues moving forward. We say that a subset of cells containing cheese is good if, during this process, the mouse tastes each piece of cheese exactly once and then falls off the table. Show that: (a) No good subset consists of 888 cells. (b) There exists a good subset consisting of at least 666 cells.

A finite set $M$ of unit squares on the plane is considered. The sides of the squares are parallel to the coordinate axes and the squares are allowed to intersect. It is known that the distance between the centres of any pair of squares is no greater than $2$. Prove that there exists a unit square (not necessarily belonging to $M$) with sides parallel to the coordinate axes and which has at least one common point with each of the squares in $M$. (A Andjans, Riga)

A postman wants to divide $n$ packages with weights $1, 2, 3, 4, n$ into three groups of exactly the same weight. Can he do this if (a) $n = 2011$ ? (b) $n = 2012$ ?

[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].

We have $ n $ kinds of puddings. There are $ a_{i} $ puddings which are $ i $-th type and those $ S = a_{1}+\cdots+a_{n} $ puddings are distinct. Now, for a given arrangement of puddings: $ p_{1}, \dots, p_{n} $. Define $ c_{i} $ to be $$ \#\{1 \le j \le S-1 \ \mid \ p_{j}, p_{j+1} \text{ are the same type.}\} $$ Show that if $ S $ is composite, then the sum of $ \prod_{i=1}^{n}{c_{i}} $ over all possible arrangements is a multiple of $ S $.

Let $ABCD$ be a unit square. For any interior points $M,N$ such that the line $MN$ does not contain a vertex of the square, we denote by $s(M,N)$ the least area of the triangles having their vertices in the set of points $\{ A,B,C,D,M,N\}$. Find the least number $k$ such that $s(M,N)\le k$, for all points $M,N$. [i]Dinu Șerbănescu[/i]

In a country there are $2014$ airports, no three of them lying on a line. Two airports are connected by a direct flight if and only if the line passing through them divides the country in two parts, each with $1006$ airports in it. Show that there are no two airports such that one can travel from the first to the second, visiting each of the $2014$ airports exactly once.

Let $S=\{1, 2, 3, \dots 2021\}$ and $f:S \to S$ be a function such that $f^{(n)}(n)=n$ for each $n \in S$. Find all possible values for $f(2021)$. (Here, $f^{(n)}(n) = \underbrace{f(f(f\dots f(}_{n \text{ times} }n)))\dots))$.) [i]Authored by Viktor Simjanoski[/i]

For any 2 convex polygons $S$ and $T$, if all the vertices of $S$ are vertices of $T$, call $S$ a sub-polygon of $T$. [b]I. [/b]Prove that for an odd number $n \geq 5$, there exists $m$ sub-polygons of a convex $n$-gon such that they do not share any edges, and every edge and diagonal of the $n$-gon are edges of the $m$ sub-polygons. [b]II.[/b] Find the smallest possible value of $m$.

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

Farmer James invents a new currency, such that for every positive integer $n\le 6$, there exists an $n$-coin worth $n!$ cents. Furthermore, he has exactly $n$ copies of each $n$-coin. An integer $k$ is said to be [i]nice[/i] if Farmer James can make $k$ cents using at least one copy of each type of coin. How many positive integers less than 2018 are nice?

p1. Two integers $m$ and $n$ are said to be [i]coprime [/i] if there are integers $a$ and $ b$ such that $am + bn = 1$. Show that for each integer $p$, the pair of numbers formed by $21p + 4$ and $14p + 3$ are always coprime. p2. Two farmers, Person $A$ and Person $B$ intend to change the boundaries of their land so that it becomes like a straight line, not curvy as in image below. They do not want the area of ​​their origin to be reduced. Try define the boundary line they should agree on, and explain why the new boundary does not reduce the area of ​​their respective origins. [img]https://cdn.artofproblemsolving.com/attachments/4/d/ec771d15716365991487f3705f62e4566d0e41.png[/img] p3. The system of equations of four variables is given: $\left\{\begin{array}{l} 23x + 47y - 3z = 434 \\ 47x - 23y - 4w = 183 \\ 19z + 17w = 91 \end{array} \right. $ where $x, y, z$, and $w$ are positive integers. Determine the value of $(13x - 14y)^3 - (15z + 16w)^3$ p4. A person drives a motorized vehicle so that the material used fuel is obtained at the following graph. [img]https://cdn.artofproblemsolving.com/attachments/6/f/58e9f210fafe18bfb2d9a3f78d90ff50a847b2.png[/img] Initially the vehicle contains $ 3$ liters of fuel. After two hours, in the journey of fuel remains $ 1$ liter. a. If in $ 1$ liter he can cover a distance of $32$ km, what is the distance taken as a whole? Explain why you answered like that? b. After two hours of travel, is there any acceleration or deceleration? Explain your answer. c. Determine what the average speed of the vehicle is. p5. Amir will make a painting of the circles, each circle to be filled with numbers. The circle's painting is arrangement follows the pattern below. [img]https://cdn.artofproblemsolving.com/attachments/8/2/533bed783440ea8621ef21d88a56cdcb337f30.png[/img] He made a rule that the bottom four circles would be filled with positive numbers less than $10$ that can be taken from the numbers on the date of his birth, i.e. $26 \,\, - \,\, 12 \,\, - \,\,1961$ without recurrence. Meanwhile, the circles above will be filled with numbers which is the product of the two numbers on the circles in underneath. a. In how many ways can he place the numbers from left to right, right on the bottom circles in order to get the largest value on the top circle? Explain. b. On another occasion, he planned to put all the numbers on the date of birth so that the number of the lowest circle now, should be as many as $8$ circles. He no longer cares whether the numbers are repeated or not . i. In order to get the smallest value in the top circle, how should the numbers be arranged? ii. How many arrays are worth considering to produce the smallest value?

Vertices and Edges of a regular $n$-gon are numbered $1,2,\dots,n$ clockwise such that edge $i$ lies between vertices $i,i+1 \mod n$. Now non-negative integers $(e_1,e_2,\dots,e_n)$ are assigned to corresponding edges and non-negative integers $(k_1,k_2,\dots,k_n)$ are assigned to corresponding vertices such that: $i$) $(e_1,e_2,\dots,e_n)$ is a permutation of $(k_1,k_2,\dots,k_n)$. $ii$) $k_i=|e_{i+1}-e_i|$ indexes$\mod n$. a) Prove that for all $n\geq 3$ such non-zero $n$-tuples exist. b) Determine for each $m$ the smallest positive integer $n$ such that there is an $n$-tuples stisfying the above conditions and also $\{e_1,e_2,\dots,e_n\}$ contains all $0,1,2,\dots m$.

Consider a stripe of $n$ fieds, numbered from left to right with the integers $1$ to $n$ in ascending order. Each of the fields is colored with one of the colors $1$, $2$ or $3$. Even-numbered fields can be colored with any color. Odd-numbered fields are only allowed to be colored with the odd colors $1$ and $3$. How many such colorings are there such that any two neighboring fields have different colors?

Find the smallest number \(n\) such that any set of \(n\) ponts in a Cartesian plan, all of them with integer coordinates, contains two poitns such that the square of its mutual distance is a multiple of \(2016\).

Tracey baked a square cake whose surface is dissected in a $ 10 \times 10$ grid. In some of the fields she wants to put a strawberry such that for each four fields that compose a rectangle whose edges run in parallel to the edges of the cake boundary there is at least one strawberry. What is the minimum number of required strawberries?