olymmath

RMM 2018 Problem 4

  • Day 2

Let a,b,c,da, b, c, d be positive integers such that ad≠bca d \neq b c and gcd⁡(a,b,c,d)=1\operatorname{gcd}(a, b, c, d)=1. Prove that, as nn runs through the positive integers, the values gcd⁡(an+b,cn+d)\operatorname{gcd}(a n+b, c n+d) may achieve form the set of all positive divisors of some integer.

Raul Alcantara, Peru

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator rmm/2018/p4 · Tag NNQE9W270A · Edit this page on GitHub · Keys: j next, k previous