Found problems: 5923
Does there exist a sequence of $2017$ consecutive integers which contains exactly $17$ primes?
Let the numbers $a_1,a_2,a_3,a_4$ form an arithmetic progression with difference $d\ne0$. Prove that there are no exists geometric progressions $b_1,b_2,b_3,b_4$ and $c_1,c_2,c_3,c_4$ such that:
$$a_1=b_1+c_1,a_2=b_2+c_2,a_3=b_3+c_3,a_4=b_4+c_4.$$
Let be a sequence $ \left( u_n \right)_{n\ge 1} $ given by the recurrence relation $ u_{n+1} =u_n+\sqrt{u_n^2-u_1^2} , $ and the constraints $ u_2\ge u_1>0. $
Calculate $ \lim_{n\to\infty }\frac{2^n}{u_n} . $
[i]Dan Negulescu[/i]
Let \[T_0=2, T_1=3, T_2=6,\] and for $n\ge 3$, \[T_n=(n+4)T_{n-1}-4nT_{n-2}+(4n-8)T_{n-3}.\] The first few terms are \[2, 3, 6, 14, 40, 152, 784, 5158, 40576, 363392.\] Find a formula for $T_n$ of the form \[T_n=A_n+B_n,\] where $\{A_n\}$ and $\{B_n\}$ are well known sequences.
For any two positive real numbers $x_0 > 0$, $x_1 > 0$, a sequence of real numbers is defined recursively by $$x_{n+1} =\frac{4 \max\{x_n, 4\}}{x_{n-1}}$$ for $n \ge 1$. Find $x_{2010}$.
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
Find all polynomial with real coefficients such that:
P(x^2+1)=P(x)^2+1
The Fibonacci sequence $\{F_n\}$ is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all positive integers $n$. Determine all triplets of positive integers $(k,m,n)$ such that $F_n = F_m^k$.
Given the endless arithmetic progression with the positive integer members. One of those is an exact square. Prove that the progression contain the infinite number of the exact squares.
Let $p$ and $q$ be prime numbers and $\{a_{n}\}_{n=1}^{\infty}$ be a sequence of integers defined by:
\[a_{0}=0, a_{1}=1, a_{n+2}=pa_{n+1}-qa_{n}\quad\forall n\geq 0\]
Find $p$ and $q$ if there exists an integer $k$ such that $a_{3k}=-3$.
Let $f:[-1,1]\to\mathbb{R}$ be a continuous function having finite derivative at $0$, and
\[I(h)=\int^h_{-h}f(x)\text{ d}x,\ h\in [0,1].\]
Prove that
a) there exists $M>0$ such that $|I(h)-2f(0)h|\le Mh^2$, for any $h\in [0,1]$.
b) the sequence $(a_n)_{n\ge 1}$, defined by $a_n=\sum_{k=1}^n\sqrt{k}|I(1/k)|$, is convergent if and only if $f(0)=0$.
[i]Calin Popescu[/i]
Determine all real numbers $\alpha$ with the property that all numbers in the sequence $\cos\alpha,\cos2\alpha,\cos2^2\alpha,\ldots,\cos2^n\alpha,\ldots$ are negative.
Let the sequences $(x_n)$ and $(y_n)$ be defined by $x_0 = 0$, $x_1 = 1$, $x_{n + 2} = 3x_{n + 1}-2x_n$ for $n = 0, 1, ...$ and $y_n = x^2_n+2^{n + 2}$ for $n = 0, 1, ...,$ respectively. Show that for all n> 0, and n is the square of a odd integer.
Define a [i]domino[/i] to be an ordered pair of [i]distinct[/i] positive integers. A [i]proper sequence[/i] of dominoes is a list of distinct dominoes in which the first coordinate of each pair after the first equals the second coordinate of the immediately preceding pair, and in which $(i, j)$ and $(j, i)$ do not [i]both[/i] appear for any $i$ and $j$. Let $D_n$ be the set of all dominoes whose coordinates are no larger than $n$. Find the length of the longest proper sequence of dominoes that can be formed using the dominoes of $D_n$.
[b]8.[/b] Let $f(x)$ be a convex function defined on the interval $[0, \frac {1}{2}]$ with $f(0)=0$ and $f(\frac{1}{2})=1$; Let further $f(x)$ be differentiable in $(0, \frac {1}{2})$, and differentiable at $0$ and $\frac{1}{2}$ from the right and from the left, respectively. Finally, let $f'(0)>1$.
Extend $f(x)$ to $[0.1]$ in the following manner: let $f(x)= f(1-x)$ if $x \in (\frac {1} {2}, 1]$.
Show that the set of the points $x$ for shich the terms of the sequence $x_{n+1}=f(x_n)$ ($x_0=x; n = 0, 1, 2, \dots $) are not all different is everywhere dense in $[0,1]$; [b](R. 10)[/b]
Let $a_1,a_2,\dots$ be a sequence of positive numbers satisfying, for any positive integers $k,l,m,n$ such that $k+n=m+l$, $$\frac{a_k+a_n}{1+a_ka_n}=\frac{a_m+a_l}{1+a_ma_l}.$$Show that there exist positive numbers $b,c$ so that $b\le a_n\le c$ for any positive integer $n$.
Consider all binary sequences of length $n$. In a sequence that allows the interchange of positions of an arbitrary set of $k$ adjacent numbers, ($k < n$), two sequences are said to be [i]equivalent [/i] if they can be transformed from one sequence to another by a finite number of transitions as above. Find the number of sequences that are not equivalent.
Find all pairs $(a,b)$ of real numbers such that $\lfloor an + b \rfloor$ is a perfect square, for all positive integer $n$.
Let $n \ge 2$ be an integer and let $a_1, a_2, \cdots a_n$ be fixed positive integers (not necessarily all distinct) in such a way that $\gcd(a_1, a_2 \cdots a_n)=1$. In a board the numbers $a_1, a_2 \cdots a_n$ are all written along with a positive integer $x$. A move consists of choosing two numbers $a>b$ from the $n+1$ numbers in the board and replace them with $a-b,2b$. Find all possible values of $x$, with respect of the values of $a_1, a_2 \cdots a_n$, for which it is possible to achieve a finite sequence of moves (possibly none) such that eventually all numbers written in the board are equal.
Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products
\[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\]
form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.
The Fibonacci sequence $\{F_{n}\}$ is defined by \[F_{1}=1, \; F_{2}=1, \; F_{n+2}=F_{n+1}+F_{n}.\] Show that $\gcd (F_{m}, F_{n})=F_{\gcd (m, n)}$ for all $m, n \in \mathbb{N}$.
A sequence whose first term is positive has the property that any given term is the area of an equilateral triangle whose perimeter is the preceding term. If the first three terms form an arithmetic progression, determine all possible values of the first term.
The Fibonacci numbers are defined as the sequence $F_n$ with $F_0=1$, $F_1=1$ and $F_{n+2} = F_{n+1} +F_n$. How many ways can $10$ be written as an ordered sum of numbers found in the Fibonacci sequence? For example, $3$ can be written as $1 + 1 + 1$, $2 + 1$, $1 + 2$, and $3$, for a total of $4$ ways.
[i]2015 CCA Math Bonanza Team Round #9[/i]
[u]Round 1[/u]
[b]p1.[/b] Three two-digit numbers are written on a board. One starts with $5$, another with $6$, and the last one with $7$. Annie added the first and the second numbers; Benny added the second and the third numbers; Denny added the third and the first numbers. Could it be that one of these sums is equal to $148$, and the two other sums are three-digit numbers that both start with $12$?
[b]p2.[/b] Three rocks, three seashells, and one pearl are placed in identical boxes on a circular plate in the order shown. The lids of the boxes are then closed, and the plate is secretly rotated. You can open one box at a time. What is the smallest number of boxes you need to open to know where the pearl is, no matter how the plate was rotated?
[img]https://cdn.artofproblemsolving.com/attachments/0/2/6bb3a2a27f417a84ab9a64100b90b8768f7978.png[/img]
[b]p3.[/b] Two detectives, Holmes and Watson, are hunting the thief Raffles in a library, which has the floorplan exactly as shown in the diagram. Holmes and Watson start from the center room marked $D$. Show that no matter where Raffles is or how he moves, Holmes and Watson can find him. Holmes and Watson do not need to stay together. A detective sees Raffles only if they are in the same room. A detective cannot stand in a doorway to see two rooms at the same time.
[img]https://cdn.artofproblemsolving.com/attachments/c/1/6812f615e60a36aea922f145a1ffc470d0f1bc.png[/img]
[b]p4.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken.
[img]https://cdn.artofproblemsolving.com/attachments/4/6/bf0185e142cd3f653d4a9c0882d818c55c64e4.png[/img]
[b]p5.[/b] The numbers $1–14$ are placed around a circle in some order. You can swap two neighbors if they differ by more than $1$. Is it always possible to rearrange the numbers using swaps so they are ordered clockwise from $1$ to $14$?
[u]Round 2[/u]
[b]p6.[/b] A triangulation of a regular polygon is a way of drawing line segments between its vertices so that no two segments cross, and the interior of the polygon is divided into triangles. A flip move erases a line segment between two triangles, creating a quadrilateral, and replaces it with the opposite diagonal through that quadrilateral. This results in a new triangulation.
[img]https://cdn.artofproblemsolving.com/attachments/a/a/657a7cf2382bab4d03046075c6e128374c72d4.png[/img]
Given any two triangulations of a polygon, is it always possible to find a sequence of flip moves that transforms the first one into the second one?
[img]https://cdn.artofproblemsolving.com/attachments/0/9/d09a3be9a01610ffc85010d2ac2f5b93fab46a.png[/img]
[b]p7.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9,..., 121)$ are in one column?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
In an infinite arithmetic progression of positive integers there are two integers with the same sum of digits. Will there necessarily be one more integer in the progression with the same sum of digits?
[i]Proposed by A. Shapovalov[/i]