Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2001 IMO Shortlist Problems/N4

Revision as of 18:57, 20 August 2008 by Minsoens (talk | contribs) (New page: == Problem == Let <math>p \geq 5</math> be a prime number. Prove that there exists an integer <math>a</math> with <math>1 \leq a \leq p - 2</math> such that neither <math>a^{p - 1} - 1</ma...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $p \geq 5$ be a prime number. Prove that there exists an integer $a$ with $1 \leq a \leq p - 2$ such that neither $a^{p - 1} - 1$ nor $(a + 1)^{p - 1} - 1$ is divisible by $p^2$.

Solution

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

Resources

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_IMO_Shortlist_Problems/N4&oldid=27521"