Let $F_1, F_2, F_3 \cdots$ be the Fibonacci sequence, the sequence of positive integers satisfying $$F_1 =F_2=1$$ and $$F_{n+2} = F_{n+1} + F_n$$ for all $n \ge 1$. Does there exist an $n \ge 1$ such that $F_n$ is divisible by $2014$? Prove your answer.

A perfect number, greater than $6$, is divisible by $3$. Prove that it is also divisible by $9$.

For postive integers $k,n$, let $$f_k(n)=\sum_{m\mid n,m>0}m^k$$ Find all pairs of positive integer $(a,b)$ such that $f_a(n)\mid f_b(n)$ for every positive integer $n$.

Let $x, y$ be positive integers such that $\frac{x^2}{y}+\frac{y^2}{x}$ is an integer. Prove that $y|x^2$.

$\alpha,\beta$ are positive irrational numbers and $[\alpha[\beta x]]=[\beta[\alpha x]]$ for every positive $x$. Prove that $\alpha=\beta$

Let $\lfloor z \rfloor$ denote the greatest integer less than or equal to $z.$ Compute $$\sum_{j=-1000}^{1000} \left\lfloor \frac{2025}{j+0.5}\right\rfloor.$$

i) Find all infinite arithmetic progressions formed with positive integers such that there exists a number $N \in \mathbb{N}$, such that for any prime $p$, $p > N$, the $p$-th term of the progression is also prime. ii) Find all polynomials $f(X) \in \mathbb{Z}[X]$, such that there exist $N \in \mathbb{N}$, such that for any prime $p$, $p > N$, $| f(p) |$ is also prime. [i]Dan Schwarz[/i]

Find all integer polynomials $P(x)$, the highest coefficent is 1 such that: there exist infinitely irrational numbers $a$ such that $p(a)$ is a positive integer.

Consider the equation \[x^2 + y^2 + z^2 + t^2 - N \cdot x \cdot y \cdot z \cdot t - N = 0\] where $N$ is a given positive integer. a) Prove that for an infinite number of values of $N$, this equation has positive integral solutions (each such solution consists of four positive integers $x, y, z, t$), b) Let $N = 4 \cdot k \cdot (8 \cdot m + 7)$ where $k,m$ are no-negative integers. Prove that the considered equation has no positive integral solutions.

Find all positive integers that are equal to $700$ times the sum of its digits.

Jerry likes to play with numbers. One day, he wrote all the integers from $1$ to $2024$ on the whiteboard. Then he repeatedly chose four numbers on the whiteboard, erased them, and replaced them with either their sum or their product. (For example, Jerry's first step might have been to erase $1, 2, 3$, and $5$, and then write either $11$, their sum, or $30$, their product, on the whiteboard.) After repeatedly performing this operation, Jerry noticed that all the remaining numbers on the board were odd. What is the maximum possible number of integers on the board at that time? $ \textbf{(A) }1010 \qquad \textbf{(B) }1011 \qquad \textbf{(C) }1012 \qquad \textbf{(D) }1013 \qquad \textbf{(E) }1014 \qquad $

Let $a,b\in\mathbb{N}$ such that : \[ ab(a-b)\mid a^3+b^3+ab \] Then show that $\operatorname{lcm}(a,b)$ is a perfect square.

Find all functions $f:\mathbb{Z} \to \mathbb{Z}$ such that the numbers \[n, f(n),f(f(n)),\dots,f^{m-1}(n)\] are distinct modulo $m$ for all integers $n,m$ with $m>1$. (Here $f^k$ is defined by $f^0(n)=n$ and $f^{k+1}(n)=f(f^{k}(n))$ for $k \ge 0$.)

Let be a natural number $ n\ge 3 $ with the property that $ 1+3n $ is a perfect square. Show that there are three natural numbers $ a,b,c, $ such that the number $$ 1+\frac{3n+3}{a^2+b^2+c^2} $$ is a perfect square.

Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$ [i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]

[b]p1.[/b] In the picture below, the two parallel cuts divide the square into three pieces of equal area. The distance between the two parallel cuts is $d$. The square has length $s$. Find and prove a formula that expresses $s$ as a function of $d$. [img]https://cdn.artofproblemsolving.com/attachments/c/b/666074d28de50cdbf338a2c667f88feba6b20c.png[/img] [b]p2.[/b] Let $S$ be a subset of $\{1, 2, 3, . . . 10, 11\}$. We say that $S$ is lucky if no two elements of $S$ differ by $4$ or $7$. (a) Give an example of a lucky set with five elements. (b) Is it possible to find a lucky set with six elements? Explain why or why not.[/quote] [b]p3.[/b] Find polynomials $p(x)$ and $q(x)$ with real coefficients such that (a) $p(x) - q(x) = x^3 + x^2 - x - 1$ for all real $x$, (b) $p(x) > 0$ for all real $x$, (c) $q(x) > 0$ for all real $x$. [b]p4.[/b] A permutation on $\{1, 2, 3, …, n\}$ is a rearrangement of the symbols. For example $32154$ is a permutation on $\{1, 2, 3, 4, 5\}$. Given a permutation $a_1a_2a_3…a_n$, an inversion is a pair of $a_i$ and $a_j$ such that $a_i > a_j$ but $i < j$. For example, $32154$ has $4$ inversions. Suppose you are only allowed to exchange adjacent symbols. For any permutation, show that the minimum number of exchanges required to put all the symbols in their natural positions (that is, $123 …n$) is the number of inversions. [b]p5.[/b] We say a number $N$ is a nontrivial sum of consecutive positive integers if it can be written as the sum of $2$ or more consecutive positive integers. What is the set of numbers from $1000$ to $2000$ that are NOT nontrivial sums of consecutive positive integers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a room, $2/5$ of the people are wearing gloves, and $3/4$ of the people are wearing hats. What is the minimum number of people in the room wearing both a hat and a glove? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 15\qquad\textbf{(E)}\ 20 $

Compute the product of all positive integers $n$ for which $3(n!+1)$ is divisible by $2n - 5$.

Find all triples $(p,q,r)$ of primes such that $pq=r+1$ and $2(p^2+q^2)=r^2+1$.

How many zeros are there in the last digits of the following number $P = 11\times12\times ...\times 88\times 89$ ? (A): $16$, (B): $17$, (C): $18$, (D): $19$, (E) None of the above.

Does there exist a nonzero algebraic number $\alpha$ with $|\alpha| \neq 1$ such that there exists infinitely many positive integers $n$ for which there's $\beta_n \in \mathbb{C}$ with $\beta_n \in \mathbb{Q}(\alpha)$ and $\beta_n^n = \alpha$?

A natural number is written on the blackboard. Whenever number $ x$ is written, one can write any of the numbers $ 2x \plus{} 1$ and $ \frac {x}{x \plus{} 2}$. At some moment the number $ 2008$ appears on the blackboard. Show that it was there from the very beginning.

The football tournament was played in one round. $3$ points were given for a win, $1$ point for a draw, and $0$ points for a loss. Could it be that the first place team under the old scoring system (win - $2$ points, draw - $1$ point, loss - $0$) would be last?

Call a fraction $\frac{a}{b}$, not necessarily in the simplest form [i]special[/i] if $a$ and $b$ are positive integers whose sum is $15$. How many distinct integers can be written as the sum of two, not necessarily different, special fractions? $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 13$

For how many numbers $n$ does $2017$ divided by $n$ have a remainder of either $1$ or $2$?