**Next message:**Harvey Newstrom: "RE: "analog computer" = useless hypothesis?"**Previous message:**J. R. Molloy: "Re: "analog computer" = useless hypothesis?"**Maybe in reply to:**Lee Corbin: "Unprovability"**Next in thread:**zeb haradon: "Re: Unprovability"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ]

In a message dated 4/4/01 1:28:37 PM, scerir@libero.it writes:

*>Actually P. Erdos and M. Kac published a (little
*

*>known) theorem. This theorem states that if we plot
*

*>the number of prime factors of *very large* numbers,
*

*>we get a *bell* curve ! Almost as these numbers were
*

*>choosing their prime factors *at random*.
*

Sounds like just the central limit theorem to me.

The chance that a large number is divisible by a

small number is a pretty good random function, if

you don't know the number, and if you're considering

all numbers, you obviously don't.

**Next message:**Harvey Newstrom: "RE: "analog computer" = useless hypothesis?"**Previous message:**J. R. Molloy: "Re: "analog computer" = useless hypothesis?"**Maybe in reply to:**Lee Corbin: "Unprovability"**Next in thread:**zeb haradon: "Re: Unprovability"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ]

*
This archive was generated by hypermail 2b30
: Mon May 28 2001 - 09:59:44 MDT
*