Thanksgiving theorems, part I

Today is thanksgiving day in our jurisdiction; and, being that it falls on the 14th — a number that is “HTMLy” (read as extremely) significant to us — we’ve chosen to mark the occasion with math. While this choice may seem unconventional, it doesn’t rule out the fact that our genuine gratitude to The Generous Giver is unconditional.

Now to the math itself. Consider the prime factorizations of 14 and 15:

    \[14=2\times 7,\quad 15=3\times 5\]

and an enumeration of the first four prime numbers:


Clearly, we have that 2\times 7 < 3\times 5; this was what motivated the theorems in this post. By the way, our use of the word theorem is a deliberate exaggeration, but since we’re not dealing with advanced math, we hope that we’ll be offered exoneration, despite our overt exaggeration.

Theorem 1

Let x,y,z,t be an arithmetic sequence. Then yz>xt.

If x,y,z,t are as given, we can suppose that the common difference of the arithmetic sequence is d, and then write y=x+d,z=x+2d,t=x+3d. Consider yz-xt:

    \begin{equation*} \begin{split} yz-xt&=(x+d)(x+2d)-(x)(x+3d)\\ &=(x^2+3xd+2d^2)-(x^2+3xd)\\ &=2d^2\\ &>0 \end{split} \end{equation}

Since the difference yz-xt>0, we conclude that yz>xt.

Theorem 2

Let x,y,z,t be integers that form an arithmetic sequence. Then yz-xt can never be a perfect square.

If x,y,z,t are integers that form an arithmetic sequence, then the common difference d must be an integer as well (note that we exclude the case when d=0). From our previous calculation, we saw that yz-xt=2d^2. Since 2d^2 is not a perfect square when d is an integer (except for d=0), so is yz-xt.

Theorem 3

Let x,y,z,t be consecutive, positive even numbers. Then yz-xt=8.

This should have been better described as a corollary (to the first “theorem”), but we don’t want to introduce another jargon here. We’ll ask you to prove it in the exercises at the end; for now, let’s see a few instances:

  • Consider the first four positive even numbers: 2,4,6,8. We have that 4\times 6 - 2\times 8=24-16=8;
  • Consider the numbers 10,12,14,16. We have that 12\times 14-10\times 16=168-160=8;
  • Consider the numbers 16, 18,20,22. We have that 18\times 20-16\times 22=360-352=8;
  • And so on. You feel that?

Theorem 4

Let x,y,z,t be consecutive, positive odd numbers. Then yz-xt=8.

Actually, the “positive” requirement in the two preceding theorems can be dropped, what’s essential is that none of the numbers should be zero. Few examples below:

  • Consider the first four positive odd numbers: 1,3,5,7. We have that 3\times 5-1\times 7=15-7=8;
  • Consider the numbers 11,13,15,17. We have 13\times 15-11\times 17=195-187=8;
  • Consider the numbers 61,63,65,67. We have 63\times 65-61\times 67=4095-4087=8.

Theorem 5

Let x,y,z,t be consecutive integers, none of which is zero. Then, yz-xt=2.

Consecutive integers form an arithmetic sequence with a common difference of d=1. So, in view of our first theorem, we have that yz-xt=2d^2=2(1^2)=2.

The next result is well-known, and is in a class of its own:

Theorem 6

Let x,y,z,t be four consecutive terms of a Fibonacci sequence. Then yz-xt=\pm 1.

Usually, the terms in a Fibonacci sequence are denoted by F_{n},F_{n+1},F_{n+2},\cdots; we’ve used x,y,z,t for convenience. Also, in order to keep things simple, we’ve omitted the proof of the above result, but we invite our readers to try it out — this can be accomplished, for example, by using the fact that the nth term is given by


and then expanding and simplifying F_{n+1}F_{n+2}-F_{n}F_{n+3}.

Theorem 7

Let x,y,z,t be a geometric sequence. Then yz-xt=0.

Let x,y,z,t be as given. Suppose that the common ratio of the geometric sequence is r, then we can write y=xr,z=xr^2,t=xr^3. Now:

    \begin{equation*} \begin{split} yz-xt&=(xr)(xr^2)-(x)(xr^3)\\ &=x^2r^3-x^2r^3\\ &=0, \end{split} \end{equation}

which is what we want.

Linear systems with special coefficients

Do our “theorems” have any where we can apply them? Well, somewhat — think linear systems. If we have a linear system in two variables x and y, like so:

(1)   \begin{equation*} ax+by=k \end{equation*}

(2)   \begin{equation*} cx+dy=l, \end{equation*}

then the solution can be given by (Cramer’s rule ):

    \[x=\frac{dk-bl}{ad-bc},\quad y=\frac{al-ck}{ad-bc}.\]

As can be seen from the above explicit formula, the quantity ad-bc is akin to what we’ve been playing around with. That makes us to ask: “What if the coefficients in a linear system are so arranged that they’re consecutive terms of any of the number patterns we’ve considered in this post”? This is certainly an obscure possibility, but we’ve included it out of curiosity.

Theorem 8

Let a,b,c,d be consecutive integers, none of which is zero. Then the linear system

(3)   \begin{equation*} ax+by=k \end{equation*}

(4)   \begin{equation*} cx+dy=l \end{equation*}

has integer solutions, if k and l are even numbers.

The proof relies on the fact that the quantity ad-bc (called the determinant) appears in the denominator when the above linear system is solved. Recall that the solution is:

    \[x=\frac{dk-bl}{ad-bc},\quad y=\frac{al-ck}{ad-bc}.\]

Since a,b,c,d are consecutive non-zero integers, we know, from Theorem 5, that bc-ad=2, or ad-bc=-2. Thus the solution may be re-written as:

    \[x=\frac{dk-bl}{-2},\quad y=\frac{al-ck}{-2}.\]

Since both k and l are even numbers, we know that the numerators above, namely dk-bl and al-ck, are both even. Therefore, the expressions for x and y are divisible by 2, resulting in integer quotients.

Theorem 9

Let a,b,c,d be consecutive terms of a Fibonacci sequence. Then the linear system

(5)   \begin{equation*} ax+by=k \end{equation*}

(6)   \begin{equation*} cx+dy=l \end{equation*}

has integer solutions if k and l are integers.

Notice that we have bc-ad=\pm 1 if a,b,c,d are consecutive terms of a Fibonacci sequence (Theorem 6 above), and so the general solution

    \[x=\frac{dk-bl}{ad-bc},\quad y=\frac{al-ck}{ad-bc}\]

simplifies to x=\pm(dk-bl),~y=\pm(al-ck), which are integers.

Theorem 10

Let a,b,c,d be a geometric sequence with common ratio r. Then the linear system

(7)   \begin{equation*} ax+by=k \end{equation*}

(8)   \begin{equation*} cx+dy=l \end{equation*}

has no solution so long as k\neq \frac{l}{r^2} (and k and l are not both zero).

A proof of our present theorem relies on the fact that ad-bc=0 when a,b,c,d form a geometric sequence (Theorem 7), together with the fact that the solution to the linear system is:

    \[x=\frac{dk-bl}{ad-bc},\quad y=\frac{al-ck}{ad-bc}.\]

Since division by zero is not allowed, we’ll be unable to determine x and y from the above expressions, thus no solution. But wait. How about the assumption that k and l are not both zero? If they are both zero, then we’ll have a trivial solution: x=0,y=0. What of the assumption that k\neq \frac{l}{r^2}? Suppose that k=\frac{l}{r^2}. Then, we can divide equation (8) by r^2, obtaining

(9)   \begin{equation*}\frac{c}{r^2}x+\frac{d}{r^2}y=\frac{l}{r^2}.\end{equation*}

However, since a,b,c,d form a geometric sequence with common ratio r, it follows that a=\frac{c}{r^2} and b=\frac{d}{r^2}. This would then mean that equation (9) is the same as:

(10)   \begin{equation*} ax+by=k, \end{equation*}

which is exactly equation (7). This is saying that if k=\frac{l}{r^2}, then equations (7) and (8) are the same, meaning that there’s an infinite number of solutions to the original linear system. So we want k\neq \frac{l}{r^2} for our theorem to hold.


If four numbers x,y,z,t are arranged in ascending order, then the quantity yz-xt always takes on constant values, under certain circumstances. In the case of even/odd numbers, it is 8; in the case of Fibonacci numbers, it is \pm 1; in the case of geometric sequences, it is 0.


  1. Construct an example to show that x< y< z< t does not always imply that yz>xt.
  2. Without requiring that x,y,z,t form a geometric sequence, prove that it is still possible to have yz-xt=0, where x,y,z,t are non-zero integers that are not all equal and have been sorted in ascending order.
  3. Let x< y< z< t be numbers. Under what conditions, other than the numbers forming an arithmetic sequence, can we always have yz>xt?
  4. Let x,y,z,t be consecutive positive even numbers. Prove that yz-xt=8.
  5. Let x,y,z,t be consecutive positive odd numbers. Prove that yz-xt=8.


In the spirit of today’s occasion, the poster finds it appropriate to appreciate God for a certain Thursday, June 14, 2018.

Thursday, June 14, 2018. Beautiful, beautiful day. Thursday, June 14, 2018. Beautiful, beautiful day. The poster can’t refrain from singing this refrain again and again. He’s got chance today; he just can’t refrain; he just chants that refrain.

No doubt we should keep our personal things to ourselves, but the poster couldn’t help it this time, especially considering the coincidence with today’s date, today’s event, and “that Thursday”. The magnitude of what happened makes the poster to offer tribute and gratitude to The One whose gracious attribute makes Him to distribute good things generously to all men.

So, what happened exactly? Refer to a strange word the poster used at the beginning of this post, namely “HTMLy”. Read it as “each-team-ly” (imagine how a 2 year old might pronounce it \cdots). “HTMLy” was coined to capture two words: HTML and extremely. “That Thursday” is extremely significant to the poster because that was the day the poster was introduced to \cdots you guessed it \cdots HTML. That singular and spectacular Thursday transformed the poster’s way of thinking, the poster’s way of teaching, and — of course — the poster’s way of “thanking”.

Did you get the point the poster is trying to make? Make it a point of duty to be grateful, even for things that are little.