Sequence: smallest number with exactly n divisors: Difference between revisions

Content added Content deleted

Inline

@@ Line 421: / Line 421: @@
 It takes longer, afaict, to print the answers than it did to calculate them, tee hee!
 {{out}}
--bit (as shown) manages 8 more answers than 32-bit, which as per limit halts on 58 (on 32 bit the accuracy limit is 2^53, hence the result for 59, which is 2^58, gets printed wrong since the first /10 needed to print it rounds to the nearest 16 or so).
+-bit (as shown) manages 8 more answers than 32-bit, which as per limit halts on 58: on 32 bit the accuracy limit is 2^53, hence the result for 59, which is 2^58, would get printed wrong since the first /10 needed to print it rounds to the nearest 16 or so. It is quite probably perfectly accurate internally up to much higher limits, but proving/showing that is a bit of a problem, which would in turn probably be easiest to solve by simply rewriting this to use gmp/mpir.
 <pre>
 ->1