This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 54

1976 Chisinau City MO, 121

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

2019 Auckland Mathematical Olympiad, 3

Tags: odd , number theory
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.

2002 Singapore Team Selection Test, 2

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

1975 Chisinau City MO, 113

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

2017 Balkan MO Shortlist, N5

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

2015 Gulf Math Olympiad, 1

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

2017 May Olympiad, 1

Tags: digit , odd , number theory
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.

2011 Singapore Junior Math Olympiad, 4

Any positive integer $n$ can be written in the form $n = 2^aq$, where $a \ge 0$ and $q$ is odd. We call $q$ the [i]odd part[/i] of $n$. Define the sequence $a_0,a_1,...$ as follows: $a_0 = 2^{2011}-1$ and for $m > 0, a_{m+i}$ is the odd part of $3a_m + 1$. Find $a_{2011}$.

2016 Dutch BxMO TST, 1

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

1997 ITAMO, 2

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.

1999 Estonia National Olympiad, 4

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.

2016 Saint Petersburg Mathematical Olympiad, 6

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.

2003 Junior Balkan Team Selection Tests - Romania, 2

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

2013 Saudi Arabia BMO TST, 8

Prove that the ratio $$\frac{1^1 + 3^3 + 5^5 + ...+ (2^{2013} - 1)^{(2^{2013} - 1)}}{2^{2013}}$$ is an odd integer.

2008 Postal Coaching, 4

Let $n \in N$ and $k$ be such that $1 \le k \le n$. Find the number of ordered $k$-tuples $(a_1, a_2,...,a_k)$ of integers such the $1 \le a_j \le n$, for $1 \le j \le k$ and [u]either [/u] there exist $l,m \in \{1, 2,..., k\}$ such that $l < m$ but $a_l > a_m$ [u]or [/u] there exists $l \in \{1, 2,..., k\}$ such that $a_l - l$ is an odd number.

2017 Puerto Rico Team Selection Test, 5

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

2006 MOP Homework, 3

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

1996 Singapore Senior Math Olympiad, 3

Tags: odd , number theory
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$.

1999 Estonia National Olympiad, 1

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

2001 Dutch Mathematical Olympiad, 5

If you take a subset of $4002$ numbers from the whole numbers $1$ to $6003$, then there is always a subset of $2001$ numbers within that subset with the following property: If you order the $2001$ numbers from small to large, the numbers are alternately even and odd (or odd and even). Prove this.

1939 Moscow Mathematical Olympiad, 049

Let the product of two polynomials of a variable $x$ with integer coefficients be a polynomial with even coefficients not all of which are divisible by $4$. Prove that all the coefficients of one of the polynomials are even and that at least one of the coefficients of the other polynomial is odd.

2008 Switzerland - Final Round, 6

Determine all odd natural numbers of the form $$\frac{p + q}{p - q},$$ where $p > q$ are prime numbers.

2015 Saudi Arabia JBMO TST, 2

Tags: digit , odd , combinatorics
Let $A$ and $B$ be the number of odd positive integers $n<1000$ for which the number formed by the last three digits of $n^{2015}$ is greater and smaller than $n$, respectively. Prove that $A=B$.

2017 Grand Duchy of Lithuania, 4

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

2011 Belarus Team Selection Test, 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