Newsgroups: sci.math
From: hoey@AIC.NRL.Navy.Mil (Dan Hoey)
Date: Fri, 1 Jul 1994 21:49:06 GMT
Subject: Re: Multiplicative Persistence (was: Solve this funny problem...)

Yesterday I wrote:

> The number of N-digit low-pf numbers increases quadratically with
> N, but (assuming the digit "5" appears with positive density) the
> probability that the product of the digits is nonzero decreases
> exponentially.

I should of course have spoken of the digit "0".

Also, I have extended the search to 10^200, and it appears that the
largest low-pf number of multiplicative persistence greater than one
is the 140-digit number 2^25 3^227 7^28.

Dan Hoey
Hoey@AIC.NRL.Navy.Mil