olymmath

BG-MO 2004 Problem 5

    Let a,b,c,da,b,c,d be positive integers such that the number of pairs (x,y)∈(0,1)2(x,y) \in (0,1)^2 such that both ax+byax+by and cx+dycx+dy are integers is equal with 2004. If gcd⁡(a,c)=6\gcd (a,c)=6 find gcd⁡(b,d)\gcd (b,d) .

    Dataset text AI-MO AoPS. 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

    Similar problems

    These problems have the most words in common with this statement.

    Locator bg-mo/2004/p5 · Tag X312K9STBB · Edit this page on GitHub · Keys: j next, k previous