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

ICMC 4, 2

Let $p > 3$ be a prime number. A sequence of $p-1$ integers $a_1,a_2, \dots, a_{p-1}$ is called [i]wonky[/i] if they are distinct modulo \(p\) and $a_ia_{i+2} \not\equiv a_{i+1}^2 \pmod p$ for all \(i \in \{1, 2, \dots, p-1\}\), where \(a_p = a_1\) and \(a_{p+1} = a_2\). Does there always exist a wonky sequence such that $$a_1a_2, \qquad a_1a_2+a_2a_3, \qquad \dots, \qquad a_1a_2+\cdots +a_{p-1}a_1,$$ are all distinct modulo $p$? [i]Proposed by Harun Khan[/i]

ICMC 5, 4

Let $p$ be a prime number. Find all subsets $S\subseteq\mathbb Z/p\mathbb Z$ such that 1. if $a,b\in S$, then $ab\in S$, and 2. there exists an $r\in S$ such that for all $a\in S$, we have $r-a\in S\cup\{0\}$. [i]Proposed by Harun Khan[/i]