@@ -0,0 +1,1135 @@
+/*%0A */%0A%0Apackage io.github.olyutorskii.doubdabc;%0A%0Aimport java.math.BigInteger;%0A%0A/**%0A * Mersenne Prime #32 to decimal converting benchmark test.%0A *%0A * It takes about 120sec on (Core i5 2.6GHz + JDK1.8(64bit))%0A * @see %3Ca target=%22_blank%22%0A * href=%22https://en.wikipedia.org/wiki/Mersenne_prime%22%3EMersenne prime%3C/a%3E%0A */%0Apublic class MPrimeBench %7B%0A%0A    static final int PWR = 756839;   // Mersenne Prime #32 is 2%5E756839 -1%0A    static final int COLS = 227832;  // *log10(2) +1%0A%0A    public static void main(String%5B%5D args)%7B%0A        System.out.print(%22Mersenne Prime #32 (2%5E756839 -1) = %22);%0A        dumpM32();%0A        return;%0A    %7D%0A%0A    static void dumpM32()%7B%0A        BcdRegister br = new BcdRegister(COLS);%0A        BcdSequence bs = new BcdSequence(br);%0A        for(int ct = 0; ct %3C PWR; ct++)%7B%0A            br.pushLsb(1);%0A        %7D%0A        System.out.println(bs);%0A        return;%0A    %7D%0A%0A    //  fast but spawning garbages hell, maybe%0A    static void dumpM32_BigInt()%7B%0A        BigInteger twopow = BigInteger.ONE.shiftLeft(PWR);%0A        BigInteger mprime = twopow.subtract(BigInteger.ONE);%0A        System.out.println(mprime);%0A        return;%0A    %7D%0A%0A%7D%0A

add Mersenne prime#32 to decimal converting benchmark test