Tasmania, Australia

Christopher Beach

I've been building software for around thirty years.

I run Books.org, a community for readers, and build AstroSat, a satellite trail forecaster for astrophotographers. I sit on the board of the International Space Association, where I've served since 2018, and I'm Strategic Technical Advisor to Work Metrics.

I'm interested in astronomy and mathematics. My earlier mathematical interests included Markov chains, and I recently published a proof of Kotesovec's conjecture about OEIS sequence A188115.

Portrait of Christopher Beach

Recently published proof

A proof of Kotesovec's conjecture for OEIS sequence A188115

Take the whole numbers from −n to n and leave out zero. Now choose n different ones that add up to exactly zero. When n is 3 there are two ways: −3, 1, 2 and −2, −1, 3. Sequence A188115 in the On-Line Encyclopedia of Integer Sequences counts the ways for each n, and the counts climb quickly. From n = 2 they run 2, 2, 8, 16, 52, 152, 484.

The exact counts take real work to compute, so it helps to know roughly how big they get. Vaclav Kotesovec conjectured that for large n the count is close to

√3 × 4n / (π × n2)

which means each step up in n multiplies the count by a little under four. The formula matched the computed values, but that is not the same as knowing it always will. My proof shows that it does: the larger n gets, the closer the formula comes to the true count.

oeis.org/A188115