[Jprogramming] Non-Bouncing Numbers

[Roger Hui]

The actual MathsChallenge problem is for the number
of solutions less than a googol (10^100x).  It is 
the number of solutions less than a googolplex (10^10^100x) 
which has 994 digits.  Knowing this fact is no help
whatsoever in answering the original official problem.



----- Original Message ----- 
From: "Randy MacDonald" <ramacd at nbnet.nb.ca>
To: "Programming forum" <programming at jsoftware.com>
Sent: Sunday, February 12, 2006 8:29 AM
Subject: Re: [Jprogramming] Non-Bouncing Numbers

To most humans perhaps. Knowing the answer has 994 digits definitely affects
my solution paths. Again, waiting until March to discuss this problem in
public would be appreciated.



----- Original Message ----- 
From: "Roger Hui" <RHui000 at shaw.ca>
To: "Programming forum" <programming at jsoftware.com>
Sent: Sunday, February 12, 2006 12:13 PM
Subject: Re: [Jprogramming] Non-Bouncing Numbers

> My description does not give anything away.
>
>
>
> ----- Original Message ----- 
> From: "Randy MacDonald" <ramacd at nbnet.nb.ca>
> To: "Programming forum" <programming at jsoftware.com>
> Sent: Sunday, February 12, 2006 8:09 AM
> Subject: Re: [Jprogramming] Non-Bouncing Numbers
>
> I'm not sure that this kind of discussion is appropriate for those of us
who
> are still considering solutions. After all, the problem is only 2 days
old.
> Please wait until March.