This page gives solutions of the MPFR team to the practice problems of the Many Digits Friendly Competition. A companion page exists for the competition problems. The given timings were obtained on harif.cs.ru.nl, a mono-processor AMD Opteron 144 machine running Debian GNU/Linux "sid" unstable i386 (32 bit mode), which has 4GB of RAM. We used gmp-4.1.4, mpfr-20050920 (cvs version from 20 Sep 2005), and mpfi-1.3.3 (adapted to mpfr-cvs). The methods used in the different programs are explained here. We recall here the rule to find the ``optimal'' parameter N: "find the N closest to the default value so that the cpu time fits between 2 seconds and 2 minutes".
problem | N | cpu time | first..last digits |
P01 | 5 | 18.062 | 678...645 |
P02 | 6 | 23.310 | 772...944 |
P03 | 5 | 8.251 | 410...508 |
P04 | 5 | 3.271 | 999...658 |
P05 | 5 | 5.213 | 104...929 |
P06 | 5 | 8.056 | 490...892 |
P07 | 6 | 13.853 | 226...815 |
P08 | 5 | 5.466 | 613...362 |
P09 | 5 | 18.864 | 000...306 |
P10 | 5 | 6.684 | 000...000 |
P11 | 5 | 22.439 | 145...390 |
P12 | 5 | 14.292 | 712...771 |
P13 | 4 | 8.804 | 824...580 |
P14 | 2 | 29.591 | 999...999 |
P15 | 5 | 6.300 | 392...432 |
P16 | 5 | 68.860 | 326...023 |
P17 | 3 | 3.070 | 014...886 |
P18 | 5 | 24.165 | 577...897 |
P19 | 6 | 3.372 | 143...250 |
P20 | 6 | 27.138 | 1 |
P21 | 5 | 15.096 | 219...495 |
P22 | 3 | 15.931 | 430...309 |
P23 | 2 | 2.698 | 9844998112 |
P24 | 2 | 0.196 | 2933301369 |