Found problems: 1187
What is the enclosed area between the graph of $y=\lfloor 10x \rfloor + \sqrt{1-x^2}$ in the interval $[0,1]$ and the $x$ axis?
Let $ p$ be a prime number with $ p>5$. Consider the set $ X \equal{} \left\{p \minus{} n^2 \mid n\in \mathbb{N} ,\ n^2 < p\right\}$.
Prove that the set $ X$ has two distinct elements $ x$ and $ y$ such that $ x\neq 1$ and $ x\mid y$.
[i]Albania[/i]
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?
Find the remainder modulo $101$ of
$$\left\lfloor \dfrac{1}{(2 \cos \left(\frac{4\pi}{7} \right))^{103}}\right\rfloor$$
Determine the maximum integer $ n $ such that for each positive integer $ k \le \frac{n}{2} $ there are two positive divisors of $ n $ with difference $ k $.
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.
Describe which positive integers do not belong to the set
\[E = \left\{ \lfloor n+ \sqrt n +\frac 12 \rfloor | n \in \mathbb N\right\}.\]
The sequence $a_i$ is defined as $a_1 = 1$ and
\[a_n = a_{\left\lfloor \dfrac{n}{2} \right\rfloor} + a_{\left\lfloor \dfrac{n}{3} \right\rfloor} + a_{\left\lfloor \dfrac{n}{4} \right\rfloor} + \cdots + a_{\left\lfloor \dfrac{n}{n} \right\rfloor} + 1\]
for every positive integer $n > 1$. Prove that there are infinitely many values of $n$ such that $a_n \equiv n \mod 2012$.
Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$
Define $\lfloor x \rfloor$ as the largest integer less than or equal to $x$. Define $\{x \} = x - \lfloor x \rfloor$. For example, $\{ 3 \} = 3-3 = 0$, $\{ \pi \} = \pi - 3$, and $\{ - \pi \} = 4-\pi$. If $\{n\} + \{ 3n\} = 1.4$, then find the sum of all possible values of $100\{n\}$.
[i]Proposed by Isabella Grabski
[/i]
For any real number $ x$ prove that:
\[ x\in \mathbb{Z}\Leftrightarrow \lfloor x\rfloor \plus{}\lfloor 2x\rfloor\plus{}\lfloor 3x\rfloor\plus{}...\plus{}\lfloor nx\rfloor\equal{}\frac{n(\lfloor x\rfloor\plus{}\lfloor nx\rfloor)}{2}\ ,\ (\forall)n\in \mathbb{N}^*\]
Let $n\geq 2$ be an integer. Let us call [i]interval[/i] a subset $A \subseteq \{1,2,\ldots,n\}$ for which integers $1\leq a < b\leq n$ do exist, such that $A = \{a,a+1,\ldots,b-1,b\}$. Let a family $\mathcal{A}$ of subsets $A_i \subseteq \{1,2,\ldots,n\}$, with $1\leq i \leq N$, be such that for any $1\leq i < j \leq N$ we have $A_i \cap A_j$ being an interval.
Prove that $\displaystyle N \leq \left \lfloor n^2/4 \right \rfloor$, and that this bound is sharp.
(Dan Schwarz - after an idea by Ron Graham)
What is the least positive integer $n$ such that $n!$ is a multiple of $2012^{2012}$?
The sequence $a_i$ is defined as $a_1 = 1$ and
\[a_n = a_{\left\lfloor \dfrac{n}{2} \right\rfloor} + a_{\left\lfloor \dfrac{n}{3} \right\rfloor} + a_{\left\lfloor \dfrac{n}{4} \right\rfloor} + \cdots + a_{\left\lfloor \dfrac{n}{n} \right\rfloor} + 1\]
for every positive integer $n > 1$. Prove that there are infinitely many values of $n$ such that $a_n \equiv n \mod 2012$.
Find the positive integer $n$ that satisfi es the equation $$n^2 - \lfloor \sqrt{n} \rfloor = 2018$$
Prove that if $c > \dfrac{8}{3}$, then there exists a real number $\theta$ such that $\lfloor\theta^{c^n}\rfloor$ is prime for every positive integer $n$.
Let the three sides of a triangle be $\ell, m, n$, respectively, satisfying $\ell>m>n$ and $\left\{\frac{3^\ell}{10^4}\right\}=\left\{\frac{3^m}{10^4}\right\}=\left\{\frac{3^n}{10^4}\right\}$, where $\{x\}=x-\lfloor{x}\rfloor$ and $\lfloor{x}\rfloor$ denotes the integral part of the number $x$. Find the minimum perimeter of such a triangle.
We define an operation $\oplus$ on the set $\{0, 1\}$ by
\[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\]
For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$.
For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.
It is known that a certain mechanical balance can measure any object of integer mass anywhere between 1 and 2009 (both included). This balance has $k$ weights of integral values. What is the minimum $k$ for which there exist weights that satisfy this condition?
Find a constant $ c > 1$ with the property that, for arbitrary positive integers $ n$ and $ k$ such that $ n>c^k$, the number of distinct prime factors of $ \binom{n}{k}$ is at least $ k$.
[i]P. Erdos[/i]
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)?
For a finite set $E$ of cardinality $n \geq 3$, let $f(n)$ denote the maximum number of $3$-element subsets of $E$, any two of them having exactly one common element. Calculate $f(n)$.
Let $m$ and $n$ be odd positive integers. Each square of an $m$ by $n$ board is coloured red or blue. A row is said to be red-dominated if there are more red squares than blue squares in the row. A column is said to be blue-dominated if there are more blue squares than red squares in the column. Determine the maximum possible value of the number of red-dominated rows plus the number of blue-dominated columns. Express your answer in terms of $m$ and $n$.
let $x,y,z$ be positive reals , such that $x+y+z=1399$ find the
$$\max( [x]y + [y]z + [z]x ) $$
( $[a]$ is the biggest integer not exceeding $a$)
Determine the number of distinct positive real solutions to $$\lfloor x \rfloor ^{\{x\}} = \frac{1}{2022}x^2$$
.
Note: $\lfloor x \rfloor$ is known as the floor function, which returns the greatest integer less than or equal to $x$. Furthermore, $\{x\}$ is defined as $x - \lfloor x \rfloor$.