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".

problemNcpu timefirst..last digits
P01518.062678...645
P02623.310772...944
P0358.251410...508
P0453.271999...658
P0555.213104...929
P0658.056490...892
P07613.853226...815
P0855.466613...362
P09518.864000...306
P1056.684000...000
P11522.439145...390
P12514.292712...771
P1348.804824...580
P14229.591999...999
P1556.300392...432
P16568.860326...023
P1733.070014...886
P18524.165577...897
P1963.372143...250
P20627.1381
P21515.096219...495
P22315.931430...309
P2322.6989844998112
P2420.1962933301369
The source files need the many.h header file, P23 and P24 need gauss.h too, and P22 needs the intlib library from Laurent Fousse (not yet available).