Clean vetted C program for Collatz total stopping time records (Updated)

So, I’m now advancing by 10 steps at a time by looking at the 10 least significant bits of an iterate `k’ of the starting number `n’. This is explained in some papers on verifying Collatz (look-up table method). My look-up table is in two parts, two files of 1024 medium-sized integers, one per residue… Continue reading Clean vetted C program for Collatz total stopping time records (Updated)

Published
Categorized as History

A 2048-bit (617 digits) RSA public key, can you factor?

n = 2785840028567972318877793328371264295128 9579686400775596360785472462618845441045 5911740314074671419279493039672736406033 7058302794346148969461151430784604478860 8302737755893035638149922272068624160730 8509265600340926251564444455649365622976 8865184922341907053233123303032358568101 0618165796464257277453762819678070632408 3470420708019887710588821312286325461074 5189371499124215339565842925953793426320 8634002792828772169217510656239241005311 0756810253940478946614205207009623004455 3396064578711898659087590648512594248362 2981513806162241672544997253865343228332 0255826794762404803840230174943058301948 47248717881628827 Can you factor n ?

Published
Categorized as History

Euler-Mascheroni Constant good to about 316 decimals… (cf. Knuth 1962)

57721 56649 01532 86060 65120 90082 40243 10421 59335 9399235988 05767 23488 48677 26777 66467 09369 47063 29174 6749514631 44724 98070 82480 96050 40144 86542 83622 41739 9764492353 62535 00333 74293 73377 37673 94279 25952 58247 0949160087 35203 94816 56708 53233 15177 66115 28621 19950 1507984793 74508 57057 40029 92135 47861 46694 02960 43254 2151905877… Continue reading Euler-Mascheroni Constant good to about 316 decimals… (cf. Knuth 1962)

Published
Categorized as History