A sequence of non-negative rational numbers $ a(1), a(2), a(3), \ldots$ satisfies $ a(m) \plus{} a(n) \equal{} a(mn)$ for arbitrary natural $ m$ and $ n$. Show that not all elements of the sequence can be distinct.

A point starts at the origin of the coordinate plane. Every minute, it either moves one unit in the $x$-direction or is rotated $\theta$ degrees counterclockwise about the origin. (a) If $\theta = 90^o$, determine all locations where the point could end up. (b) If $\theta = 45^o$, prove that for every location $ L$ in the coordinate plane and every positive number $\varepsilon$, there is a sequence of moves after which the point has distance less than $\varepsilon$ from $L$. (c) Determine all rational numbers $\theta$ such that for every location $L$ in the coordinate plane and every positive number $\varepsilon$, there is a sequence of moves after which the point has distance less than $\varepsilon$ from $L$. (d) Prove that when $\theta$ is irrational, for every location $L$ in the coordinate plane and every positive number $\varepsilon$, there is a sequence of moves after which the point has distance less than $\varepsilon$ from $L.$

[b]a.)[/b] Let $m>1$ be a positive integer. Prove there exist finite number of positive integers $n$ such that $m+n|mn+1$. [b]b.)[/b] For positive integers $m,n>2$, prove that there exists a sequence $a_0,a_1,\cdots,a_k$ from positive integers greater than $2$ that $a_0=m$, $a_k=n$ and $a_i+a_{i+1}|a_ia_{i+1}+1$ for $i=0,1,\cdots,k-1$.

For any positive integer $x$, we set $$ g(x) = \text{ largest odd divisor of } x, $$ $$ f(x) = \begin{cases} \frac{x}{2} + \frac{x}{g(x)} & \text{ if } x \text{ is even;} \\ 2^{\frac{x+1}{2}} & \text{ if } x \text{ is odd.} \end{cases} $$ Consider the sequence $(x_n)_{n \in \mathbb{N}}$ defined by $x_1 = 1$, $x_{n + 1} = f(x_n)$. Show that the integer $2018$ appears in this sequence, determine the least integer $n$ such that $x_n = 2018$, and determine whether $n$ is unique or not.

Find the eighth term of the sequence $1440,$ $1716,$ $1848,\ldots,$ whose terms are formed by multiplying the corresponding terms of two arithmetic sequences.

How many unique $3$-letter sequences with no spaces can be made using the letters in "AUGUSTIN LOUIS CAUCHY", which contains $19$ letters? For example, "GAA" is one acceptable sequence, but "GGA" is not an acceptable sequence because there is only one G available. The original ordering of the letters does not have to be preserved. $\text{(A) }276\qquad\text{(B) }295\qquad\text{(C) }1486\qquad\text{(D) }1651\qquad\text{(E) }8086$

Let a sequence of positive reals $\{u_n\}^{\infty}_{n=1}$ be given. For every positive integer $n$, let $k_n$ be the least positive integer satisfying: \[\sum^{k_n}_{i=1} \frac{1}{i} \geq \sum^n_{i=1} u_i.\] Show that the sequence $\left\{\frac{k_{n+1}}{k_n}\right\}$ has finite limit if and only if $\{u_n\}$ does.

We define a sequence $a_n$ so that $a_0=1$ and \[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \] for all postive integers $n$. Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.

Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and \[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$. Prove that they are converges and find their limits.

Let $n$, $d$ be positive integers such that $d>\frac{n}{2}$. Suppose $a_1, a_2,\cdots,a_{d+2}$ is a sequence of integers satisfying $a_{d+1}=a_1$, $a_{d+2}=a_2$, and for all indices $1\le i_1<i_2<\cdots <i_s\le d$, $$a_{i_1}+a_{i_2}+\cdots+a_{i_s}\not\equiv 0\pmod n$$ Prove that there exists $1\le i\le d$ such that $$a_{i+1}\equiv a_i \pmod n \quad \text{or} \quad a_{i+1}\equiv a_i+a_{i+2} \pmod n$$ [i]Proposed by Yeoh Zi Song[/i]

Show that the cube roots of three distinct primes cannot be terms in an arithmetic progression.

At the start of the PUMaC opening ceremony in McCosh auditorium, the speaker counts $90$ people in the audience. Every minute afterwards, either one person enters the auditorium (due to waking up late) or leaves (in order to take a dreadful math contest). The speaker observes that in this time, exactly $100$ people enter the auditorium, $100$ leave, and $100$ was the largest audience size he saw. Find the largest integer $m$ such that $2^m$ divides the number of different possible sequences of entries and exits given the above information.

Prove the following inequality holds if $\{a_n\}$ is a deceasing sequence of positive reals, and $0<\theta<\frac{\pi}{2}$. $$\left|\sum_{n=1}^{2017} a_n \cos n\theta \right| \leq \frac{\pi a_1}{\theta}$$

Prove that there exists $m \in \mathbb{N}$ such that there exists an integral sequence $\lbrace a_n \rbrace$ which satisfies: [b]I.[/b] $a_0 = 1, a_1 = 337$; [b]II.[/b] $(a_{n + 1} a_{n - 1} - a_n^2) + \frac{3}{4}(a_{n + 1} + a_{n - 1} - 2a_n) = m, \forall$ $n \geq 1$; [b]III. [/b]$\frac{1}{6}(a_n + 1)(2a_n + 1)$ is a perfect square $\forall$ $n \geq 1$.

For geometrical sequence $(a_n)$, the first term $a_1=1536$, common ratio $q=-\frac{1}{2}$. Let $\pi_n=\prod_{i=1}^n a_i$, so the lagerest one in $(\pi_n)$ is $\text{(A)} \pi_9\qquad\text{(B)} \pi_{11}\qquad\text{(C)} \pi_{12}\qquad\text{(D)} \pi_{13}$

Denote by $ M(r,f)$ the maximum modulus on the circle $ |z|\equal{}r$ of the transcendent entire function $ f(z)$, and by $ M_n(r,f)$ that of the $ nth$ partial sum of the power series of $ f(z)$. Prove that the existence of an entire function $ f_0(z)$ and a corresponding sequence of positive numbers $ r_1<r_2<...\rightarrow \plus{}\infty$ such that \[ \limsup_{n\rightarrow\infty} \frac{M_n(r_n,f_0)}{M(r_n,f_0)}\equal{}\plus{}\infty\] [P. Turan]