MathDB
2013-2014 Fall OMO #6

Source:

October 30, 2013
Online Math Openmodular arithmetic

Problem Statement

Find the number of integers nn with n≥2n \ge 2 such that the remainder when 20132013 is divided by nn is equal to the remainder when nn is divided by 33.
Proposed by Michael Kural
Back to ProblemsView on AoPS