This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 6

2007 ITest, 60

Let $T=\text{TNFTPP}$. Triangle $ABC$ has $AB=6T-3$ and $AC=7T+1$. Point $D$ is on $BC$ so that $AD$ bisects angle $BAC$. The circle through $A$, $B$, and $D$ has center $O_1$ and intersects line $AC$ again at $B'$, and likewise the circle through $A$, $C$, and $D$ has center $O_2$ and intersects line $AB$ again at $C'$. If the four points $B'$, $C'$, $O_1$, and $O_2$ lie on a circle, find the length of $BC$.

2005 Pan African, 2

Noah has to fit 8 species of animals into 4 cages of the Arc. He planes to put two species of animal in each cage. It turns out that, for each species of animal, there are at most 3 other species with which it cannot share a cage. Prove that there is a way to assign the animals to the cages so that each species shares a cage with a compatible species.

2007 ITest, 59

Let $T=\text{TNFTPP}$. Fermi and Feynman play the game $\textit{Probabicloneme}$ in which Fermi wins with probability $a/b$, where $a$ and $b$ are relatively prime positive integers such that $a/b<1/2$. The rest of the time Feynman wins (there are no ties or incomplete games). It takes a negligible amount of time for the two geniuses to play $\textit{Probabicloneme}$ so they play many many times. Assuming they can play infinitely many games (eh, they're in Physicist Heaven, we can bend the rules), the probability that they are ever tied in total wins after they start (they have the same positive win totals) is $(T-332)/(2T-601)$. Find the value of $a$.

KoMaL A Problems 2018/2019, A. 735

For any function $f:[0,1]\to [0,1]$, let $P_n (f)$ denote the number of fixed points of the function $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )$, i.e., the number of points $x\in [0,1]$ satisfying $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )=x$. Construct a piecewise linear, continuous, surjective function $f:[0,1] \to [0,1]$ such that for a suitable $2<A<3$, the sequence $\frac{P_n(f)}{A^n}$ converges. [i]Based on the 8th problem of the Miklós Schweitzer competition, 2018[/i]

2017 China Girls Math Olympiad, 4

Partition $\frac1{2002},\frac1{2003},\frac1{2004},\ldots,\frac{1}{2017}$ into two groups. Define $A$ the sum of the numbers in the first group, and $B$ the sum of the numbers in the second group. Find the partition such that $|A-B|$ attains it minimum and explains the reason.

2007 ITest, 50

A block $Z$ is formed by gluing one face of a solid cube with side length 6 onto one of the circular faces of a right circular cylinder with radius $10$ and height $3$ so that the centers of the square and circle coincide. If $V$ is the smallest convex region that contains Z, calculate $\lfloor\operatorname{vol}V\rfloor$ (the greatest integer less than or equal to the volume of $V$).