Oxford University Press is delighted to provide this web site that
contains a smorgasbord of computer program listings for Clifford A. Pickover's
Wonders of Numbers. Readers have often requested on-line code that
they can study and with which they may easily experiment. We hope the
code clarifies some of the concepts discussed in Wonders of Numbers.
See the chapters in the book for additional explanations.
Color images are also provided here for several of the black and white
figures in the book. Visit the author's web page, www.pickover.com,
for updates on Cliff Pickover's research and artworks.
Note:
Joseph F. Pycior from San Jose, California writes, "I converted the
polygonal number program to Fortran, and found it ironic that I had to
use floating point numbers to produce the polygonal numbers, because
integers were inadequate. I computed as high as 11-sided polygons and
was amazed the numbers didn't become large as fast as I expected."
Note:
Youry Vymenets from St.Petersburg University, Russia says, "I'm afraid
the factorions (F) will be lonely forever. This is sad, but a lot of
people rest alone throughout their entire life without even a single
companion...." He goes on to prove his statement (about factorions, not
about life), and has given Dr. Googol permission to reproduce his C
code for brute-force search of F. The C program searches all numbers
less than 108. The program works for several minutes and yields only the two known multi-digit factorions.
Note: Herve Bronninan from Princeton
University has also conducted research in the existence of factorions.
The above is his C code for searching for such numbers.
留言列表