# A Diophantine Obvious Problem

*With a short solution that was hard for me to find.*

[ Royal Society ] |

Sir Timothy Gowers is a Fields medalist and fellow blogger. Sometimes he (too) writes about simple topics.

Today I would like to talk about a simple problem that came up recently.

The problem is a simple to state “obvious fact”. The reason I thought you might be interested is that I had a tough time finding the solution. I hope you find the explanation below interesting.

The general issue of proving obviously true statements is discussed here for example. Here is an example from Gowers:

Let be intervals of real numbers with lengths that sum to less than , then their union cannot be all of .

He says:

It is quite common for people to think this statement is more obvious than it actually is. (The “proof” is this: just translate the intervals so that the end point of is the beginning point of , and so on, and that will clearly maximize the length of interval you can cover. The problem is that this argument works just as well in the rationals, where the conclusion is false.)

## The Problem’s Statement

The following simple problem came up the other day. Suppose that is an odd number. Show there is some so that

Here is the gcd, the greatest common divisor of and . For example,

This result seems totally obvious, must be true, but I had trouble finding a proof.

## The Problem’s Cousin

There is a unproved conjecture in number theory that says: There are an infinite number of so that both and are prime. This clearly shows that there is an for our problem.

I like conjectures like this since they give you an immediate insight that a statement is likely to be true. But we would like a proof that does not use any unproved conjectures. Our problem can be viewed as a poor version of some of these conjectures. Suppose that you have a conjecture that there are an infinite number of so that

are all prime for some given functions . Then the poor version is to prove that there are so that these numbers are all relatively prime to some given . There are some partial results to the prime version by Ben Green and Terence Tao.

## The Problem’s Failed Proofs

My initial idea was to try to set to something like . The point is that this always satisfies the first constraint: that is for any . Then I planned to try and show there must be some that satisfies the second constraint. Thus the goal is to prove there is some so that

But this is false. Note that if divides then

and so is always divisible by . Ooops.

My next idea was to set to a more “clever” value. I tried

Here I thought that I could make special and control the situation. Now

This looked promising. I then said to myself that why not make a large prime . Then clearly

Since and are relatively prime by the famous Dirichlet’s Theorem on arithmetic progressions we could make a prime too by selecting . This would satisfy the second constraint, and we are done.

Not quite. The trouble is that we need to have also that

Now this is

The trouble is that might not be relatively prime to . So we could just This seems like a recursion and I realized that it might not work.

## The Problem’s Solution

I finally found a solution thanks to Delta Airlines. My dear wife, Kathryn Farley, and I were stuck in DC for several hours waiting for our delayed flight home. This time was needed for me to find a solution.

The key for me was to think about the value . It is usually a good idea to look at the simplest case first. So suppose that , then clearly the constraints

are now trivial. The next simplest case seems to be when is a prime. Let’s try . Now works. Let’s generalize this to any prime . The trick is to set so that

Then is equal to modulo , which is not divisible by . This shows that when is an odd prime there is always some .

Okay how do we get the full result? What if is the product of several primes? The Chinese remainder theorem to the rescue. Suppose that is divisible by the distinct odd primes . We can easily see that we do not care if there are repeated factors, since that cannot change the relatively prime constraints.

Then we constraint by:

and

for all primes . Then the Chinese remainder theorem proves there is some . Done.

## Open Problems

Is there some one line proof of the problem? Do you know any references? There are several obvious generalizations of this simple problem, perhaps someone might look into them.

To be slighly more direct, one can choose $x \equiv 4^{-1} \mod t$, which gives $4x+1 \equiv 1 \mod t$.

If you put t=2k+1 then (k,2k+1)=1.

Moreover (4k+1,2k+1)=1, because

2(2k+1)-(4k+1)=1. So x=k is a number that solves the problem.

I hope it’s correct.

For t=2q+1 take x=q.

Generalization: For any polynomial f with no fixed divisor >1, and any nonzero t, there is an integer a such that f(a) is prime to t. For the original problem, take f(z)=(2z+1)(4(2z+1)+1).