Difference between revisions of "2022 SSMO Accuracy Round Problems/Problem 5"
(Created page with "==Problem== Find the number of ordered pairs <math>(a, b)</math>, where <math>1\leq a, b\leq 9</math>, for which the largest integer <math>n</math> that satisfies<cmath>(a-b)^...") |
(No difference)
|
Latest revision as of 13:03, 14 December 2023
Problem
Find the number of ordered pairs 
, where 
, for which the largest integer 
that satisfies![\[(a-b)^k\equiv a^k-b^k\pmod n\]](http://latex.artofproblemsolving.com/b/9/5/b951bd3482fa73f7805c28766bbd769a237888eb.png)
for all 
is 
.
