MathDB
2^m is gcd of a_n = 3^n + w(n)

Source: Polish MO Second Round 1973 p6

September 8, 2024
number theorygreatest common divisor

Problem Statement

Prove that for every non-negative integer mm there exists a polynomial w with integer coefficients such that 2m2^m is the greatest common divisor of the numbers an=3n+w(n),n=0,1,2,.... a_n = 3^n + w(n), n = 0, 1, 2, ....
Back to ProblemsView on AoPS