A number is chosen uniformly at random from the set of all positive integers with at least two digits, none of which are repeated. Find the probability that the number is even.

[u]Round 1[/u] [b]p1.[/b] Ash is running around town catching Pokémon. Each day, he may add $3, 4$, or $5$ Pokémon to his collection, but he can never add the same number of Pokémon on two consecutive days. What is the smallest number of days it could take for him to collect exactly $100$ Pokémon? [b]p2.[/b] Jack and Jill have ten buckets. One bucket can hold up to $1$ gallon of water, another can hold up to $2$ gallons, and so on, with the largest able to hold up to $10$ gallons. The ten buckets are arranged in a line as shown below. Jack and Jill can pour some amount of water into each bucket, but no bucket can have less water than the one to its left. Is it possible that together, the ten buckets can hold 36 gallons of water? [img]https://cdn.artofproblemsolving.com/attachments/f/8/0b6524bebe8fe859fe7b1bc887ac786106fc17.png[/img] [b]p3.[/b] There are $2023$ knights and liars standing in a row. Knights always tell the truth and liars always lie. Each of them says, “the number of liars to the left of me is greater than the number of knights to the right.” How many liars are there? [b]p4.[/b] Camila has a deck of $101$ cards numbered $1, 2, ..., 101$. She starts with $50$ random cards in her hand and the rest on a table with the numbers visible. In an exchange, she replaces all $50$ cards in her hand with her choice of $50$ of the $51$ cards from the table. Show that Camila can make at most 50 exchanges and end up with cards $1, 2, ..., 50$. [img]https://cdn.artofproblemsolving.com/attachments/0/6/c89e65118764f3b593da45264bfd0d89e95067.png[/img] [b]p5.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [u]Round 2[/u] [b]p6.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company will lay lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses. The Edison lighting company will hang strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [b]p7.[/b] You are given a sequence of $16$ digits. Is it always possible to select one or more digits in a row, so that multiplying them results in a square number? [img]https://cdn.artofproblemsolving.com/attachments/d/1/f4fcda2e1e6d4a1f3a56cd1a04029dffcd3529.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a set of $1997$ numbers such that if each number in the set, replace with the sum of the rest, you get the same set. Prove that the product of numbers in the set is equal to $0$.

Let $\mathbb R$ be set of real numbers. Determine all functions $f:\mathbb R\to \mathbb R$ such that $$f(y^2 - f(x)) = yf(x)^2+f(x^2y+y)$$ holds for all real numbers $x; y$

Alex is training to make $\text{MOP}$. Currently he will score a $0$ on $\text{the AMC,}\text{ the AIME,}\text{and the USAMO}$. He can expend $3$ units of effort to gain $6$ points on the $\text{AMC}$, $7$ units of effort to gain $10$ points on the $\text{AIME}$, and $10$ units of effort to gain $1$ point on the $\text{USAMO}$. He will need to get at least $200$ points on $\text{the AMC}$ and $\text{AIME}$ combined and get at least $21$ points on $\text{the USAMO}$ to make $\text{MOP}$. What is the minimum amount of effort he can expend to make $\text{MOP}$?

A cyclic quadrilateral $ABCD$ is given. An arbitrary circle passing through $C$ and $D$ meets $AC,BC$ at points $X,Y$ respectively. Find the locus of common points of circles $CAY$ and $CBX$.

Let $S$ be the set of integers that represent the number of intersections of some four distinct lines in the plane. List the elements of $S$ in ascending order.

No two of $20$ students in a class have the same scores on both written and oral examinations in mathematics. We say that student $A$ is better than $B$ if his two scores are greater than or equal to the corresponding scores of $B$. The scores are integers between $1$ and $10$. (a) Show that there exist three students $A,B,C$ such that $A$ is better than $B$ and $B$ is better than $C$. (b) Would the same be true for a class of $19$ students?

A little boy takes a $ 12$ in long strip of paper and makes a Mobius strip out of it by tapping the ends together after adding a half twist. He then takes a $ 1$ inch long train model and runs it along the center of the strip at a speed of $ 12$ inches per minute. How long does it take the train model to make two full complete loops around the Mobius strip? A complete loop is one that results in the train returning to its starting point.

An exam at a university consists of one question randomly selected from the$ n$ possible questions. A student knows only one question, but he can take the exam $n$ times. Express as a function of $n$ the probability $p_n$ that the student will pass the exam. Does $p_n$ increase or decrease as $n$ increases? Compute $lim_{n\to \infty}p_n$. What is the largest lower bound of the probabilities $p_n$?

Circle I is circumscribed about a given square and circle II is inscribed in the given square. If $r$ is the ratio of the area of circle $I$ to that of circle $II$, then $r$ equals: $\text{(A)} \ \sqrt 2 \qquad \text{(B)} \ 2 \qquad \text{(C)} \ \sqrt 3 \qquad \text{(D)} \ 2\sqrt 2 \qquad \text{(E)} \ 2\sqrt 3$

* On a plane two points $A$ and $B$ are on the same side of a line. Find point $M$ on the line such that $MA +MB$ is equal to a given length.

In tetrahedron $ABCD$, $AB=1,CD=3$, the distance between $AB$ and $CD$ is $2$, the intersection angle between $AB$ and $CD$ is $\frac{\pi}{3}$, then the volume of tetrahedron $ABCD$ is $\text{(A)}\frac{\sqrt3}{2}\qquad\text{(B)}\frac{1}{2}\qquad\text{(C)}\frac{1}{3}\qquad\text{(D)}\frac{\sqrt3}{3}$

Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term beginning with the third is the sum of the previous two terms, and the seventh term of each sequence is $N$. What is the smallest possible value of $N$? ${ \textbf{(A)}\ 55\qquad\textbf{(B)}\ 89\qquad\textbf{(C)}\ 104\qquad\textbf{(D}}\ 144\qquad\textbf{(E)}\ 273 $

Two polynomials of the same degree $A(x)=a_nx^n+ \cdots + a_1x+a_0$ and $B(x)=b_nx^n+\cdots+b_1x+b_0$ are called [i]friends[/i] is the coefficients $b_0,b_1, \ldots, b_n$ are a permutation of the coefficients $a_0,a_1, \ldots, a_n$. $P(x)$ and $Q(x)$ be two friendly polynomials with integer coefficients. If $P(16)=3^{2020}$, the smallest possible value of $|Q(3^{2020})|$.

Find all real numbers$ x$ and $y$ such that $$x^2 + y^2 = 2$$ $$\frac{x^2}{2 - y}+\frac{y^2}{2 - x}= 2.$$

$M$ is an arbitrary point inside $\triangle ABC$. $AM$ intersects the circumcircle of the triangle again at $A_1$. Find the points $M$ that minimise $\frac{MB\cdot MC}{MA_1}$.

Consider all triangles $ABC$ in the cartesian plane whose vertices are at lattice points (i.e. with integer coordinates) and which contain exactly one lattice point (to be denoted $P$) in its interior. Let the line $AP$ meet $BC$ at $E$. Determine the maximum possible value of the ratio $\frac{AP}{PE}$.

Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive prime integer whose first digit is less than its second, and when you reverse its digits, it's still a prime number!" Claire asks, "If you picked a digit of your favorite number at random and revealed it to me without telling me which place it was in, is there any chance I'd know for certain what it is?" Cat says, "Nope! However, if I now told you the units digit of my favorite number, you'd know which one it is!" Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu[/i]

Sam Wang decides to evaluate an expression of the form $x +2 \cdot 2+ y$. However, he unfortunately reads each ’plus’ as a ’times’ and reads each ’times’ as a ’plus’. Surprisingly, he still gets the problem correct. Find $x + y$. [i]Proposed by Edwin Zhao[/i] [hide=Solution] [i]Solution.[/i] $\boxed{4}$ We have $x+2*2+y=x \cdot 2+2 \cdot y$. When simplifying, we have $x+y+4=2x+2y$, and $x+y=4$. [/hide]

Let $ \{X_n\}$ and $ \{Y_n\}$ denote two sequences of integers defined as follows: \begin{align*} X_0 \equal{} 1,\ X_1 \equal{} 1,\ X_{n \plus{} 1} \equal{} X_n \plus{} 2X_{n \minus{} 1} \quad (n \equal{} 1,2,3,\ldots), \\ Y_0 \equal{} 1,\ Y_1 \equal{} 7,\ Y_{n \plus{} 1} \equal{} 2Y_n \plus{} 3Y_{n \minus{} 1} \quad (n \equal{} 1,2,3,\ldots).\end{align*} Prove that, except for the "1", there is no term which occurs in both sequences.

Prove that for every real number $x$ and positive integer $n$ $$|\cos x|+|\cos2x|+|\cos2^2x|+\ldots+|\cos2^nx|\ge\frac n{2\sqrt2}.$$

In a handbook of plants each plant is characterized by $100$ attributes (each attribute may either be present in a plant or not). Two plants are called [i]dissimilar [/i] if they differ by no less than $51$ attributes. (a) Prove that the handbook cannot describe more than $50$ pair-wise dissimilar plants. (b) Can it describe $50$ pairwise dissimilar plants? (Dima Tereshin)

In a quadrilateral \(ABCD\), it is known that \(\angle ABC = \angle ADC = 90^{\circ}\). On the ray \(AB\) beyond point \(B\), a point \(K\) is chosen such that \(\angle AKD = \angle ADB\). Point \(L\) is the projection of point \(K\) onto the line \(AD\), and point \(N\) is the projection of point \(D\) onto the line \(CL\). Find the degree measure of \(\angle ANK\). [i]Proposed by Mykhailo Shtandenko[/i]

Jeck and Lisa are playing a game on table dimensions $m \times n$ , where $m , n >2$. Lisa starts so that she puts knight figurine on arbitrary square of table.After that Jeck and Lisa put new figurine on table by the following rules: [b]1.[/b] Jeck puts queen figurine on any empty square of a table which is two squares vertically and one square horizontally distant, or one square vertically and two squares horizontally distant from last knight figurine which Lisa put on the table [b]2.[/b] Lisa puts knight figurine on any empty square of a table which is in the same row, column or diagonal as last queen figurine Jeck put on the table. Player which cannot put his figurine loses. For which pairs of $(m,n)$ Lisa has winning strategy? [i] Proposed by Stijn Cambie[/i]