Found problems: 54
Determine all odd natural numbers of the form $$\frac{p + q}{p - q},$$ where $p > q$ are prime numbers.
Let a real function $f$ defined on the real numbers satisfy the following conditions:
(i) $f(10+x) = f(10- x)$
(ii) $f(20+x) = - f(20- x)$
for all $x$. Prove that f is odd and periodic.
Show that there are infinitely many positive integers $n$ such that the number of distinct odd prime factors of $n(n + 3)$ is a multiple of $3$.
(For instance, $180 = 2^2 \cdot 3^2 \cdot 5$ has two distinct odd prime factors and $840 = 2^3 \cdot 3 \cdot 5 \cdot 7$ has three.)
a) Suppose that $n$ is an odd integer. Prove that $k(n-k)$ is divisible by $2$ for all positive integers $k$.
b) Find an integer $k$ such that $k(100-k)$ is not divisible by $11$.
c) Suppose that $p$ is an odd prime, and $n$ is an integer.
Prove that there is an integer $k$ such that $k(n-k)$ is not divisible by $p$.
d) Suppose that $p,q$ are two different odd primes, and $n$ is an integer.
Prove that there is an integer $k$ such that $k(n-k)$ is not divisible by any of $p,q$.
Let $a$ and $b$ be positive integers such that the number $b^2 + (b +1)^2 +...+ (b + a)^2-3$ is multiple of $5$ and $a + b$ is odd. Calculate the digit of the units of the number $a + b$ written in decimal notation.
Given $\lambda^3 - 2\lambda^2- 1 = 0$ for some real $\lambda$ prove that $[\lambda[\lambda[\lambda n]]] - n$ is odd for any positive integer $n$ .
(I Voronovich)
Show that any odd number can be written as the difference between two perfect squares.
Prove that the number $n^n-n$ is divisible by $24$ for any odd integer $n$.
Find the smallest odd natural number $N$ such that $N^2$ is the sum of an odd number (greater than $1$) of squares of adjacent positive integers.
Let $A$ and $B$ be integers with an odd sum. Show that every integer can be written in the form $x^2 -y^2 +Ax+By$, where $x,y$ are integers.
Find all odd natural numbers $n$ such that $d(n)$ is the largest divisor of the number $n$ different from $n$.
($d(n)$ is the number of divisors of the number n including $1$ and $n$ ).
Let $a, b$ be two positive integers such that $b + 1|a^2 + 1$,$ a + 1|b^2 + 1$. Prove that $a, b$ are odd numbers.
Let $a$ be a positive integer such that the number $a^n$ has an odd number of digits in the decimal representation for all $n > 0$. Prove that the number $a$ is an even power of $10$.
Prove that for any odd number $a$ there exists an integer $b$ such that $2^b-1$ is divisible by $a$.
Given two closed broken lines in the plane with odd numbers of edges. All the lines, containing those edges are different, and not a triple of them intersects in one point. Prove that it is possible to chose one edge from each line such, that the chosen edges will be the opposite sides of a convex quadrangle.
For a non-empty set $T$ denote by $p(T)$ the product of all elements of $T$. Does there exist a set $T$ of $2021$ elements such that for any $a\in T$ one has that $P(T)-a$ is an odd integer? Consider two cases:
1) All elements of $T$ are irrational numbers.
2) At least one element of $T$ is a rational number.
Prove that any integer $n$ satisfying the inequality $n <(44 + \sqrt{1975})^100 <n + 1$ is odd.
Let us put pieces on some squares of $2n \times 2n$ chessboard in such a way that on every horizontal and vertical line there is an odd number of pieces. Prove that the whole number of pieces on the black squares is even.
Prove that for any positive even integer $n$ larger than $38$, $n$ can be written as $a\times b+c\times d$ where $a, b, c, d$ are odd integers larger than $1$.
The circle contains a closed $100$-part broken line, such that no three segments pass through one point. All its corners are obtuse, and their sum in degrees is divided by $720$. Prove that this broken line has an odd number of self-intersection points.
Prove that the ratio $$\frac{1^1 + 3^3 + 5^5 + ...+ (2^{2013} - 1)^{(2^{2013} - 1)}}{2^{2013}}$$ is an odd integer.
For a positive integer $n$ that is not a power of two, we de fine $t(n)$ as the greatest odd divisor of $n$ and $r(n)$ as the smallest positive odd divisor of $n$ unequal to $1$. Determine all positive integers $n$ that are not a power of two and for which we have $n = 3t(n) + 5r(n)$.
Peter and Paul gamble as follows. For each natural number, successively, they determine its largest odd divisor and compute its remainder when divided by $4$. If this remainder is $1$, then Peter gives Paul a coin; otherwise, Paul
gives Peter a coin. After some time they stop playing and balance the accounts. Prove that Paul wins.
Let $n$ be a positive integer and $(x_1, x_2, ..., x_{2n})$, $x_i = 0$ or $1, i = 1, 2, ... , 2n$ be a sequence of $2n$ integers. Let $S_n$ be the sum $S_n = x_1x_2 + x_3x_4 + ... + x_{2n-1}x_{2n}$.
If $O_n$ is the number of sequences such that $S_n$ is odd and $E_n$ is the number of sequences such that $S_n$ is even, prove that $$\frac{O_n}{E_n}=\frac{2^n - 1}{2^n + 1}$$
Given natural number $a>1$ and different odd prime numbers $p_1,p_2,...,p_n$ with
$a^{p_1}\equiv 1$ (mod $p_2$), $a^{p_2}\equiv 1$ (mod $p_3$), ..., $a^{p_n}\equiv 1$(mod $p_1$).
Prove that
a) $(a-1)\vdots p_i$ for some $i=1,..,n$
b) Can $(a-1)$ be divisible by $p_i $for exactly one $i$ of $i=1,...,n$?
I. Bliznets