Found problems: 1187
Find the sum of all $\left\lfloor x\right\rfloor$ such that $x^2-15\left\lfloor x\right\rfloor+36=0$.
$\text{(A) }15\qquad\text{(B) }26\qquad\text{(C) }45\qquad\text{(D) }49\qquad\text{(E) }75$
Let $p$ be a prime such that $p \equiv 1 (\text {mod}4)$. Evaluate
\[\sum_{k=1}^{p-1} \left( \left \lfloor \frac{2k^2}{p}\right \rfloor - 2 \left \lfloor {\frac{k^2}{p}}\right \rfloor \right)\]
A shepherd left, as an inheritance, to his children a flock of $k$ sheep, distributed as follows: the oldest received $\left\lfloor\frac{k}{2}\right\rfloor$ sheep, the middle one $\left\lfloor\frac{k}{3}\right\rfloor$ sheep and the youngest $\left\lfloor\frac{k}{5}\right\rfloor$ sheep. Knowing that there are no sheep left, determine all possible values for $k$.
Prove that $\prod\limits_{k=0}^{n-1}{({{2}^{n}}-{{2}^{k}})}$ is divisible by $n!$ for all positive integers $n$.
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
Determine all functions $f:[0,\infty)\rightarrow\mathbb{R}$ such that $f(0)=0$ and \[f(x)=1+5f\left(\left\lfloor{\frac{x}{2}\right\rfloor}\right)-6f\left(\left\lfloor{\frac{x}{4}\right\rfloor}\right)\] for all $x>0$.
Let $P(x)=x^2-3x-9$. A real number $x$ is chosen at random from the interval $5\leq x \leq 15$. The probability that $\lfloor \sqrt{P(x)} \rfloor = \sqrt{P(\lfloor x \rfloor )}$ is equal to $\dfrac{\sqrt{a}+\sqrt{b}+\sqrt{c}-d}{e}$, where $a,b,c,d$ and $e$ are positive integers and none of $a,b,$ or $c$ is divisible by the square of a prime. Find $a+b+c+d+e$.
Show that for every $n\in\mathbb{N}$, $n\sqrt{2}-\lfloor n\sqrt{2}\rfloor>\frac{1}{2n \sqrt{2}}$ and that for every $\epsilon >0$, there exists an $n\in\mathbb{N}$ such that $ n\sqrt{2}-\lfloor n\sqrt{2}\rfloor < \frac{1}{2n \sqrt{2}}+\epsilon$.
Suppose the sequence of nonnegative integers $a_1, a_2, \ldots, a_{1997}$ satisfies
\[ a_i + a_j \leq a_{i+j} \leq a_i + a_j + 1 \]
for all $i,j \geq 1$ with $i + j \leq 1997$. Show that there exists a real number $x$ such that $a_n = \lfloor nx \rfloor$ (the greatest integer $\leq nx$) for all $1 \leq n \leq 1997$.
If $a,b,c>0$, what is the smallest possible value of $ \left\lfloor \dfrac {a+b}{c} \right\rfloor + \left\lfloor \dfrac {b+c}{a} \right\rfloor + \left\lfloor \dfrac {c+a}{b} \right\rfloor $? (Note that $ \lfloor x \rfloor $ denotes the greatest integer less than or equal to $x$.)
Let $n\geq2$ be a positive integer. Determine all possible values of the sum
\[ S=\left\lfloor x_{2}-x_{1}\right\rfloor +\left\lfloor x_{3}-x_{2}\right\rfloor+...+\left\lfloor x_{n}-x_{n-1}\right\rfloor \]
where $x_i\in \mathbb{R}$ satisfying $\lfloor{x_i}\rfloor=i$ for $i=1,2,\ldots n$.
For a positive real number $\alpha$, define \[S(\alpha)=\{ \lfloor n\alpha\rfloor \; \vert \; n=1,2,3,\cdots \}.\] Prove that $\mathbb{N}$ cannot be expressed as the disjoint union of three sets $S(\alpha)$, $S(\beta)$, and $S(\gamma)$.
Find all non-integers $x$ such that $x+\frac{13}{x}=[x]+\frac{13}{[x]} . $where$[x]$ mean the greatest integer $n$ , where $n\leq x.$
Let $P$ be the number of ways to partition $2013$ into an ordered tuple of prime numbers. What is $\log_2 (P)$? If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor\frac{125}2\left(\min\left(\frac CA,\frac AC\right)-\frac35\right)\right\rfloor$ or zero, whichever is larger.
Find the largest natural number $ n$ for which there exist different sets $ S_1,S_2,\ldots,S_n$ such that:
$ 1^\circ$ $ |S_i\cup S_j|\leq 2004$ for each two $ 1\leq i,j\le n$ and
$ 2^\circ$ $ S_i\cup S_j\cup S_k\equal{}\{1,2,\ldots,2008\}$ for each three integers $ 1\le i<j<k\le n$.
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?
Let $c$ be a fixed positive integer, and $\{x_k\}^{\inf}_{k=1}$ be a sequence such
that $x_1=c$ and
$x_n=x_{n-1}+\lfloor \frac{2x_{n-1}-2}{n} \rfloor$
for $n \ge 2$. Determine the explicit formula of $x_n$ in terms of $n$ and $c$.
(Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.)
Let $-2 < x_1 < 2$ be a real number and define $x_2, x_3, \ldots$ by $x_{n+1} = x_n^2-2$ for $n \geq 1$. Assume that no $x_n$ is $0$ and define a number $A$, $0 \leq A \leq 1$ in the following way: The $n^{\text{th}}$ digit after the decimal point in the binary representation of $A$ is a $0$ if $x_1x_2\cdots x_n$ is positive and $1$ otherwise. Prove that $A = \frac{1}{\pi}\cos^{-1}\left(\frac{x_1}{2}\right)$.
[i]Evan O' Dorney.[/i]
Given a positive integer $ n>3$, prove that the least common multiple of the products $ x_1x_2\cdots x_k$ ($ k\geq 1$) whose factors $ x_i$ are positive integers with $ x_1\plus{}x_2\plus{}\cdots\plus{}x_k\le n$, is less than $ n!$.
Let $ k$ be a positive integer. Prove that there exist polynomials $ P_0(n),P_1(n),\dots,P_{k\minus{}1}(n)$ (which may depend on $ k$) such that for any integer $ n,$
\[ \left\lfloor\frac{n}{k}\right\rfloor^k\equal{}P_0(n)\plus{}P_1(n)\left\lfloor\frac{n}{k}\right\rfloor\plus{} \cdots\plus{}P_{k\minus{}1}(n)\left\lfloor\frac{n}{k}\right\rfloor^{k\minus{}1}.\]
($ \lfloor a\rfloor$ means the largest integer $ \le a.$)
Let $c$ be a positive integer. Consider the sequence $x_1,x_2,\ldots$ which satisfies $x_1=c$ and, for $n\ge 2$,
\[x_n=x_{n-1}+\left\lfloor\frac{2x_{n-1}-(n+2)}{n}\right\rfloor+1\]
where $\lfloor x\rfloor$ denotes the largest integer not greater than $x$. Determine an expression for $x_n$ in terms of $n$ and $c$.
[i]Huang Yumin[/i]
The sequence $\{a_n\}_{n\ge 1}$ of real numbers is defined as follows:
$$a_1=1, \quad \text{and}\quad a_{n+1}=\frac{1}{2\lfloor a_n \rfloor -a_n+1} \quad \text{for all} \quad n\ge 1$$
Find $a_{2024}$.
Find a function $f(x)$ defined for all real values of $x$ such that for all $x$,
\[f(x+ 2) - f(x) = x^2 + 2x + 4,\]
and if $x \in [0, 2)$, then $f(x) = x^2.$
Let $a, b, c$, and $d$ be real numbers. Suppose that $\lfloor na\rfloor +\lfloor nb\rfloor =\lfloor nc\rfloor +\lfloor nd\rfloor $ for all positive integers $n$. Show that at least one of $a+b$, $a-c$, $a-d$ is an integer.
For a positive number such as 3.27, 3 is referred to as the integral part of the number and .27 as the decimal part. Find a positive number such that its decimal part, its integral part, and the number itself form a geometric progression.