Found problems: 526
For any $h = 2^{r}$ ($r$ is a non-negative integer), find all $k \in \mathbb{N}$ which satisfy the following condition: There exists an odd natural number $m > 1$ and $n \in \mathbb{N}$, such that $k \mid m^{h} - 1, m \mid n^{\frac{m^{h}-1}{k}} + 1$.
Given a natural $n>1$ and its prime fatorization $n=p_1^{\alpha 1}p_2^{\alpha_2} \cdots p_k^{\alpha_k}$, its [i]false derived[/i] is defined by $$f(n)=\alpha_1p_1^{\alpha_1-1}\alpha_2p_2^{\alpha_2-1}...\alpha_kp_k^{\alpha_k-1}.$$ Prove that there exist infinitely many naturals $n$ such that $f(n)=f(n-1)+1$.
Does there exist $2017$ consecutive positive integers, none of which could be written as $a^2 + b^2$ for some integers $a, b$? Justify your answer.
Does there exist a strictly increasing sequence $\{a_n\}_{n=1}^\infty$ of natural numbers with the following property: for $\forall$ $c\in \mathbb{Z}$ the sequence $c+a_1,c+a_2,...,c+a_n...$ has finite number of primes? Explain your answer.
In Mathcity, there are infinitely many buses and infinitely many stations. The stations are indexed by the powers of $2: 1, 2, 4, 8, 16, ...$ Each bus goes by finitely many stations, and the bus number is the sum of all the stations it goes by. For simplifications, the mayor of Mathcity wishes that the bus numbers form an arithmetic progression with common difference $r$ and whose first term is the favourite number of the mayor. For which positive integers $r$ is it always possible that, no matter the favourite number of the mayor, given any $m$ stations, there is a bus going by all of them?
Proposed by [i]Savinien Kreczman and Martin Rakovsky, France[/i]
Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that
$$f(x + f(y)) = f(x) + f(y)$$
for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.
Find all polynomials $W$ with integer coefficients satisfying the following condition: For every natural number $n, 2^n - 1$ is divisible by $W(n).$
$a$ and $b$ are given positive integers. Prove that there are infinitely many positive integers $n$ such that $n^b+1$ doesn't divide $a^n+1$.
Let $P_1, \ldots , P_s$ be arithmetic progressions of integers, the following conditions being satisfied:
[b](i)[/b] each integer belongs to at least one of them;
[b](ii)[/b] each progression contains a number which does not belong to other progressions.
Denote by $n$ the least common multiple of the ratios of these progressions; let $n=p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ its prime factorization.
Prove that \[s \geq 1 + \sum^k_{i=1} \alpha_i (p_i - 1).\]
[i]Proposed by Dierk Schleicher, Germany[/i]
Let $R$ be a commutative ring with 1. Prove that $R[x]$ has infinitely many maximal ideals.
Find all polynomials $ p$ of one variable with integer coefficients such that if $ a$ and $ b$ are natural numbers such that $ a \plus{} b$ is a perfect square, then $ p\left(a\right) \plus{} p\left(b\right)$ is also a perfect square.
For a positive integer $p$, define the positive integer $n$ to be $p$-safe if $n$ differs in absolute value by more than $2$ from all multiples of $p$. For example, the set of $10$-safe numbers is $\{3, 4, 5, 6, 7, 13, 14, 15, 16, 17,23, \ldots \}$. Find the number of positive integers less than or equal to $10,000$ which are simultaneously $7$-safe, $11$-safe, and $13$-safe.·
Find the last digit of the number $$\frac{400!}{(200!)(2^{200})}$$
[i]2015 CCA Math Bonanza Lightning Round #2.3[/i]
Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$ over the integers for every $i$.
Suppose that $a_1,...,a_{15}$ are prime numbers forming an arithmetic progression with common difference $d > 0$ if $a_1 > 15$ show that $d > 30000$
Let $n$ be an odd integer and $m=\phi(n)$ be the Euler's totient function. Call a set of residues $T=\{a_1, \cdots, a_k\} \pmod n$ to be [i]good[/i] if $\gcd(a_i, n) > 1$ $\forall i$, and $\gcd(a_i, a_j) = 1, \forall i \neq j$. Define the set $S_n$ consisting of the residues $$\sum_{i=1}^k a_i ^m\pmod{n}$$ over all possible residue sets $T=\{a_1,\cdots,a_k\}$ that is good. Determine $|S_n|$.
[i]Proposed by Anzo Teh Zhao Yang[/i]
Let $A$ be an even number but not divisible by $10$. The last two digits of $A^{20}$ are:
(A): $46$, (B): $56$, (C): $66$, (D): $76$, (E): None of the above.
How many integer pairs $(x,y)$ are there such that \[0\leq x < 165, \quad 0\leq y < 165 \text{ and } y^2\equiv x^3+x \pmod {165}?\]
$
\textbf{(A)}\ 80
\qquad\textbf{(B)}\ 99
\qquad\textbf{(C)}\ 120
\qquad\textbf{(D)}\ 315
\qquad\textbf{(E)}\ \text{None of above}
$
Let $T_n$ denotes the least natural such that
$$n\mid 1+2+3+\cdots +T_n=\sum_{i=1}^{T_n} i$$
Find all naturals $m$ such that $m\ge T_m$.
[i]Proposed by Nicolás De la Hoz [/i]
For $ x \in (0, 1)$ let $ y \in (0, 1)$ be the number whose $ n$-th digit after the decimal point is the $ 2^{n}$-th digit after the decimal point of $ x$. Show that if $ x$ is rational then so is $ y$.
[i]Proposed by J.P. Grossman, Canada[/i]
The positive integers \( a \) and \( b \) are coprime and such that there exist positive integers \( m_2 \) and \( m_5 \) for which \( am_2 + b \) is a perfect square of a positive integer, and \( am_5 + b \) is a perfect fifth power of a positive integer. Does there always exist a positive integer \( n \) for which \( an + b \) is a perfect \( k \)-th power of a positive integer, if:
a) \( k = 7 \);
b) \( k = 10 \)?
Let $k, M$ be positive integers such that $k-1$ is not squarefree. Prove that there exist a positive real $\alpha$, such that $\lfloor \alpha\cdot k^n \rfloor$ and $M$ are coprime for any positive integer $n$.
There are $N$ permutations $(a_1,a_2,\dots,a_{30})$ of $1,2,\dots,30$ such that for $m\in\{2,3,5\}$, $m$ divides $a_{n+m}-a_n$ for all integers $n$ with $1\leq n <n+m\leq 30$. Find the remainder when $N$ is divided by 1000.
Does there exist a positive integer $ n$ such that $ n$ has exactly 2000 prime divisors and $ n$ divides $ 2^n \plus{} 1$?
Let $ b_1<b_2<b_3<\dots $ be the sequence of all natural numbers which are sum of squares of two natural numbers.
Prove that there exists infinite natural numbers like $m$ which $b_{m+1}-b_m=2015$ .