AoPSWiki

Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!

Personal tools

Search

Toolbox

2001 IMO Shortlist Problems/N4

From AoPSWiki

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 "http://www.artofproblemsolving.com/Wiki/index.php/2001_IMO_Shortlist_Problems/N4"

Categories: Problems with no solution | Olympiad Number Theory Problems

Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us