Find a and b such that gcd(a, b) = 14, a > 2000, b > 2000, and the only prime divisors of a and b are 2 and 7.

Step-by-step explanation:

As 2  and 7 are the only prime divisors of both and we know that both can be written as:

Where is the set of all natural numbers adding the zero (careful because this part is important as I'll explain next).

We also know that 14 divides both numbers and that is actually the greatest common divisor between them. So we can rewrite a and b as follows:

Why do I write them like this? Because this way is easier to observe that if and were both greater than zero, then 28 would divide both hence 14 wouldn't be their g.c.d.. Likewise, if and were both greater than zero, then 98 would divide both and once again, 14 wouldn't be their g.c.d.

So either of them has to be equal to zero. And then we have that

All we have left to do is find the possible values for and so that and that only happens if and

you need to show the graph

step-by-step explanation: