Olympiad problems

AND:

OR:

NO:

Found problems: 2

2019 IMO Shortlist, C9

For any two different real numbers $x$ and $y$, we define $D(x,y)$ to be the unique integer $d$ satisfying $2^d\le |x-y| < 2^{d+1}$. Given a set of reals $\mathcal F$, and an element $x\in \mathcal F$, we say that the [i]scales[/i] of $x$ in $\mathcal F$ are the values of $D(x,y)$ for $y\in\mathcal F$ with $x\neq y$. Let $k$ be a given positive integer. Suppose that each member $x$ of $\mathcal F$ has at most $k$ different scales in $\mathcal F$ (note that these scales may depend on $x$). What is the maximum possible size of $\mathcal F$?

2025 AMC 8, 20

Tags: AMC 8 , Edmits , orz , Cheese , 2025 AMC 8

Sarika, Dev, and Rajiv are sharing a large block of cheese. They take turns cutting off half of what remains and eating it: first Sarika eats half of the cheese, then Dev eats half of the remaining half, then Rajiv eats half of what remains, then back to Sarika, and so on. They stop when the cheese is too small to see. About what fraction of the original block of cheese does Sarika eat in total? $\hspace*{5mm}\text{(A) } \frac{4}{7} \quad \text{(B) } \frac{3}{5} \quad \text{(C) } \frac{2}{3} \quad \text{(D) } \frac{3}{4} \quad \text{(E) } \frac{7}{8}$