2025 USAJMO Problems/Problem 1

Problem

Let $\mathbb Z$ be the set of integers, and let $f\colon \mathbb Z \to \mathbb Z$ be a function. Prove that there are infinitely many integers $c$ such that the function $g\colon \mathbb Z \to \mathbb Z$ defined by $g(x) = f(x) + cx$ is not bijective. Note: A function $g\colon \mathbb Z \to \mathbb Z$ is bijective if for every integer $b$ , there exists exactly one integer $a$ such that $g(a) = b$ .

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

2025 USAJMO (Problems • Resources)
Preceded by First Problem	Followed by Problem 2
1 • 2 • 3 • 4 • 5 • 6
All USAJMO Problems and Solutions

Page

Toolbox

Search

2025 USAJMO Problems/Problem 1

Contents

Problem

Solution

See Also