From: kramsay@aol.commangled (Keith Ramsay)
Subject: Re: Mathematics trivium
Date: 17 Dec 1999 04:58:44 GMT
Newsgroups: sci.math
Keywords: big numbers in proofs (Friedman -- strings in alphabets)
In article <838305$sqn$1@newsflash.concordia.ca>,
mckay@cs.concordia.ca (MCKAY john) writes:
|What is the exact size of the largest finite set studied in mathematics?
Part of what is tough is that so many of the things which generate
large numbers are parametrized, and it's harder to know in which cases
a specific case has been taken up for study.
Harvey Friedman has an example of a large number which he's "sprung"
on various people, and maybe it would almost count. Given a finite
alphabet, consider the length of the longest string a1,...,aN of
letters for which for no i