The strong law of small numbers

  title={The strong law of small numbers},
  author={Richard K. Guy},
  journal={American Mathematical Monthly},
  • R. Guy
  • Published 1 October 1988
  • Mathematics
  • American Mathematical Monthly
This article is in two parts, the first of which is a do-it-yourself operation, in which I'll show you 35 examples of patterns that seem to appear when we look at several small values of n, in various problems whose answers depend on n. The question will be, in each case: do you think that the pattern persists for all n, or do you believe that it is a figment of the smallness of the values of n that are worked out in the examples? Caution: examples of both kinds appear; they are not all… 

Figures and Tables from this paper

Some Fundamental Theorems in Mathematics

An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 135 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful

Prime Number Races

This paper describes in greater detail the phenomena that Chebyshev noticed that for any given value of x, there always seem to be more primes of the form 4n+3 less than x then there are of theform 4n-1.

On the Middle Coefficient of a Cyclotomic Polynomial

This article provides a short and elementary proof of the following result: Clearly (, has degree 0 (n), where 0 signifies Euler's totient function.

The Unity of Combinatorics Reviewed by Igor Pak

“What is a book? A book is just built from base to roof on ideas, and there can be no property in it.” [10] Sidestepping the copyright issue, the unnamed chairman had a point. In the year 2021, in

Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences

Pisot sequences (sequences $a_n$ with initial terms $a_0=x, a_1=y$, and defined for $n>1$ by $a_n= \lfloor a_{n-1}^2/a_{n-2} + \frac{1}{2} \rfloor$) often satisfy linear recurrences with constant

Illustrations of a Realist Methodology for the Philosophy of Mathematics

This dissertation outlines and illustrates a methodological position most naturally described as realist. The kind of realism advanced and employed, however, has its most familiar analogue in legal

The Surprising Accuracy of Benford’s Law in Mathematics

Benford’s law is proved to be an empirical “law” governing the frequency of leading digits in numerical data sets, and the observed behavior is related to classical results in Diophantine approximation as well as recent deep conjectures in this area.

Strong Laws of Small Primes

“The Strong Law of Small Numbers” is the provocative title of an unpublished paper by Richard Kenneth Guy, a mathematician at the University of Calgary. For many years Guy has edited the “Research

Computer analysis of Sprouts

A computer program is written to analyze the n-spot game of Sprouts for general n and supports the Sprouts Conjecture: the rst player loses if n is 0, 1 or 2 modulo 6 and wins otherwise.

Experimentation and Conjecture Are Not Enough.

This is an exciting time in mathematics. Its various special areas are coming together to emphasize the discipline's unity. In addition, there is general growing recognition that good teaching cannot



The Evidence for Fortune's Conjecture

Euclid's proof that there are infinitely many primes is based on the observation that if En = Pn + 1 is not itself prime (where Pn =P1P2 p Pn is the product of the first n primes), it must still

Strike it out—add it up

  • C. Long
  • Education
    The Mathematical Gazette
  • 1982
If you were to ask a random sample of students from your school if they liked mathematics, what do you suppose their responses would be? Almost certainly most of them would respond negatively and

John Isbell's Game of Beanstalk and John Conway's Game of Beans-Don't-Talk

John Isbell's game is played between Jack and the Giant. The Giant chooses a positive integer, say no. Then Jack and the Giant play alternately nl, n2, n3,... according to the rule f ni/2 if ni is

Catalan Strikes Again! How Likely Is a Function to Be Convex?

How to write a paper? An intriguing title is a good start. But what then? If we polish it until it shines, and it manages to get past editor and referee, will it show the sweat and pain that went

Bounds for the R-th Coefficients of Cyclotomic Polynomials

We consider the cyclotomic polynomials ~m(z) _ Fl (z-e(m/n)), m=1 (m, n)= 1 where e(a) = e2nia and write (Dn in the form n (1) 0(n) (D n(z) _ y_ a,(n)zr, (2) r=o where a) is Euler's function. Bounds

Factors of Fermat numbers and large primes of the form ⋅2ⁿ+1

A new factor is given for each of the Fermat numbers F52, F931, F6835, and F9448. In addition, a factor of F75 discovered by Gary Gostin is presented. The current status for all F, is shown in a

The twentieth Fermat number is composite

The authors proved that F20 = 2220 +1, which had been the smallest Fermat number of unknown character, is composite, and this computation, written entirely in Cray Fortran and called Cray library functions for the FFT's, would be impossible to do even on supercomputers without fast Fourier transform techniques for integer multiplication.

On a conjecture concerning the primes

9. I.Roman, "An Euler summation formula, "Am. Math. Monthly, v. 43, 1936, p. 9-21. 10. H. E. Salzer, "A simple method for summing certain slowly convergent series," J. Math and Phys., v. 33, 1954, p.

A report on prime numbers of the forms =(6+1)2^{2-1}-1 and ^{’}=(6-1)2^{2}-1

A programme which first eliminated, by a preliminary sieving process, values of M and M' with small prime divisors and then applied the above theorem, as a test for primality, on the remaining

Unsolved Problems in Number Theory

This monograph contains discussions of hundreds of open questions, organized into 185 different topics. They represent aspects of number theory and are organized into six categories: prime numbers,