Found problems: 1340
For each positive integer n, let $ f(n) \equal{} \sum_{k \equal{} 1}^{100} \lfloor \log_{10} (kn) \rfloor$. Find the largest value of n for which $ f(n) \le 300$.
[b]Note:[/b] $ \lfloor x \rfloor$ is the greatest integer less than or equal to $ x$.
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where [x] denotes the smallest integer $\leq$ x)$.$
Let $a_1$, $a_2$, $a_3$, $a_4$, $a_5$ be real numbers whose sum is $20$. Determine with proof the smallest possible value of \[ \displaystyle\sum_{1\le i \le j \le 5} \lfloor a_i + a_j \rfloor. \]
Find all real numbers $x$ such that $\left\lfloor x^2 \right\rfloor + \left\lceil x^2 \right\rceil = 2003$.
Find all real solutions to the equation $4x^2 - 40 \lfloor x \rfloor + 51 = 0$.
Six circles form a ring with with each circle externally tangent to two circles adjacent to it. All circles are internally tangent to a circle $C$ with radius $30$. Let $K$ be the area of the region inside circle $C$ and outside of the six circles in the ring. Find $\lfloor K \rfloor$.
Prove that for any positive integer $m$, the equation
\[ \frac{n}{m}\equal{}\lfloor\sqrt[3]{n^2}\rfloor\plus{}\lfloor\sqrt{n}\rfloor\plus{}1\]
has (at least) a positive integer solution $n_{m}$.
[i]Cezar Lupu & Dan Schwarz[/i]
How many positive integers less that $200$ are relatively prime to either $15$ or $24$?
A convex pentagon $ABCDE$ satisfies that the sidelengths and $AC,AD\leq \sqrt 3.$ Let us choose $2011$ distinct points inside this pentagon. Prove that there exists an unit circle with centre on one edge of the pentagon, and which contains at least $403$ points out of the $2011$ given points.
{Edited}
{I posted it correctly before but because of a little confusion deleted the sidelength part, sorry.}
Let an integer $n > 1$ be given. In the space with orthogonal coordinate system $Oxyz$ we denote by $T$ the set of all points $(x, y, z)$ with $x, y, z$ are integers, satisfying the condition: $1 \leq x, y, z \leq n$. We paint all the points of $T$ in such a way that: if the point $A(x_0, y_0, z_0)$ is painted then points $B(x_1, y_1, z_1)$ for which $x_1 \leq x_0, y_1 \leq y_0$ and $z_1 \leq z_0$ could not be painted. Find the maximal number of points that we can paint in such a way the above mentioned condition is satisfied.
For any integer $n\ge 2$, let $N(n)$ be the maximum number of triples $(a_j,b_j,c_j),j=1,2,3,\cdots ,N(n),$ consisting of non-negative integers $a_j,b_j,c_j$ (not necessarily distinct) such that the following two conditions are satisfied:
(a) $a_j+b_j+c_j=n,$ for all $j=1,2,3,\cdots N(n)$;
(b) $j\neq k$, then $a_j\neq a_k$, $b_j\neq b_k$ and $c_j\neq c_k$.
Determine $N(n)$ for all $n\ge 2$.
Let $ t(n)$ for $ n \equal{} 3, 4, 5, \ldots,$ represent the number of distinct, incongruent, integer-sided triangles whose perimeter is $ n;$ e.g., $ t(3) \equal{} 1.$ Prove that
\[ t(2n\minus{}1) \minus{} t(2n) \equal{} \left[ \frac{6}{n} \right] \text{ or } \left[ \frac{6}{n} \plus{} 1 \right].\]
Nine distinct positive integers are arranged in a circle such that the product of any two non-adjacent numbers in the circle is a multiple of $n$ and the product of any two adjacent numbers in the circle is not a multiple of $n$, where $n$ is a fixed positive integer. Find the smallest possible value for $n$.
Determine all $n \in \mathbb{N}$ for which [list][*] $n$ is not the square of any integer, [*] $\lfloor \sqrt{n}\rfloor ^3$ divides $n^2$. [/list]
Let $n \geq 2$ be a positive integer. Consider the following equation: \[ \{x\}+\{2x\}+ \dots + \{nx\} = \lfloor x \rfloor + \lfloor 2x \rfloor + \dots + \lfloor 2nx \rfloor\]
a) For $n=2$, solve the given equation in $\mathbb{R}$.
b) Prove that, for any $n \geq 2$, the equation has at most $2$ real solutions.
In a store, there are 7 cases containing 128 apples altogether. Let $ N$ be the greatest number such that one can be certain to find a case with at least $ N$ apples. Then, the last digit of $ N$ is
$ \text{(A)}\ 0 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 5 \qquad \text{(D)}\ 7 \qquad \text{(E)}\ 9$
Let $ N $ be a positive integer. A set $ S \subset \{ 1, 2, \cdots, N \} $ is called [i]allowed[/i] if it does not contain three distinct elements $ a, b, c $ such that $ a $ divides $ b $ and $ b $ divides $c$. Determine the largest possible number of elements in an allowed set $ S $.
The 2010 positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\ldots a_{2010}$.
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
Find the set of all possible values of the expression $\lfloor m^2+\sqrt{2} n \rfloor$, where $m$ and $n$ are positive integers.
Note: The symbol $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$.
Determine the number of ordered pairs $(a,b)$ of integers such that $\log_a b + 6\log_b a=5$, $2 \leq a \leq 2005$, and $2 \leq b \leq 2005$.
Find all pairs $(a,b)$ of real numbers such that $\lfloor an + b \rfloor$ is a perfect square, for all positive integer $n$.
Solve in the set of real numbers the equation \[ 3x^3 \minus{} [x] \equal{} 3,\] where $ [x]$ denotes the integer part of $ x.$
Let u be a fixed positive integer. Prove that the equation $n! = u^{\alpha} - u^{\beta}$ has a finite number of solutions $(n, \alpha, \beta).$
Let $S$ be a finite set of positive integers which has the following property:if $x$ is a member of $S$,then so are all positive divisors of $x$. A non-empty subset $T$ of $S$ is [i]good[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is a power of a prime number. A non-empty subset $T$ of $S$ is [i]bad[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is not a power of a prime number. A set of an element is considered both [i]good[/i] and [i]bad[/i]. Let $k$ be the largest possible size of a [i]good[/i] subset of $S$. Prove that $k$ is also the smallest number of pairwise-disjoint [i]bad[/i] subsets whose union is $S$.