Found problems: 1340
Show that, for every positive integer $n$, there exist $n$ consecutive positive integers such that none is divisible by the sum of its digits.
(Alternative Formulation: Call a number good if it's not divisible by the sum of its digits. Show that for every positive integer $n$ there are $n$ consecutive good numbers.)
An integer is square-free if it is not divisible by $a^2$ for any integer $a>1$. Let $S$ be the set of positive square-free integers. Determine, with justification, the value of\[\sum_{k\epsilon S}\left[\sqrt{\frac{10^{10}}{k}}\right]\]where $[x]$ denote the greatest integer less than or equal to $x$
$a)$ Let $n$ a positive integer. Prove that $gcd(n, \lfloor n\sqrt{2} \rfloor)<\sqrt[4]{8}\sqrt{n}$.
$b)$ Prove that there are infinitely many positive integers $n$ such that $gcd(n, \lfloor n\sqrt{2} \rfloor)>\sqrt[4]{7.99}\sqrt{n}$.
Find all real numbers $\alpha$ for which the equality \[\lfloor \sqrt{n}+\sqrt{n+\alpha}\rfloor =\lfloor \sqrt{4n+1}\rfloor\] holds for all positive integers $n$.
Find $k$ where $2^k$ is the largest power of $2$ that divides the product \[2008\cdot 2009\cdot 2010\cdots 4014.\]
Let $N$ be the number of positive integers that are less than or equal to 2003 and whose base-2 representation has more 1's than 0's. Find the remainder when $N$ is divided by 1000.
Let $S$ be the set of all rational numbers $r$, $0<r<1$, that have a repeating decimal expansion in the form \[0.abcabcabc\ldots=0.\overline{abc},\] where the digits $a$, $b$, and $c$ are not necessarily distinct. To write the elements of $S$ as fractions in lowest terms, how many different numerators are required?
What is the sum of the positive solutions to $2x^2 -\lfloor x \rfloor = 5$, where $\lfloor x \rfloor$ is the largest integer less than or equal to $x$?
The graph of the equation $9x+223y=2007$ is drawn on graph paper with each square representing one unit in each direction. How many of the $1$ by $1$ graph paper squares have interiors lying entirely below the graph and entirely in the first quadrant?
In a village with at least one inhabitant, there are several associations. Each inhabitant is a member of at least $ k$ associations, and any two associations have at most one common member.
Prove that at least $ k$ associations have the same number of members.
Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.
For a positive integer $a$, define a sequence of integers $x_1,x_2,\ldots$ by letting $x_1=a$ and $x_{n+1}=2x_n+1$ for $n\geq 1$. Let $y_n=2^{x_n}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_1,\ldots,y_k$ are all prime.
Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$.
[i]Proposed by Lewis Chen[/i]
At a circular track, $10$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $25$ meetings.
Let $n$ be a positive integer, and let $p$ be a prime, such that $n>p$.
Prove that :
\[ \displaystyle \binom np \equiv \left\lfloor\frac{n}{p}\right\rfloor \ \pmod p. \]
Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours.
[i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]
Find the largest positive integer $N$ so that the number of integers in the set $\{1,2,\dots,N\}$ which are divisible by 3 is equal to the number of integers which are divisible by 5 or 7 (or both).
For any real number $t$, denote by $[t]$ the greatest integer which is less than or equal to $t$. For example: $[8] = 8$, $[\pi] = 3$, and $[-5/2] = -3$. Show that the equation
\[[x] + [2x] + [4x] + [8x] + [16x] + [32x] = 12345\]
has no real solution.
Evaluate the sum $\left\lfloor\log_21\right\rfloor+\left\lfloor\log_22\right\rfloor+\left\lfloor\log_23\right\rfloor+\ldots+\left\lfloor\log_2256\right\rfloor$.
Find a nonzero polynomial $P(x,y)$ such that $P(\lfloor a\rfloor,\lfloor 2a\rfloor)=0$ for all real numbers $a.$
(Note: $\lfloor v\rfloor$ is the greatest integer less than or equal to $v.$)
Find an integral solution of the equation
\[ \left \lfloor \frac{x}{1!} \right \rfloor + \left \lfloor \frac{x}{2!} \right \rfloor + \left \lfloor \frac{x}{3!} \right \rfloor + \dots + \left \lfloor \frac{x}{10!} \right \rfloor = 2019. \]
(Note $\lfloor u \rfloor$ stands for the greatest integer less than or equal to $u$.)
Some of $n$ towns are connected by two-way airlines. There are $m$ airlines in total. For $i = 1, 2, \cdots, n$, let $d_i$ be the number of airlines going from town $i$. If $1\le d_i \le 2010$ for each $i = 1, 2,\cdots, 2010$, prove that
\[\displaystyle\sum_{i=1}^n d_i^2\le 4022m- 2010n\]
Find all $n$ for which equality can be attained.
[i]Proposed by Aleksandar Ilic[/i]
Given a positive integer $n$, we say that a polynomial $P$ with real coefficients is $n$-pretty if the equation $P(\lfloor x \rfloor)=\lfloor P(x) \rfloor$ has exactly $n$ real solutions. Show that for each positive integer $n$
[list=a]
[*] there exists an n-pretty polynomial;
[*] any $n$-pretty polynomial has a degree of at least $\tfrac{2n+1}{3}$.
[/list]
([i]Remark.[/i] For a real number $x$, we denote by $\lfloor x \rfloor$ the largest integer smaller than or equal to $x$.)
For every positive integer $k$ let $a(k)$ be the largest integer such that $2^{a(k)}$ divides $k$. For every positive integer $n$ determine $a(1)+a(2)+\cdots+a(2^n)$.
A rectangular table $ 9$ rows $ \times$ $ 2008$ columns is fulfilled with numbers $ 1$, $ 2$, ...,$ 2008$ in a such way that each number appears exactly $ 9$ times in table and difference between any two numbers from same column is not greater than $ 3$. What is maximum value of minimum sum in column (with minimal sum)?