Re: Lucas super-pseudoprime puzzle
- --- In email@example.com,
"djbroadhurst" <d.broadhurst@...> wrote:
> Puzzle: Find the smallest composite integer n > 7056721More offers of help have come in.
> such that V(a,1,n) = a mod n, for every integer a.
So far, these are the volunteers:
job=0: David Broadhurst: completed
job=1: allocated to David Cleaver
job=2: allocated to Kevin Acres
job=3: allocated to Mike Oakes
job=4: allocated to Christ van Willegen
job=5: allocated to Ray Chandler
job=6: David Broadhurst: running
job=7: David Broadhurst: running
job=8: allocated to David Cleaver
We are now also testing the range n > 79397009999,
where there are an infinite number of slots. If you
would like one of these, please reply off-list.
- --- In firstname.lastname@example.org, "djbroadhurst" <d.broadhurst@...> wrote:
>You did very much what I did.
> I tried 1/n^c:
> v=[1237.1, 328.7, 105.4, 28.01, 6.22 , 1.510, 0.439, 0.0939];
> [0.5815, 0.5805, 0.5682, 0.5691, 0.5785, 0.5821, 0.5780, 0.5856]
> and then A/n^c, using the first datum to remove A:
> [0.5756, 0.5348, 0.5484, 0.5747, 0.5827, 0.5750, 0.5885]
> In both cases c =~ Euler looks rather convincing,
> given the statistics. Well spotted, Sir!
I nearly fell off the chair when I averaged everything out and saw 0.57... :-)
> How strongly are you committed to A = 1, for the average,Not very.
> given the variability of the overall factor with a?
Would you buy an appeal to Occam's razor, mon vieux?