John D. Cook

These were the most popular posts from 2021 on this site, listed in chronological order. Simple gamma approximation Floor, ceiling, bracket Evolution of random number generators Format text in twitter Where has all the productivity gone? Computing zeta(3) Morse code palindromes Much less than, much greater than Monads and macros Partial functionsThe post Most popular posts of 2021 first appeared on John D. Cook.

Sine and cosine have power series with simple coefficients, but tangent does not. Students are shocked when they see the power series for tangent because there is no simple expression for the power series coefficients unless you introduce Bernoulli numbers, and there’s no simple expression for Bernoulli numbers. The perception is that sine and cosine […]The post The exception case is normal first appeared on John D. Cook.

Marcel Golay noticed that and realized that this suggested it might be possible to create a perfect code of length 23. I wrote a Twitter thread on this that explains how this relates to coding theory (and to sporadic simple groups). This made me wonder how common it is for cumulative sums of binomial coefficients […]The post Binomial sums and powers of 2 first appeared on John D. Cook.

The Christmas hymn “O Come, O Come, Emmanuel” is a summary of the seven “O Antiphons,” sung on December 17 though 23, dating back to the 8th century [1]. The seven antiphons are O Sapientia O Adonai O Radix Jesse O Clavis David O Oriens O Rex Gentium O Emmanuel The corresponding verses of “O […]The post O Come, O Come, Emmanuel: condensing seven hymns into one first appeared on John D. Cook.

Yesterday I wrote about how to multiply octets of real numbers, the octonions. Today I’ll show how to create an error correcting code from the octonions. In fact, we’ll create a perfect code in the sense explained below. We’re going to make a code out of octonions over a binary field. That is, we’re going […]The post Error correcting code from octonions first appeared on John D. Cook.

Yesterday I wrote about the fact that quaternions, unlike complex numbers, can form conjugates via a series of multiplications and additions. This post will show that you can do something similar with octonions. If x is an octonion x = r0 e0 + r1 e1 + … + r7 e7 where all the r‘s are […]The post Conjugate theorem for octonions first appeared on John D. Cook.

This post will present a way of multiplying octonions that’s easy to remember. Please note that there are varying conventions for how to define multiplication for octonions [1]. Octonions The complex numbers have one imaginary unit i, and the quaternions have three: i, j, and k. The octonions have seven, and so it makes sense […]The post How to multiply octonions first appeared on John D. Cook.

The conjugate of a complex number is the complex number Taking the conjugate flips over a complex number, taking its reflection in the real axis. Multiplication stretches and rotates complex numbers, and addition translates complex numbers. You can’t flip the complex plane over by any series of dilatations, rotations, and translations. The situation is different […]The post Complex Conjugates versus Quaternion Conjugates first appeared on John D. Cook.

“… Things fall apart; the centre cannot hold …” — Yeats, The Second Coming Center of a group The center of a group is the set of elements that commute with everything else in the group. For example, matrix multiplication is not commutative in general. You can’t count on AB being equal to BA, […]The post The center may not hold first appeared on John D. Cook.

A positive integer n is said to be congruent if there exists a right triangle with area n such that the length of all three sides is rational. You could always choose one leg to have length n and the other to have length 2. Such a triangle would have area n and two rational […]The post The congruent number problem first appeared on John D. Cook.

We think they like randomness in design, but we don’t exactly. People like things that are sorta random, but not too random. When you literally scatter things randomly, they looked too clumped [1]. There are many ways around this problem, variations on randomness that people find more aesthetically pleasing. One of these ways is random […]The post Aesthetic uses of Latin squares first appeared on John D. Cook.

There’s a saying in the arts “Know the rules before you break the rules.” Master the classical conventions of your field before you violate them. Break the rules deliberately and not accidentally, skillfully and not due to a lack of skill. There’s a world of difference between a beginning musician playing a wrong note and […]The post Know the rules to break the rules first appeared on John D. Cook.

A Latin square is an n × n grid with a number from 1 to n in each cell, such that no number appears twice in a row or twice in a column. It’s not obvious that Latin squares exist for all n, but they do, and in fact there are a lot of them. […]The post How many Latin squares are there? first appeared on John D. Cook.

I recently wrote about the Yule-Simon distribution. The same Yule, George Udny Yule, is also known for the statistics Yule’s Y and Yule’s Q. The former is also known as the coefficient of colligation, and the latter is also known as the Yule coefficient of association. Both measure how things are related. Given a 2 […]The post Yule statistics Y and Q first appeared on John D. Cook.

Imagine you could list the contents of a directory from a command line, and then edit the text output to make things happen. That’s sorta how Emacs dired works. It’s kind of a cross between a bash shell and the Windows File Explorer. Why would you ever want to use such a bizarre hybrid? One […]The post Deleting reproducible files in Emacs dired first appeared on John D. Cook.

A few years ago the scientific community suddenly realized that a lot of scientific papers were wrong. I imagine a lot of people knew this all along, but suddenly it became a topic of discussion and people realized the problem was bigger than imagined. The layman’s first response was “Are you saying scientists are making […]The post Fraud, Sloppiness, and Statistics first appeared on John D. Cook.

Yesterday I wrote about the zeta distribution and the Yule-Simon distribution and said that they, along with the Zipf distribution, are all discrete power laws. This post fills in detail for that statement. The probability mass functions for the zeta, Zipf, and Yule-Simon distributions are as follows. Here the subscripts ζ, y, and z stand for […]The post Comparing three discrete power laws first appeared on John D. Cook.

The previous post on the Yule-Simon distribution mentioned the zeta distribution at the end. This is a powerlaw distribution on the positive integers with normalizing constant given by the Riemann zeta distribution. That is, the zeta distribution has density f(k; s) = k–s / ζ(s). where k is a positive integer and s > 1 is […]The post The zeta distribution first appeared on John D. Cook.

The Yule-Simon distribution, named after Udny Yule and Herbert Simon, is a discrete probability with pmf The semicolon in f(k; ρ) suggests that we think of f as a function of k, with a fixed parameter ρ. The way the distribution shows the connection to the beta function, but for our purposes it will be […]The post Yule-Simon distribution first appeared on John D. Cook.

I was reading a stats book that mentioned Mahalanobis distance and that made me think of Non Nobis from Henry V, a great scene in a great movie. As far as I know, there’s no connection between Mahalanobis and Non Nobis except that both end in “nobis.” Since Mahalanobis is an Indian surname and Non […]The post Mahalanobis distance and Henry V first appeared on John D. Cook.

Take a permutation of the numbers 1 through n² and lay out the elements of the permutation in a square. We will call a permutation a magic permutation if the corresponding square is a magic square. What is the probability that a permutation is a magic permutation? That is, if you fill a grid randomly […]The post Probability of a magical permutation first appeared on John D. Cook.

A square grid of distinct integers is a magic square if all its rows columns and full diagonals have the same sum. Otherwise it is not a magic square. Now suppose we fill a square grid with samples from a continuous random variable. The probability that the entries are distinct is 1, but the probability […]The post Degree of magic first appeared on John D. Cook.

I started to write a blog post about universal properties, but ended up writing a Twitter thread instead.The post Universal properties first appeared on John D. Cook.

Rings made a bad first impression on me. I couldn’t remember the definitions of all the different kinds of rings, much less have an intuition for what was important about each one. As I recall, all the examples of rings in our course were variations on the integers, often artificial variations. Entire functions I’m more […]The post The ring of entire functions first appeared on John D. Cook.

Abstract algebra is basically the study of groups, rings, and fields. There are more concepts, but these are the big three. Groups have the least structure and fields have the most structure. Rings are somewhere in the middle. Groups have just one operation, which is thought of as multiplication by default. If the group operation […]The post The awkward middle child of algebra first appeared on John D. Cook.

I was thinking about writing a post about entire functions and it occurred to me that I should say something about how entire functions are unrelated to total functions. But then I realized they’re not unrelated. I intend to say something about entire functions in a future post. Update: See The ring of entire functions. […]The post Partial functions and total functions first appeared on John D. Cook.

A couple days ago, near the end of a post, I mentioned exact sequences. This term does not mean what you might reasonably think it means. It doesn’t mean exact in the sense of not being approximate. It means that the stuff that comes out of one step is exactly the stuff that gets set […]The post Exact sequences first appeared on John D. Cook.

I recently heard the term data swamp, a humorous take on data lakes. I thought about data swamps yesterday when I hiked past the literal swamp in the photo above. Swamps are a better metaphor than lakes for heterogeneous data collections because a lake is a homogeneous body of water. What makes a swamp a […]The post Data swamps first appeared on John D. Cook.

Yesterday’s post said that that you could construct a chain of linear relationships between the hypergeometric function F(a, b; c; z) and F(a+i, b+j; c+k; z) for integers i, j, and k. Toward the end of the post I said that this could be used to speed up programs by computing function values from previous […]The post Numerical footnote first appeared on John D. Cook.

This post is similar in spirit to the previous post: reducing mathematical theorems to moves in a board game by looking at things from a ridiculously high level. The theorems we’ll be looking at are known as the four lemma, the five lemma, and the nine lemma. The nine lemma is also known as the […]The post Four, five, and nine lemmas first appeared on John D. Cook.

Let’s play a game that’s something like Go in three dimensions. Our game is played on the lattice of points in 3D that have integer coordinates. Someone places stones on two lattice points, and your job is to create a path connecting the two stones by adding stones to neighboring locations. Game cube We don’t […]The post 3D Go with identities first appeared on John D. Cook.

A few days ago I wrote about how you could calculate the area of a spherical triangle by measuring the angles at its vertices. As was pointed out in the comments, there’s a much more direct way to find the area. Folke Eriksson gives the following formula for area in [1]. If a, b, and […]The post Area of spherical triangle first appeared on John D. Cook.

The previous post was about triangles on a sphere. This post will be about triangles on a pseudosphere. A pseudosphere looks something like the bell of a trumpet or a trombone. Here’s a plot of a pseudosphere. This was created in Mathematica with the code ParametricPlot3D[ { Cos[p] Sech[t], -Sin[p] Sech[t], t - Tanh[t] }, […]The post Triangles on a pseudosphere first appeared on John D. Cook.

Pick three cities and form a spherical triangle by connecting each pair of cities with the shortest arc between them. How might you find the area of this triangle? For this post, I’ll assume the earth is perfectly spherical. (Taking into account that the earth is slightly oblate makes the problem much more complicated. Maybe […]The post A tale of three cities first appeared on John D. Cook.

Given two points on a unit sphere, there is a unique great circle passing through the two points. This post will show two ways to find a parameterization for this circle. Both approaches have their advantages. The first derivation is shorter and in some sense simpler. The second derivation is a little more transparent and […]The post Great circle through two points on a sphere first appeared on John D. Cook.

Wire gauge is a perennial source of confusion: larger numbers denote smaller wires. The reason is that gauge numbers were assigned from the perspective of the manufacturing process. Thinner wires require more steps in production. This is a common error in user interface design and business more generally: describing things from your perspective rather than […]The post Wire gauge and user perspective first appeared on John D. Cook.

I’ve started a new Twitter account: @tensor_fact. The word “tensor” is used to describe several different but related mathematical objects. My intention, at least for now, it to focus on tensor calculus: things with indices that obey certain transformation rules. More on other meanings of tensor here. Related From tape measures to tensors Technical Twitter […]The post New twitter account: tensor_fact first appeared on John D. Cook.

I skipped a step in the previous post, not showing how a series was put into the form of a hypergeometric function. Actually I skipped two steps. I first said that a series was not obviously hypergeometric, and yet at first glance it sorta is. I’d like to make up for both of these omissions, […]The post How to put a series in hypergeometric form first appeared on John D. Cook.

This post looks at an exercise from Special Functions, exercise 6 in Appendix E. Suppose that xm+1 + ax – b = 0. Show that Use this formula to find a solution to x5 + 4x + 2 = 0 to four decimal places of accuracy. When m = 0 this series reduces to the […]The post Quintic trinomial root first appeared on John D. Cook.

Theory and practice are both important. As Donald Knuth put it, If you find that you’re spending almost all your time on theory, start turning some attention to practical things; it will improve your theories. If you find that you’re spending almost all your time on practice, start turning some attention to theoretical things; it […]The post Theory, practice, and integration first appeared on John D. Cook.

John Baez, Tobias Fritz, and Tom Leinster wrote a nice paper [1] that shows Shannon entropy is the only measure of information loss that acts as you’d expect, assuming of course you have the right expectations. See their paper for all the heavy lifting. All I offer here is an informal rewording of the hypotheses. […]The post Information loss and entropy first appeared on John D. Cook.

Let p(M, N, n) be the number of partitions of the integer n into at most M parts, each containing integers at most N. Then p(M, N, n) = p(N, M, n). That is, you can swap the size of the partition multisets and the upper bound on the elements in the multisets. For example, […]The post Partition symmetry first appeared on John D. Cook.

The previous post used the Lambert W function to solve an equation that came up in counting partitions of an integer. The first solution found didn’t make sense in context, but another solution, one on a different branch, did. The default branch k = 0 wasn’t what we were after, but the branch k = […]The post Numbering the branches of the Lambert W function first appeared on John D. Cook.

In the previous post we wanted to find a value of n such that f(n) = 1012 where and we took a rough guess n = 200. Turns out f(200) ≈ 4 × 1012 and that was good enough for our purposes. But what if we wanted to solve f(n) = x accurately? We will […]The post Solving equations with Lambert’s W function first appeared on John D. Cook.

Last week I wrote a few posts that included code that iterated over all partitions of a positive integer n. See here, here, and here. How long would it take these programs to run for large n? For this post, I’ll focus just on how many partitions there are. It’s interesting to think about how […]The post Estimating the number of integer partitions first appeared on John D. Cook.

A surprising amount of linear algebra doesn’t depend on the field you’re working over. You can implicitly assume you’re working over the real numbers R and prove all the basic theorems—say all the theorems that come before getting into eigenvalues in a typical course—and all or nearly all of the theorems remain valid if you swap […]The post Vector spaces and subspaces over finite fields first appeared on John D. Cook.

The simplest instance of a q-analog in math is to replace a positive integer n by a polynomial in q that converges to n as q → 1. Specifically, we associate with n the polynomial [n]q = 1 + q + q² + q³ + … + qn-1. which obviously converges to n when q → 1. […]The post Mathematical plot twist: q-binomial coefficients first appeared on John D. Cook.

An earlier post presented Euler’s pentagonal number theorem. This post presents a similar theorem by N. J. Fine developed two centuries later. Define the jth pentagonal number by Pj = j(3j – 1) / 2 where j can be any integer, e.g. j can be negative. Theme Let De(n) is the number of distinct partitions […]The post Another pentagonal number theorem first appeared on John D. Cook.

The previous post looked at a result of Euler regarding even and odd distinct partitions. This post will illustrate a related theorem by Euler. Definitions A partition of a positive integer n is a way of writing n as the sum of positive integers, without distinguishing the order of the terms, only the multi-set of […]The post Odd parts and distinct parts first appeared on John D. Cook.

This post will present a remarkable theorem of Euler which makes a connection between integer partitions and pentagons. Partitions A partition of an integer n is a way of writing n as a sum of positive integers. For example, there are seven unordered partitions of 5: 5 4 + 1 3 + 2 3 + […]The post Partitions and Pentagons first appeared on John D. Cook.