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

1950 Miklós Schweitzer, 7

Let $ x$ be an arbitrary real number in $ (0,1)$. For every positive integer $ k$, let $ f_k(x)$ be the number of points $ mx\in [k,k \plus{} 1)$ $ m \equal{} 1,2,...$ Show that the sequence $ \sqrt [n]{f_1(x)f_2(x)\cdots f_n(x)}$ is convergent and find its limit.

2005 South africa National Olympiad, 6

Consider the increasing sequence $1,2,4,5,7,9,10,12,14,16,17,19,\dots$ of positive integers, obtained by concatenating alternating blocks $\{1\},\{2,4\},\{5,7,9\},\{10,12,14,16\},\dots$ of odd and even numbers. Each block contains one more element than the previous one and the first element in each block is one more than the last element of the previous one. Prove that the $n$-th element of the sequence is given by \[2n-\Big\lfloor\frac{1+\sqrt{8n-7}}{2}\Big\rfloor.\] (Here $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.)

1990 Baltic Way, 19

What is the largest possible number of subsets of the set $\{1, 2, \dots , 2n+1\}$ such that the intersection of any two subsets consists of one or several consecutive integers?

2019 PUMaC Team Round, 11

The game Prongle is played with a special deck of cards: on each card is a nonempty set of distinct colors. No two cards in the deck contain the exact same set of colors. In this game, a “Prongle” is a set of at least $2$ cards such that each color is on an even number of cards in the set. Let k be the maximum possible number of prongles in a set of $2019$ cards. Find $\lfloor \log 2 (k) \rfloor$.

1997 Putnam, 4

Let $a_{m,n}$ denote the coefficient of $x^n$ in the expansion $(1+x+x^2)^n$. Prove the inequality for all integers $k\ge 0$ : \[ 0\le \sum_{\ell=0}^{\left\lfloor{\frac{2k}{3}}\right\rfloor} (-1)^{\ell} a_{k-\ell,\ell}\le 1 \]

2008 Gheorghe Vranceanu, 1

At what index the harmonic series has a fractional part of $ 1/12? $

2012 ELMO Shortlist, 2

Determine whether it's possible to cover a $K_{2012}$ with a) 1000 $K_{1006}$'s; b) 1000 $K_{1006,1006}$'s. [i]David Yang.[/i]

2004 AIME Problems, 12

Let $S$ be the set of ordered pairs $(x, y)$ such that $0<x\le 1$, $0<y\le 1$, and $\left[\log_2{\left(\frac 1x\right)}\right]$ and $\left[\log_5{\left(\frac 1y\right)}\right]$ are both even. Given that the area of the graph of $S$ is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. The notation $[z]$ denotes the greatest integer that is less than or equal to $z$.

2012 AMC 12/AHSME, 24

Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

2011 Germany Team Selection Test, 2

Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$

2021 Brazil National Olympiad, 9

Let $\alpha\geq 1$ be a real number. Define the set $$A(\alpha)=\{\lfloor \alpha\rfloor,\lfloor 2\alpha\rfloor, \lfloor 3\alpha\rfloor,\dots\}$$ Suppose that all the positive integers that [b]does not belong[/b] to the $A(\alpha)$ are exactly the positive integers that have the same remainder $r$ in the division by $2021$ with $0\leq r<2021$. Determine all the possible values of $\alpha$.

2006 Pre-Preparation Course Examination, 5

Powers of $2$ in base $10$ start with $3$ or $4$ more frequently? What is their state in base $3$? First write down an exact form of the question.

2014 NIMO Problems, 5

Find the largest integer $n$ for which $2^n$ divides \[ \binom 21 \binom 42 \binom 63 \dots \binom {128}{64}. \][i]Proposed by Evan Chen[/i]

2016 India PRMO, 11

For real numbers $x$ and $y$, let $M$ be the maximum value of the expression $x^4y + x^3y + x^2y + xy + xy^2 + xy^3 + xy^4$, subject to $x + y = 3$. Find $[M]$.

2015 CHMMC (Fall), 8

Let $f(n) = \sum^n_{d=1} \left\lfloor \frac{n}{d} \right\rfloor$ and $g(n) = f(n) -f(n - 1)$. For how many $n$ from $1$ to $100$ inclusive is $g(n)$ even?

2007 China Team Selection Test, 2

A rational number $ x$ is called [i]good[/i] if it satisfies: $ x\equal{}\frac{p}{q}>1$ with $ p$, $ q$ being positive integers, $ \gcd (p,q)\equal{}1$ and there exists constant numbers $ \alpha$, $ N$ such that for any integer $ n\geq N$, \[ |\{x^n\}\minus{}\alpha|\leq\dfrac{1}{2(p\plus{}q)}\] Find all the good numbers.

PEN I Problems, 7

Prove that for all positive integers $n$, \[\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}\rfloor =\lfloor \sqrt[3]{8n+3}\rfloor.\]

2006 Junior Balkan MO, 4

Consider a $2n \times 2n$ board. From the $i$th line we remove the central $2(i-1)$ unit squares. What is the maximal number of rectangles $2 \times 1$ and $1 \times 2$ that can be placed on the obtained figure without overlapping or getting outside the board?

PEN N Problems, 1

Show that the sequence $\{a_{n}\}_{n \ge 1}$ defined by $a_{n}=\lfloor n\sqrt{2}\rfloor$ contains an infinite number of integer powers of $2$.

2018 Dutch IMO TST, 3

Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is de fined as follows: we have $a_0 = n$ and for $k \ge 1, a_k$ is the smallest integer greater than $a_{k-1}$ for which $a_k +a_{k-1}$ is the square of an integer. Prove that there are exactly $\lfloor \sqrt{2n}\rfloor$ positive integers that cannot be written in the form $a_k - a_{\ell}$ with $k > \ell\ge 0$.

2017 Taiwan TST Round 3, 1

Let $\{a_n\}_{n\geq 0}$ be an arithmetic sequence with difference $d$ and $1\leq a_0\leq d$. Denote the sequence as $S_0$, and define $S_n$ recursively by two operations below: Step $1$: Denote the first number of $S_n$ as $b_n$, and remove $b_n$. Step $2$: Add $1$ to the first $b_n$ numbers to get $S_{n+1}$. Prove that there exists a constant $c$ such that $b_n=[ca_n]$ for all $n\geq 0$, where $[]$ is the floor function.

2011 Today's Calculation Of Integral, 746

Prove the following inequality. \[n^ne^{-n+1}\leq n!\leq \frac 14(n+1)^{n+1}e^{-n+1}.\]

2020 Turkey MO (2nd round), 5

Find all polynomials with real coefficients such that one can find an integer valued series $a_0, a_1, \dots$ satisfying $\lfloor P(x) \rfloor = a_{ \lfloor x^2 \rfloor}$ for all $x$ real numbers.

2012 Math Prize For Girls Problems, 3

What is the least positive integer $n$ such that $n!$ is a multiple of $2012^{2012}$?

2008 ITest, 32

A right triangle has perimeter $2008$, and the area of a circle inscribed in the triangle is $100\pi^3$. Let $A$ be the area of the triangle. Compute $\lfloor A\rfloor$.