English

The Jack Daniels Problem

Number Theory 2015-12-31 v2

Abstract

In 1975 Ogg offered a bottle of Jack Daniels for an explanation of the fact that the prime divisors of the order of the monster are the primes p for which the characteristic p supersingular j-invariants are all defined over the field with p elements. This coincidence is often suggested to be the first hint of monstrous moonshine, the deep unexpected interplay between the monster and modular functions. We revisit Ogg's problem, and we point out (using existing tools) that the moonshine functions for order p elements give the set of characteristic p supersingular j-invariants (apart from 0 and 1728). Furthermore, we discuss this coincidence of the two seemingly unrelated sets of primes using the first principles of moonshine.

Cite

@article{arxiv.1411.5354,
  title  = {The Jack Daniels Problem},
  author = {John F. R. Duncan and Ken Ono},
  journal= {arXiv preprint arXiv:1411.5354},
  year   = {2015}
}

Comments

9 pages, 3 tables, final version, to appear in Journal of Number Theory

R2 v1 2026-06-22T07:05:05.119Z