P is for Practical PerlMonks

### Re^3: Challenge: Chasing Knuth's Conjecture

by tall_man (Parson)
 on Mar 29, 2005 at 20:07 UTC ( #443242=note: print w/replies, xml ) Need Help??

in reply to Re^2: Challenge: Chasing Knuth's Conjecture
in thread Challenge: Chasing Knuth's Conjecture

I computed an answer for 38 with my modified version of hv's program, using logs. The result is:
```"sssssssssfsssssssssssfssssssfssssssfssssssfssssssssssfssssssssfssssss
+ssfssssssfssssssfssssfssssssssfsfssfssssssfsssssfssfsfssff"

I confirmed this answer with Math::Pari, and it is correct. The highest factorial required is 1861.

Replies are listed 'Best First'.
Re^4: Challenge: Chasing Knuth's Conjecture
by Roy Johnson (Monsignor) on Mar 30, 2005 at 01:19 UTC
My code looks like it agrees with yours; I set the factorial limit to 5000, and it ran for 20 or 30 minutes, I think. 64 is the first skip at that setting.

I did a simple translation of your Inline C sub into Perl, and it is still very fast. Running it for 64 took 33 seconds, and it popped out:

```64 => sssssssssfssssssfsssssssssssssfsssssssssssfssssssssssssfssssssss
+ssfssssssf
ssssssssfsssssssssfsssssssssssfsssssssfssssssfsssssssssssfssssssssfsss
+ssssssssfs
sssssfssssssfssssssfssssssssssfssssssssfssssssssfssssssfssssssfssssfss
+ssssssfsfs
sfssssssfsssssfssfsfssff
biggest tried was 5071

Code follows.

Caution: Contents may have been coded under pressure.

Create A New User
Node Status?
node history
Node Type: note [id://443242]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2020-01-27 10:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The worst excuse I have ever heard is:

Results (112 votes). Check out past polls.

Notices?