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: 1187

2021 MIG, 14

The notation $\lfloor n \rfloor$ denotes the greatest integer less than or equal to $n$. Evaluate $\lfloor 2.1 \lfloor {-}4.3 \rfloor \rfloor$. $\textbf{(A) }{-}11\qquad\textbf{(B) }{-}10\qquad\textbf{(C) }{-}9\qquad\textbf{(D) }{-}8\qquad\textbf{(E) }{-}4$

1998 Argentina National Olympiad, 4

Determine all possible values of the expression$$x-\left [\frac{x}{2}\right ]-\left [\frac{x}{3}\right ]-\left [\frac{x} {6}\right ]$$by varying $x$ in the real numbers. Clarification: The brackets indicate the integer part of the number they enclose.

2012 Baltic Way, 3

(a) Show that the equation \[\lfloor x \rfloor (x^2 + 1) = x^3,\] where $\lfloor x \rfloor$ denotes the largest integer not larger than $x$, has exactly one real solution in each interval between consecutive positive integers. (b) Show that none of the positive real solutions of this equation is rational.

2011 Indonesia TST, 2

A graph $G$ with $n$ vertex is called [i]good [/i] if every vertex could be labelled with distinct positive integers which are less than or equal $\lfloor \frac{n^2}{4} \rfloor$ such that there exists a set of nonnegative integers $D$ with the following property: there exists an edge between $2$ vertices if and only if the difference of their labels is in $D$. Show that there exists a positive integer $N$ such that for every $n \ge N$, there exist a not-good graph with $n$ vertices.

1990 IMO Longlists, 29

Function $f(n), n \in \mathbb N$, is defined as follows: Let $\frac{(2n)!}{n!(n+1000)!} = \frac{A(n)}{B(n)}$ , where $A(n), B(n)$ are coprime positive integers; if $B(n) = 1$, then $f(n) = 1$; if $B(n) \neq 1$, then $f(n)$ is the largest prime factor of $B(n)$. Prove that the values of $f(n)$ are finite, and find the maximum value of $f(n).$

1996 Balkan MO, 2

Let $ p$ be a prime number with $ p>5$. Consider the set $ X \equal{} \left\{p \minus{} n^2 \mid n\in \mathbb{N} ,\ n^2 < p\right\}$. Prove that the set $ X$ has two distinct elements $ x$ and $ y$ such that $ x\neq 1$ and $ x\mid y$. [i]Albania[/i]

2009 Princeton University Math Competition, 2

It is known that a certain mechanical balance can measure any object of integer mass anywhere between 1 and 2009 (both included). This balance has $k$ weights of integral values. What is the minimum $k$ for which there exist weights that satisfy this condition?

2007 ITest, 58

Let $T=\text{TNFTPP}$. For natural numbers $k,n\geq 2$, we define $S(k,n)$ such that \[S(k,n)=\left\lfloor\dfrac{2^{n+1}+1}{2^{n-1}+1}\right\rfloor+\left\lfloor\dfrac{3^{n+1}+1}{3^{n-1}+1}\right\rfloor+\cdots+\left\lfloor\dfrac{k^{n+1}+1}{k^{n-1}+1}\right\rfloor.\] Compute the value of $S(10,T+55)-S(10,55)+S(10,T-55)$.

1996 Putnam, 5

Let $p$ be a prime greater than $3$. Prove that \[ p^2\Big| \sum_{i=1}^{\left\lfloor\frac{2p}{3}\right\rfloor}\dbinom{p}{i}. \]

2012 Harvard-MIT Mathematics Tournament, 5

Find all ordered triples $(a,b,c)$ of positive reals that satisfy: $\lfloor a\rfloor bc=3,a\lfloor b\rfloor c=4$, and $ab\lfloor c\rfloor=5$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

2006 Taiwan National Olympiad, 2

Find all reals $x$ satisfying $0 \le x \le 5$ and $\lfloor x^2-2x \rfloor = \lfloor x \rfloor ^2 - 2 \lfloor x \rfloor$.

2012 ELMO Shortlist, 6

Prove that if $a$ and $b$ are positive integers and $ab>1$, then \[\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.\]Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$. [i]Calvin Deng.[/i]