# An Old But Cool Result

*Solving a type of Fermat Equation*

Leo Moser was a mathematician who worked on a very varied set of problems. He for example raised a question about “worms,” and invented a notation for huge numbers.

Today I want to talk about one of his results with a very short proof.

No, it is not about worms. That is a question in discrete geometry that is still open I believe: “What is the region of smallest area which can accommodate every planar arc of length one?” The region must be able to hold the arc inside but the curve can be moved and rotated to allow it to fit. A disk of diameter works and has area about . It is possible to do much better and get around .

See this paper for some additional details.

No, it is not about a conjecture of Paul Erdős See this for a great paper on this result:

Theorem 1Suppose thatThen any solution in integers with must have

Erdős conjectured there are no solutions at all. It is easy to check that for the unique solution is a bit smaller:

## The Result

Yes, it is about the solution to a natural family of Diophantine equations. This result of Moser comes from an old paper of his. The result can be found on the wonderful blog called cut-the-knot written by Alexander Bogomolny.

The question considered by Moser is simple to state:

Consider the equation over the integers where are fixed values that are relatively prime. Show that there are infinitely many integer solutions.

The surprise, to me, is that this equation always has integer solutions. I thought about it for a bit and had no idea how to even start.

The solution is as follows. The initial insight is that the restriction on the exponents implies that there are integers so that .

Wait a minute. We must be careful by what we mean by “the values of are relatively prime.” We need more than the greatest common divisor (GCD) of is . We need that and are relatively prime. Note that have GCD equal to but no matter which of the triple is “” we cannot find the needed :

I thank Subrahmanyam Kalyanasundaram for catching this.

The next idea is not to look for a single set of solutions but rather to find a parametrized solution. That is try to find expressions for that depend on some variables so that for all the equation is satisfied.

Then set

Note as vary over integers the values of and vary over integers too. The claim is that this is a parameterization of the equation. Let’s see why. We need to figure out what is equal to. It looks a bit nasty but it is not. Let . Then

So is

Which magically is

Thus setting

implies that

Very neat. By the way we do need to note that as and run through integers the values of and and vary enough to get an infinite number of solutions. A simple growth argument shows that this is true.

The key trick was to **not** use a standard idea and apply the binomial theorem and expand

My algebra DNA suggests that expanding such an expression is often a good idea. Here it would lead to a mess. This is a case where using the binomial expansion does not work.

## Open Problems

I really like Moser’s clever solution to the diophantine equation

Note that it must fail when for by the famous solution to the original Fermat equation.

### Trackbacks

- New top story on Hacker News: An Old but Cool Result – Gödel’s Lost Letter and P=NP – Golden News
- New top story on Hacker News: An Old but Cool Result – Gödel’s Lost Letter and P=NP – Latest news
- New top story on Hacker News: An Old but Cool Result – Gödel’s Lost Letter and P=NP – Outside The Know
- New top story on Hacker News: An Old but Cool Result – Gödel’s Lost Letter and P=NP – World Best News
- New top story on Hacker News: An Old but Cool Result – Gödel’s Lost Letter and P=NP – Hckr News
- New top story on Hacker News: An Old but Cool Result – Gödel’s Lost Letter and P=NP – News about world

So if , then there are no solutions, while if , there are infinitely many. Do we have a complete characterization with some GCD’s?

(Of course I mean non-trivial solutions, just like you.)