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

Let $x$ and $y$ be integers and let $p$ be a prime number. Suppose that there exist realatively prime positive integers $m$ and $n$ such that $$x^m \equiv y^n \pmod p$$ Prove that there exists an unique integer $z$ modulo $p$ such that $$x \equiv z^n \pmod p \quad \text{and} \quad y \equiv z^m \pmod p$$
A surjective function $g: \mathbb{C} \to \mathbb C$ is given. Find all functions $f: \mathbb{C} \to \mathbb C$ such that for all $x,y\in \mathbb C$ we have $$ |f(x)+g(y)| = | f(y) + g(x)|. $$ Proposed by [i]Mojtaba Zare, Amirabbas Mohammadi[/i]