MathDB
Weird gcd function

Source: St Petersburg 2022 10.5

September 28, 2022
functionnumber theory

Problem Statement

Let nn be a positive integer and let a1,a2,⋯aka_1, a_2, \cdots a_k be all numbers less than nn and coprime to nn in increasing order. Find the set of values the function f(n)=gcd(a13−1,a23−1,⋯ ,ak3−1)f(n)=gcd(a_1^3-1, a_2^3-1, \cdots, a_k^3-1).
Back to ProblemsView on AoPS