For any positive integer $n$, let $r_n$ denote the greatest odd divisor of $n$. Compute $T =r_{100}+ r_{101} + r_{102}+...+r_{200}$

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.

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.

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.

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$.

A sequence $a_1, a_2, a_3, \ldots $ is defined as follows: $a_1$ is a positive integer and $$a_{n+1} = \left\lfloor \frac{3}{2} a_n \right\rfloor +1$$ for all $n \in \mathbb{N}$. Can $a_1$ be chosen in such a way that the first $100000$ terms of the sequence are even, but the $100001$-th term is odd?

Prove that if $p$ is an odd prime, then $p^2(p^2 -1999)$ is divisible by $6$ but not by $12$.

Let $n$ be an odd positive integer bigger than $1$. Prove that $3^n+1$ is not divisible with $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.

Determine all even positive integers that can be written as the sum of odd composite positive integers.

To each three-digit number, Matías added the number obtained by inverting its digits. For example, he added $729$ to the number $927$. Calculate in how many cases the result of the sum of Matías is a number with all its digits odd.

Find a pair prime numbers $(p, q)$, $p> q$ of , if any, such that $\frac{p^2 - q^2}{4}$ is an odd integer.

Let $a^2_1+ a^2_2+ a^2_3+ a^2_4+ a^2_5= b^2$, where $a_1$, $a_2$, $a_3$, $a_4$, $a_5$, and $b$ are integers. Prove that not all of these numbers can be odd.

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.)

We consider the real sequence ($x_n$) defined by $x_0=0, x_1=1$ and $x_{n+2}=3x_{n+1}-2 x_{n}$ for $n=0,1,2,...$ We define the sequence ($y_n$) by $y_n=x^2_n+2^{n+2}$ for every nonnegative integer $n$. Prove that for every $n>0, y_n$ is the square of an odd integer.

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.

For positive integer $k$, let $p(k)$ denote the greatest odd divisor of $k$. Prove that for every positive integer $n$, $$\frac{2n}{3} < \frac{p(1)}{1}+ \frac{p(2)}{2}+... +\frac{ p(n)}{n}<\frac{2(n + 1)}{3}$$

a) Prove that there are infinitely many pairs $(m, n)$ of positive integers satisfying the following equality $[(4 + 2\sqrt3)m] = [(4 -2\sqrt3)n]$ b) Prove that if $(m, n)$ satisfies the equality, then the number $(n + m)$ is odd. (I. Voronovich)

A box contains answer $4032$ scripts out of which exactly half have odd number of marks. We choose 2 scripts randomly and, if the scores on both of them are odd number, we add one mark to one of them, put the script back in the box and keep the other script outside. If both scripts have even scores, we put back one of the scripts and keep the other outside. If there is one script with even score and the other with odd score, we put back the script with the odd score and keep the other script outside. After following this procedure a number of times, there are 3 scripts left among which there is at least one script each with odd and even scores. Find, with proof, the number of scripts with odd scores among the three left.

Let $x$ be the smallest positive integer that cannot be expressed in the form $\frac{2^a - 2^b}{2^c - 2^d}$, where $a$, $b$, $c$, $d$ are non-negative integers. Prove that $x$ is odd.

Let's call a function $f : R \to R$ [i]cool[/i] if there are real numbers $a$ and $b$ such that $f(x + a)$ is an even function and $f(x + b)$ is an odd function. (a) Prove that every cool function is periodic. (b) Give an example of a periodic function that is not cool.

Prove that any integer $n$ satisfying the inequality $n <(44 + \sqrt{1975})^100 <n + 1$ is odd.

Given a positive odd integer $n$, show that the arithmetic mean of fractional parts $\{\frac{k^{2n}}{p}\}, k=1,..., \frac{p-1}{2}$ is the same for infinitely many primes $p$ .

Prove that the polynomial $P (x)$ with integer coefficients, taking odd values for $x = 0$ and $x= 1$, has no integer roots.

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$.