# 2017 IMO Problems/Problem 6

An ordered pair of integers is a primitive point if the greatest common divisor of and is . Given a finite set of primitive points, prove that there exist a positive integer and integers such that, for each in , we have:

Sign In

0

Revision as of 06:20, 17 December 2017 by Don2001 (talk | contribs) (Created page with "An ordered pair <math>(x, y)</math> of integers is a primitive point if the greatest common divisor of <math>x</math> and <math>y</math> is <math>1</math>. Given a finite set...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

An ordered pair of integers is a primitive point if the greatest common divisor of and is . Given a finite set of primitive points, prove that there exist a positive integer and integers such that, for each in , we have:

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_IMO_Problems/Problem_6&oldid=88947"

Invalid username

Login to AoPS

Copyright © 2020 Art of Problem Solving