Found problems: 1340
The first number in the following sequence is $1$. It is followed by two $1$'s and two $2$'s. This is followed by three $1$'s, three $2$'s, and three $3$'s. The sequence continues in this fashion.
\[1,1,1,2,2,1,1,1,2,2,2,3,3,3,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,\dots.\]
Find the $2014$th number in this sequence.
How many solutions does
\[
x^2 - [x^2] = \left(x - [x]\right)^2
\]
have satisfying $1 \leq x \leq n$?
Prove that $\lfloor{\sqrt{9n+7}}\rfloor=\lfloor{\sqrt{n}+\sqrt{n+1}+\sqrt{n+2}}\rfloor$ for all postive integer $n$.
Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?
Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$.
[i]Evan O' Dorney.[/i]
Consider the sequence $(a_n)_{n\ge 1}$ defined by $a_n=n$ for $n\in \{1,2,3.4,5,6\}$, and for $n \ge 7$: $$a_n={\lfloor}\frac{a_1+a_2+...+a_{n-1}}{2}{\rfloor}$$
where ${\lfloor}x{\rfloor}$ is the greatest integer less than or equal to $x$. For example : ${\lfloor}2.4{\rfloor} = 2, {\lfloor}3{\rfloor} = 3$ and ${\lfloor}\pi {\rfloor}= 3$.
For all integers $n \ge 2$, let $S_n = \{a_1,a_1,...,a_n\}- \{r_n\}$ where $r_n$ is the remainder when $a_1 + a_2 + ... + a_n$ is divided by $3$. The minus $-$ denotes the ''[i]remove it if it is there[/i]'' notation. For example : $S_4 = {2,3,4}$ because $r_4= 1$ so $1$ is removed from $\{1,2,3,4\}$. However $S_5= \{1,2,3,4,5\}$ betawe $r_5 = 0$ and $0$ is not in the set $\{1,2,3,4,5\}$.
1. Determine $S_7,S_8,S_9$ and $S_{10}$.
2. We say that a set $S_n$ for $n\ge 6$ is well-balanced if it can be partitioned into three pairwise disjoint subsets with equal sum. For example : $S_6 = \{1,2,3,4,5,6\} =\{1,6\}\cup \{2,5\}\cup \{3,4\}$ and $1 +6 = 2 + 5 = 3 + 4$. Prove that $S_7,S_8,S_9$ and $S_{10}$ are well-balanced .
3. Is the set $S_{2019}$ well-balanced? Justify your answer.
Let $r$ be a positive real number. Denote by $[r]$ the integer part of $r$ and by $\{r\}$ the fractional part of $r$. For example, if $r=32.86$, then $\{r\}=0.86$ and $[r]=32$. What is the sum of all positive numbers $r$ satisfying $25\{r\}+[r]=125$?
For a real number $ a$, let $ \lfloor a \rfloor$ denominate the greatest integer less than or equal to $ a$. Let $ \mathcal{R}$ denote the region in the coordinate plane consisting of points $ (x,y)$ such that \[\lfloor x \rfloor ^2 \plus{} \lfloor y \rfloor ^2 \equal{} 25.\] The region $ \mathcal{R}$ is completely contained in a disk of radius $ r$ (a disk is the union of a circle and its interior). The minimum value of $ r$ can be written as $ \tfrac {\sqrt {m}}{n}$, where $ m$ and $ n$ are integers and $ m$ is not divisible by the square of any prime. Find $ m \plus{} n$.
What is the largest integer less than or equal to $4x^3 - 3x$, where $x=\frac{\sqrt[3]{2+\sqrt3}+\sqrt[3]{2-\sqrt3}}{2}$ ?
(A) $1$, (B) $2$, (C) $3$, (D) $4$, (E) None of the above.
Let $a$ and $n$ be two positive integer numbers such that the (positive) prime factors of $a$ be all greater than $n$.
Prove that $n!$ divides $(a - 1)(a^2 - 1)\cdots (a^{n-1} - 1)$.
[i]AMM Magazine[/i]
33 friends are collecting stickers for a 2011-sticker album. A distribution of stickers among the 33 friends is incomplete when there is a sticker that no friend has. Determine the least $m$ with the following property: every distribution of stickers among the 33 friends such that, for any two friends, there are at least $m$ stickers both don't have, is incomplete.
Let the sequence $ a(n), n \equal{} 1,2,3, \ldots$ be generated as follows with $ a(1) \equal{} 0,$ and for $ n > 1:$
\[ a(n) \equal{} a\left( \left \lfloor \frac{n}{2} \right \rfloor \right) \plus{} (\minus{}1)^{\frac{n(n\plus{}1)}{2}}.\]
1.) Determine the maximum and minimum value of $ a(n)$ over $ n \leq 1996$ and find all $ n \leq 1996$ for which these extreme values are attained.
2.) How many terms $ a(n), n \leq 1996,$ are equal to 0?
Determine all real numbers $x$ satisfying $$x \lfloor x \lfloor x \rfloor \rfloor =\sqrt2.$$
Find all positive integers $n$ for which there exists a polynomial $P(x) \in \mathbb{Z}[x]$ such that for every positive integer $m\geq 1$, the numbers $P^m(1), \ldots, P^m(n)$ leave exactly $\lceil n/2^m\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.)
[i]Proposed by Carl Schildkraut, USA[/i]
Let $k \in \mathbb{N},$ $S_k = \{(a, b) | a, b = 1, 2, \ldots, k \}.$ Any two elements $(a, b)$, $(c, d)$ $\in S_k$ are called "undistinguishing" in $S_k$ if $a - c \equiv 0$ or $\pm 1 \pmod{k}$ and $b - d \equiv 0$ or $\pm 1 \pmod{k}$; otherwise, we call them "distinguishing". For example, $(1, 1)$ and $(2, 5)$ are undistinguishing in $S_5$. Considering the subset $A$ of $S_k$ such that the elements of $A$ are pairwise distinguishing. Let $r_k$ be the maximum possible number of elements of $A$.
(i) Find $r_5$.
(ii) Find $r_7$.
(iii) Find $r_k$ for $k \in \mathbb{N}$.
Lines $l$ and $m$ are perpendicular. Line $l$ partitions a convex polygon into two parts of equal area, and partitions the projection of the polygon onto $m$ into two line segments of length $a$ and $b$ respectively. Determine the maximum value of $\left\lfloor \frac{1000a}{b} \right\rfloor$. (The floor notation $\lfloor x \rfloor$ denotes largest integer not exceeding $x$)
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.
How many positive integers $ N$ less than $ 1000$ are there such that the equation $ x^{\lfloor x\rfloor} \equal{} N$ has a solution for $ x$? (The notation $ \lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $ x$.)
Let $d$ be a positive integer. Define the sequence $a_1, a_2, a_3, \dots$ such that \[\begin{cases} a_1 = 1 \\ a_{n+1} = n\left\lfloor\frac{a_n}{n}\right\rfloor + d, \quad n \ge 1.\end{cases}\] Prove that there exists a positive integer $M$ such that $a_M, a_{M+1}, a_{M+2}, \dots$ is an arithmetic sequence.
For how many integers $N$ between $1$ and $1990$ is the improper fraction $\frac{N^2+7}{N+4}$ not in lowest terms?
$\text{(A)} \ 0 \qquad \text{(B)} \ 86 \qquad \text{(C)} \ 90 \qquad \text{(D)} \ 104 \qquad \text{(E)} \ 105$
A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles.
[i]Calvin Deng.[/i]
Solve the equation $\left[\frac{x}{3}\right]+\left [\frac{2x}{3}\right]=x $
Solve in the real numbers the equation $ \lfloor ax \rfloor -\lfloor (1+a)x \rfloor = (1+a)(1-x) . $
[i]Dumitru Acu[/i]
Find necessary and sufficient conditions on positive integers $m$ and $n$ so that \[\sum_{i=0}^{mn-1}(-1)^{\lfloor i/m\rfloor+\lfloor i/n\rfloor}=0.\]
Assume $x_{1},x_{2},\dots,x_{n}\in\mathbb R^{+}$, $\sum_{i=1}^{n}x_{i}^{2}=n$, $\sum_{i=1}^{n}x_{i}\geq s>0$ and $0\leq\lambda\leq1$. Prove that at least $\left\lceil\frac{s^{2}(1-\lambda)^{2}}n\right\rceil$ of these numbers are larger than $\frac{\lambda s}{n}$.