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: 34

PEN M Problems, 13

The sequence $\{x_{n}\}$ is defined by \[x_{0}\in [0, 1], \; x_{n+1}=1-\vert 1-2 x_{n}\vert.\] Prove that the sequence is periodic if and only if $x_{0}$ is irrational.

PEN M Problems, 25

Let $\{a_{n}\}_{n \ge 1}$ be a sequence of positive integers such that \[0 < a_{n+1}-a_{n}\le 2001 \;\; \text{for all}\;\; n \in \mathbb{N}.\] Show that there are infinitely many pairs $(p, q)$ of positive integers such that $p>q$ and $a_{q}\; \vert \; a_{p}$.

PEN M Problems, 5

Show that there is a unique sequence of integers $\{a_{n}\}_{n \ge 1}$ with \[a_{1}=1, \; a_{2}=2, \; a_{4}=12, \; a_{n+1}a_{n-1}=a_{n}^{2}\pm1 \;\; (n \ge 2).\]

PEN M Problems, 9

An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=2, \; a_{n+1}=\left\lfloor \frac{3}{2}a_{n}\right\rfloor.\] Show that it has infinitely many even and infinitely many odd integers.

PEN M Problems, 21

In the sequence $1, 0, 1, 0, 1, 0, 3, 5, \cdots$, each member after the sixth one is equal to the last digit of the sum of the six members just preceeding it. Prove that in this sequence one cannot find the following group of six consecutive members: \[0, 1, 0, 1, 0, 1\]

PEN M Problems, 19

A sequence with first two terms equal $1$ and $24$ respectively is defined by the following rule: each subsequent term is equal to the smallest positive integer which has not yet occurred in the sequence and is not coprime with the previous term. Prove that all positive integers occur in this sequence.

PEN M Problems, 6

The sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=1, \; a_{n+1}=2a_{n}+\sqrt{3a_{n}^{2}+1}.\] Show that $a_{n}$ is an integer for every $n$.

PEN M Problems, 32

In an increasing infinite sequence of positive integers, every term starting from the $2002$-th term divides the sum of all preceding terms. Prove that every term starting from some term is equal to the sum of all preceding terms.

PEN M Problems, 23

Define \[\begin{cases}d(n, 0)=d(n, n)=1&(n \ge 0),\\ md(n, m)=md(n-1, m)+(2n-m)d(n-1,m-1)&(0<m<n).\end{cases}\] Prove that $d(n, m)$ are integers for all $m, n \in \mathbb{N}$.