sbuild (Debian sbuild) 0.91.5 (17 December 2025) on carme.larted.org.uk +==============================================================================+ | libmath-prime-util-perl 0.74-1 (amd64) Sat, 28 Mar 2026 05:01:40 +0000 | +==============================================================================+ Package: libmath-prime-util-perl Version: 0.74-1 Source Version: 0.74-1 Distribution: sid Machine Architecture: amd64 Host Architecture: amd64 Build Architecture: amd64 Build Type: full I: Setting up the chroot... I: Creating chroot session... I: Setting up log color... +------------------------------------------------------------------------------+ | Chroot Setup Commands Sat, 28 Mar 2026 05:01:40 +0000 | +------------------------------------------------------------------------------+ /usr/share/debomatic/sbuildcommands/chroot-setup-commands/dpkg-speedup libmath-prime-util-perl_0.74-1 sid amd64 --------------------------------------------------------------------------------------------------------------- I: Finished running '/usr/share/debomatic/sbuildcommands/chroot-setup-commands/dpkg-speedup libmath-prime-util-perl_0.74-1 sid amd64'. Finished processing commands. -------------------------------------------------------------------------------- I: Setting up apt archive... +------------------------------------------------------------------------------+ | Update chroot Sat, 28 Mar 2026 05:01:40 +0000 | +------------------------------------------------------------------------------+ Hit:1 http://deb.debian.org/debian unstable InRelease Hit:2 http://deb.debian.org/debian sid InRelease Reading package lists... Reading package lists... Building dependency tree... Reading state information... Calculating upgrade... 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. +------------------------------------------------------------------------------+ | Fetch source files Sat, 28 Mar 2026 05:01:46 +0000 | +------------------------------------------------------------------------------+ Local sources ------------- /srv/debomatic/incoming/libmath-prime-util-perl_0.74-1.dsc exists in /srv/debomatic/incoming; copying to chroot +------------------------------------------------------------------------------+ | Install package build dependencies Sat, 28 Mar 2026 05:01:46 +0000 | +------------------------------------------------------------------------------+ Setup apt archive ----------------- Merged Build-Depends: debhelper-compat (= 13), help2man, libdevel-checklib-perl, libmath-prime-util-gmp-perl, libtest-warn-perl, perl-xs-dev, perl, build-essential Filtered Build-Depends: debhelper-compat (= 13), help2man, libdevel-checklib-perl, libmath-prime-util-gmp-perl, libtest-warn-perl, perl-xs-dev, perl, build-essential dpkg-deb: building package 'sbuild-build-depends-main-dummy' in '/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive/sbuild-build-depends-main-dummy.deb'. Ign:1 copy:/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive ./ InRelease Get:2 copy:/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive ./ Release [609 B] Ign:3 copy:/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive ./ Release.gpg Get:4 copy:/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive ./ Sources [730 B] Get:5 copy:/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive ./ Packages [740 B] Fetched 2079 B in 0s (0 B/s) Reading package lists... Reading package lists... Install main build dependencies (apt-based resolver) ---------------------------------------------------- Installing build dependencies Reading package lists... Building dependency tree... Reading state information... Solving dependencies... The following additional packages will be installed: autoconf automake autopoint autotools-dev bsdextrautils debhelper dh-autoreconf dh-strip-nondeterminism dwz file gettext gettext-base groff-base help2man intltool-debian libarchive-zip-perl libdebhelper-perl libdevel-checklib-perl libelf1t64 libfile-stripnondeterminism-perl liblocale-gettext-perl libmagic-mgc libmagic1t64 libmath-prime-util-gmp-perl libperl-dev libpipeline1 libsub-uplevel-perl libtest-warn-perl libtool libuchardet0 libxml2-16 m4 man-db po-debconf sensible-utils Suggested packages: autoconf-archive gnu-standards autoconf-doc dh-make gettext-doc libasprintf-dev libgettextpo-dev gnulib-l10n groff libtool-doc gfortran | fortran95-compiler m4-doc apparmor less www-browser libmail-box-perl Recommended packages: curl | wget | lynx libarchive-cpio-perl libmath-prime-util-perl libltdl-dev libmail-sendmail-perl The following NEW packages will be installed: autoconf automake autopoint autotools-dev bsdextrautils debhelper dh-autoreconf dh-strip-nondeterminism dwz file gettext gettext-base groff-base help2man intltool-debian libarchive-zip-perl libdebhelper-perl libdevel-checklib-perl libelf1t64 libfile-stripnondeterminism-perl liblocale-gettext-perl libmagic-mgc libmagic1t64 libmath-prime-util-gmp-perl libperl-dev libpipeline1 libsub-uplevel-perl libtest-warn-perl libtool libuchardet0 libxml2-16 m4 man-db po-debconf sbuild-build-depends-main-dummy sensible-utils 0 upgraded, 36 newly installed, 0 to remove and 0 not upgraded. Need to get 12.4 MB of archives. After this operation, 47.5 MB of additional disk space will be used. Get:1 copy:/build/libmath-prime-util-perl-EGLJtV/resolver-IikioG/apt_archive ./ sbuild-build-depends-main-dummy 0.invalid.0 [912 B] Get:2 http://deb.debian.org/debian unstable/main amd64 liblocale-gettext-perl amd64 1.07-8 [15.2 kB] Get:3 http://deb.debian.org/debian unstable/main amd64 sensible-utils all 0.0.26 [27.0 kB] Get:4 http://deb.debian.org/debian unstable/main amd64 libmagic-mgc amd64 1:5.46-5+b1 [338 kB] Get:5 http://deb.debian.org/debian unstable/main amd64 libmagic1t64 amd64 1:5.46-5+b1 [110 kB] Get:6 http://deb.debian.org/debian unstable/main amd64 file amd64 1:5.46-5+b1 [43.8 kB] Get:7 http://deb.debian.org/debian unstable/main amd64 gettext-base amd64 0.23.2-2 [242 kB] Get:8 http://deb.debian.org/debian unstable/main amd64 libuchardet0 amd64 0.0.8-2+b1 [68.8 kB] Get:9 http://deb.debian.org/debian unstable/main amd64 groff-base amd64 1.23.0-10 [1194 kB] Get:10 http://deb.debian.org/debian unstable/main amd64 bsdextrautils amd64 2.41.3-4 [98.9 kB] Get:11 http://deb.debian.org/debian unstable/main amd64 libpipeline1 amd64 1.5.8-2 [42.1 kB] Get:12 http://deb.debian.org/debian unstable/main amd64 man-db amd64 2.13.1-1 [1469 kB] Get:13 http://deb.debian.org/debian unstable/main amd64 m4 amd64 1.4.21-1 [332 kB] Get:14 http://deb.debian.org/debian unstable/main amd64 autoconf all 2.72-6 [494 kB] Get:15 http://deb.debian.org/debian unstable/main amd64 autotools-dev all 20240727.1 [60.2 kB] Get:16 http://deb.debian.org/debian unstable/main amd64 automake all 1:1.18.1-4 [877 kB] Get:17 http://deb.debian.org/debian unstable/main amd64 autopoint all 0.23.2-2 [770 kB] Get:18 http://deb.debian.org/debian unstable/main amd64 libdebhelper-perl all 13.31 [75.7 kB] Get:19 http://deb.debian.org/debian unstable/main amd64 libtool all 2.5.4-9 [540 kB] Get:20 http://deb.debian.org/debian unstable/main amd64 dh-autoreconf all 22 [12.2 kB] Get:21 http://deb.debian.org/debian unstable/main amd64 libarchive-zip-perl all 1.68-1 [104 kB] Get:22 http://deb.debian.org/debian unstable/main amd64 libfile-stripnondeterminism-perl all 1.15.0-1 [19.9 kB] Get:23 http://deb.debian.org/debian unstable/main amd64 dh-strip-nondeterminism all 1.15.0-1 [8812 B] Get:24 http://deb.debian.org/debian unstable/main amd64 libelf1t64 amd64 0.194-4 [183 kB] Get:25 http://deb.debian.org/debian unstable/main amd64 dwz amd64 0.16-4 [108 kB] Get:26 http://deb.debian.org/debian unstable/main amd64 libxml2-16 amd64 2.15.2+dfsg-0.1 [641 kB] Get:27 http://deb.debian.org/debian unstable/main amd64 gettext amd64 0.23.2-2 [1684 kB] Get:28 http://deb.debian.org/debian unstable/main amd64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get:29 http://deb.debian.org/debian unstable/main amd64 po-debconf all 1.0.22 [216 kB] Get:30 http://deb.debian.org/debian unstable/main amd64 debhelper all 13.31 [932 kB] Get:31 http://deb.debian.org/debian unstable/main amd64 help2man amd64 1.49.3 [198 kB] Get:32 http://deb.debian.org/debian unstable/main amd64 libdevel-checklib-perl all 1.16-1 [18.5 kB] Get:33 http://deb.debian.org/debian unstable/main amd64 libmath-prime-util-gmp-perl amd64 0.53-1 [304 kB] Get:34 http://deb.debian.org/debian unstable/main amd64 libperl-dev amd64 5.40.1-7 [1122 kB] Get:35 http://deb.debian.org/debian unstable/main amd64 libsub-uplevel-perl all 0.2800-3 [14.0 kB] Get:36 http://deb.debian.org/debian unstable/main amd64 libtest-warn-perl all 0.37-2 [14.5 kB] Preconfiguring packages ... Fetched 12.4 MB in 0s (49.7 MB/s) Selecting previously unselected package liblocale-gettext-perl. (Reading database ... 23239 files and directories currently installed.) Preparing to unpack .../00-liblocale-gettext-perl_1.07-8_amd64.deb ... Unpacking liblocale-gettext-perl (1.07-8) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../01-sensible-utils_0.0.26_all.deb ... Unpacking sensible-utils (0.0.26) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../02-libmagic-mgc_1%3a5.46-5+b1_amd64.deb ... Unpacking libmagic-mgc (1:5.46-5+b1) ... Selecting previously unselected package libmagic1t64:amd64. Preparing to unpack .../03-libmagic1t64_1%3a5.46-5+b1_amd64.deb ... Unpacking libmagic1t64:amd64 (1:5.46-5+b1) ... Selecting previously unselected package file. Preparing to unpack .../04-file_1%3a5.46-5+b1_amd64.deb ... Unpacking file (1:5.46-5+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../05-gettext-base_0.23.2-2_amd64.deb ... Unpacking gettext-base (0.23.2-2) ... Selecting previously unselected package libuchardet0:amd64. Preparing to unpack .../06-libuchardet0_0.0.8-2+b1_amd64.deb ... Unpacking libuchardet0:amd64 (0.0.8-2+b1) ... Selecting previously unselected package groff-base. Preparing to unpack .../07-groff-base_1.23.0-10_amd64.deb ... Unpacking groff-base (1.23.0-10) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../08-bsdextrautils_2.41.3-4_amd64.deb ... Unpacking bsdextrautils (2.41.3-4) ... Selecting previously unselected package libpipeline1:amd64. Preparing to unpack .../09-libpipeline1_1.5.8-2_amd64.deb ... Unpacking libpipeline1:amd64 (1.5.8-2) ... Selecting previously unselected package man-db. Preparing to unpack .../10-man-db_2.13.1-1_amd64.deb ... Unpacking man-db (2.13.1-1) ... Selecting previously unselected package m4. Preparing to unpack .../11-m4_1.4.21-1_amd64.deb ... Unpacking m4 (1.4.21-1) ... Selecting previously unselected package autoconf. Preparing to unpack .../12-autoconf_2.72-6_all.deb ... Unpacking autoconf (2.72-6) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../13-autotools-dev_20240727.1_all.deb ... Unpacking autotools-dev (20240727.1) ... Selecting previously unselected package automake. Preparing to unpack .../14-automake_1%3a1.18.1-4_all.deb ... Unpacking automake (1:1.18.1-4) ... Selecting previously unselected package autopoint. Preparing to unpack .../15-autopoint_0.23.2-2_all.deb ... Unpacking autopoint (0.23.2-2) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../16-libdebhelper-perl_13.31_all.deb ... Unpacking libdebhelper-perl (13.31) ... Selecting previously unselected package libtool. Preparing to unpack .../17-libtool_2.5.4-9_all.deb ... Unpacking libtool (2.5.4-9) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../18-dh-autoreconf_22_all.deb ... Unpacking dh-autoreconf (22) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../19-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../20-libfile-stripnondeterminism-perl_1.15.0-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.15.0-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../21-dh-strip-nondeterminism_1.15.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.15.0-1) ... Selecting previously unselected package libelf1t64:amd64. Preparing to unpack .../22-libelf1t64_0.194-4_amd64.deb ... Unpacking libelf1t64:amd64 (0.194-4) ... Selecting previously unselected package dwz. Preparing to unpack .../23-dwz_0.16-4_amd64.deb ... Unpacking dwz (0.16-4) ... Selecting previously unselected package libxml2-16:amd64. Preparing to unpack .../24-libxml2-16_2.15.2+dfsg-0.1_amd64.deb ... Unpacking libxml2-16:amd64 (2.15.2+dfsg-0.1) ... Selecting previously unselected package gettext. Preparing to unpack .../25-gettext_0.23.2-2_amd64.deb ... Unpacking gettext (0.23.2-2) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../26-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../27-po-debconf_1.0.22_all.deb ... Unpacking po-debconf (1.0.22) ... Selecting previously unselected package debhelper. Preparing to unpack .../28-debhelper_13.31_all.deb ... Unpacking debhelper (13.31) ... Selecting previously unselected package help2man. Preparing to unpack .../29-help2man_1.49.3_amd64.deb ... Unpacking help2man (1.49.3) ... Selecting previously unselected package libdevel-checklib-perl. Preparing to unpack .../30-libdevel-checklib-perl_1.16-1_all.deb ... Unpacking libdevel-checklib-perl (1.16-1) ... Selecting previously unselected package libmath-prime-util-gmp-perl. Preparing to unpack .../31-libmath-prime-util-gmp-perl_0.53-1_amd64.deb ... Unpacking libmath-prime-util-gmp-perl (0.53-1) ... Selecting previously unselected package libperl-dev:amd64. Preparing to unpack .../32-libperl-dev_5.40.1-7_amd64.deb ... Unpacking libperl-dev:amd64 (5.40.1-7) ... Selecting previously unselected package libsub-uplevel-perl. Preparing to unpack .../33-libsub-uplevel-perl_0.2800-3_all.deb ... Unpacking libsub-uplevel-perl (0.2800-3) ... Selecting previously unselected package libtest-warn-perl. Preparing to unpack .../34-libtest-warn-perl_0.37-2_all.deb ... Unpacking libtest-warn-perl (0.37-2) ... Selecting previously unselected package sbuild-build-depends-main-dummy. Preparing to unpack .../35-sbuild-build-depends-main-dummy_0.invalid.0_amd64.deb ... Unpacking sbuild-build-depends-main-dummy (0.invalid.0) ... Setting up libpipeline1:amd64 (1.5.8-2) ... Setting up libmath-prime-util-gmp-perl (0.53-1) ... Setting up bsdextrautils (2.41.3-4) ... Setting up libmagic-mgc (1:5.46-5+b1) ... Setting up libdevel-checklib-perl (1.16-1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libxml2-16:amd64 (2.15.2+dfsg-0.1) ... Setting up libdebhelper-perl (13.31) ... Setting up libmagic1t64:amd64 (1:5.46-5+b1) ... Setting up gettext-base (0.23.2-2) ... Setting up m4 (1.4.21-1) ... Setting up libperl-dev:amd64 (5.40.1-7) ... Setting up file (1:5.46-5+b1) ... Setting up libelf1t64:amd64 (0.194-4) ... Setting up autotools-dev (20240727.1) ... Setting up autopoint (0.23.2-2) ... Setting up autoconf (2.72-6) ... Setting up dwz (0.16-4) ... Setting up sensible-utils (0.0.26) ... Setting up libuchardet0:amd64 (0.0.8-2+b1) ... Setting up libsub-uplevel-perl (0.2800-3) ... Setting up liblocale-gettext-perl (1.07-8) ... Setting up automake (1:1.18.1-4) ... update-alternatives: using /usr/bin/automake-1.18 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.15.0-1) ... Setting up gettext (0.23.2-2) ... Setting up libtool (2.5.4-9) ... Setting up libtest-warn-perl (0.37-2) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up help2man (1.49.3) ... Setting up dh-autoreconf (22) ... Setting up dh-strip-nondeterminism (1.15.0-1) ... Setting up groff-base (1.23.0-10) ... Setting up po-debconf (1.0.22) ... Setting up man-db (2.13.1-1) ... Not building database; man-db/auto-update is not 'true'. Setting up debhelper (13.31) ... Setting up sbuild-build-depends-main-dummy (0.invalid.0) ... Processing triggers for libc-bin (2.42-14) ... +------------------------------------------------------------------------------+ | Check architectures Sat, 28 Mar 2026 05:01:51 +0000 | +------------------------------------------------------------------------------+ Arch check ok (amd64 included in any) +------------------------------------------------------------------------------+ | Build environment Sat, 28 Mar 2026 05:01:51 +0000 | +------------------------------------------------------------------------------+ Kernel: Linux 6.18.5+deb14-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.18.5-1 (2026-01-16) amd64 (x86_64) Toolchain package versions: binutils_2.46-3 dpkg-dev_1.23.7 g++-13_13.4.0-10 g++-15_15.2.0-16 gcc-13_13.4.0-10 gcc-15_15.2.0-16 libc6-dev_2.42-14 libstdc++-13-dev_13.4.0-10 libstdc++-15-dev_15.2.0-16 libstdc++6_16-20260322-1 linux-libc-dev_6.19.8-1 Package versions: adduser_3.154 apt_3.1.16 autoconf_2.72-6 automake_1:1.18.1-4 autopoint_0.23.2-2 autotools-dev_20240727.1 base-files_14 base-passwd_3.6.8 bash_5.3-2 binutils_2.46-3 binutils-common_2.46-3 binutils-x86-64-linux-gnu_2.46-3 bsdextrautils_2.41.3-4 bsdutils_1:2.41.3-4 build-essential_12.12 bzip2_1.0.8-6+b1 coreutils_9.10-1 cpp_4:15.2.0-5 cpp-13_13.4.0-10 cpp-13-x86-64-linux-gnu_13.4.0-10 cpp-15_15.2.0-16 cpp-15-x86-64-linux-gnu_15.2.0-16 cpp-x86-64-linux-gnu_4:15.2.0-5 dash_0.5.12-12 debconf_1.5.92 debhelper_13.31 debian-archive-keyring_2025.1 debianutils_5.23.2 dh-autoreconf_22 dh-strip-nondeterminism_1.15.0-1 diffutils_1:3.12-1 dirmngr_2.4.9-4 dpkg_1.23.7 dpkg-dev_1.23.7 dwz_0.16-4 eatmydata_131-2 file_1:5.46-5+b1 findutils_4.10.0-3 g++_4:15.2.0-5 g++-13_13.4.0-10 g++-13-x86-64-linux-gnu_13.4.0-10 g++-15_15.2.0-16 g++-15-x86-64-linux-gnu_15.2.0-16 g++-x86-64-linux-gnu_4:15.2.0-5 gcc_4:15.2.0-5 gcc-13_13.4.0-10 gcc-13-base_13.4.0-10 gcc-13-x86-64-linux-gnu_13.4.0-10 gcc-14-base_14.3.0-14 gcc-15_15.2.0-16 gcc-15-base_15.2.0-16 gcc-15-x86-64-linux-gnu_15.2.0-16 gcc-16-base_16-20260322-1 gcc-x86-64-linux-gnu_4:15.2.0-5 gettext_0.23.2-2 gettext-base_0.23.2-2 gnupg_2.4.9-4 gnupg-l10n_2.4.9-4 gnupg-utils_2.4.9-4 gpg_2.4.9-4 gpg-agent_2.4.9-4 gpg-wks-client_2.4.9-4 gpgconf_2.4.9-4 gpgsm_2.4.9-4 gpgv_2.4.9-4 grep_3.12-1 groff-base_1.23.0-10 gzip_1.13-1 help2man_1.49.3 hostname_3.25 init-system-helpers_1.69 intltool-debian_0.35.0+20060710.6 libacl1_2.3.2-3 libapt-pkg6.0t64_2.9.29 libapt-pkg7.0_3.1.16 libarchive-zip-perl_1.68-1 libasan8_16-20260322-1 libassuan0_2.5.6-1+b1 libassuan9_3.0.2-2+b1 libatomic1_16-20260322-1 libattr1_1:2.5.2-4 libaudit-common_1:4.1.2-1 libaudit1_1:4.1.2-1+b1 libbinutils_2.46-3 libblkid1_2.41.3-4 libbsd0_0.12.2-2+b1 libbz2-1.0_1.0.8-6+b1 libc-bin_2.42-14 libc-dev-bin_2.42-14 libc-gconv-modules-extra_2.42-14 libc-l10n_2.42-14 libc6_2.42-14 libc6-dev_2.42-14 libcap-ng0_0.9.1-1 libcap2_1:2.75-10+b9 libcc1-0_16-20260322-1 libcrypt-dev_1:4.5.1-1 libcrypt1_1:4.5.1-1 libctf-nobfd0_2.46-3 libctf0_2.46-3 libdb5.3t64_5.3.28+dfsg2-11 libdebconfclient0_0.282+b2 libdebhelper-perl_13.31 libdevel-checklib-perl_1.16-1 libdpkg-perl_1.23.7 libeatmydata1_131-2+b2 libelf1t64_0.194-4 libffi8_3.5.2-4 libfile-stripnondeterminism-perl_1.15.0-1 libgcc-13-dev_13.4.0-10 libgcc-15-dev_15.2.0-16 libgcc-s1_16-20260322-1 libgcrypt20_1.12.1-2 libgdbm-compat4t64_1.26-1+b1 libgdbm6t64_1.26-1+b1 libgmp10_2:6.3.0+dfsg-5+b1 libgnutls30t64_3.8.12-3 libgomp1_16-20260322-1 libgpg-error0_1.59-4 libgprofng0_2.46-3 libhogweed6t64_3.10.2-1 libhwasan0_16-20260322-1 libidn2-0_2.3.8-4+b1 libisl23_0.27-2 libitm1_16-20260322-1 libjansson4_2.14-2+b4 libksba8_1.6.8-2 libldap-2.5-0_2.5.19+dfsg-1 libldap2_2.6.10+dfsg-1+b1 liblocale-gettext-perl_1.07-8 liblsan0_16-20260322-1 liblz4-1_1.10.0-8 liblzma5_5.8.2-2 libmagic-mgc_1:5.46-5+b1 libmagic1t64_1:5.46-5+b1 libmath-prime-util-gmp-perl_0.53-1 libmd0_1.1.0-2+b2 libmount1_2.41.3-4 libmpc3_1.3.1-3 libmpfr6_4.2.2-3 libncursesw6_6.6+20251231-1 libnettle8t64_3.10.2-1 libnpth0t64_1.8-3+b1 libp11-kit0_0.26.2-2 libpam-modules_1.7.0-5+b1 libpam-modules-bin_1.7.0-5+b1 libpam-runtime_1.7.0-5 libpam0g_1.7.0-5+b1 libpcre2-8-0_10.46-1+b1 libperl-dev_5.40.1-7 libperl5.38t64_5.38.2-5 libperl5.40_5.40.1-7 libpipeline1_1.5.8-2 libquadmath0_16-20260322-1 libreadline8t64_8.3-4 libsasl2-2_2.1.28+dfsg1-10 libsasl2-modules-db_2.1.28+dfsg1-10 libseccomp2_2.6.0-2+b1 libselinux1_3.9-4+b1 libsemanage-common_3.9-1 libsemanage2_3.9-1+b1 libsepol2_3.9-2 libsframe1_2.44-3 libsframe3_2.46-3 libsmartcols1_2.41.3-4 libsqlite3-0_3.46.1-9+b1 libssl3t64_3.6.1-3 libstdc++-13-dev_13.4.0-10 libstdc++-15-dev_15.2.0-16 libstdc++6_16-20260322-1 libsub-uplevel-perl_0.2800-3 libsystemd0_260.1-1 libtasn1-6_4.21.0-2 libtest-warn-perl_0.37-2 libtinfo6_6.6+20251231-1 libtool_2.5.4-9 libtsan2_16-20260322-1 libubsan1_16-20260322-1 libuchardet0_0.0.8-2+b1 libudev1_260.1-1 libunistring5_1.4.2-1 libuuid1_2.41.3-4 libxml2-16_2.15.2+dfsg-0.1 libxxhash0_0.8.3-2+b1 libzstd1_1.5.7+dfsg-3+b1 linux-libc-dev_6.19.8-1 locales-all_2.42-14 login_1:4.16.0-2+really2.41.3-4 login.defs_1:4.19.3-1 m4_1.4.21-1 make_4.4.1-3 man-db_2.13.1-1 mawk_1.3.4.20260302-1 ncurses-base_6.6+20251231-1 ncurses-bin_6.6+20251231-1 openssl-provider-legacy_3.6.1-3 passwd_1:4.19.3-1 patch_2.8-2 perl_5.40.1-7 perl-base_5.40.1-7 perl-modules-5.38_5.38.2-5 perl-modules-5.40_5.40.1-7 pinentry-curses_1.3.2-4 po-debconf_1.0.22 readline-common_8.3-4 rpcsvc-proto_1.4.3-1 sbuild-build-depends-main-dummy_0.invalid.0 sed_4.9-2 sensible-utils_0.0.26 sqv_1.3.0-5 sysvinit-utils_3.15-6 tar_1.35+dfsg-4 usr-is-merged_39+nmu2 util-linux_2.41.3-4 xz-utils_5.8.2-2 zlib1g_1:1.3.dfsg+really1.3.2-1 +------------------------------------------------------------------------------+ | Build Sat, 28 Mar 2026 05:01:51 +0000 | +------------------------------------------------------------------------------+ Unpack source ------------- -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Format: 3.0 (quilt) Source: libmath-prime-util-perl Binary: libmath-prime-util-perl Architecture: any Version: 0.74-1 Maintainer: Debian Perl Group Uploaders: gregor herrmann , Salvatore Bonaccorso , Clément Hermann Homepage: https://metacpan.org/release/Math-Prime-Util Standards-Version: 4.7.3 Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libmath-prime-util-perl Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libmath-prime-util-perl.git Testsuite: autopkgtest-pkg-perl Build-Depends: debhelper-compat (= 13), help2man, libdevel-checklib-perl, libmath-prime-util-gmp-perl , libtest-warn-perl , perl-xs-dev, perl:native Package-List: libmath-prime-util-perl deb perl optional arch=any Checksums-Sha1: e3d296e660a6d990c77380af3d1b2d8abc8651a7 1006501 libmath-prime-util-perl_0.74.orig.tar.gz e09f715429364cd03b4855a920d942602923aa5f 7232 libmath-prime-util-perl_0.74-1.debian.tar.xz Checksums-Sha256: 58a966ac5deecef92407e31d2c19411ee462f48e8443211d865ff2e6c83cc140 1006501 libmath-prime-util-perl_0.74.orig.tar.gz ae8b1f8291fa462ca86e6cdfb48361c8ef588351c1a68e88d8d238cc3cd3e5ea 7232 libmath-prime-util-perl_0.74-1.debian.tar.xz Files: 17a6a9210f15efe55de147465936f37a 1006501 libmath-prime-util-perl_0.74.orig.tar.gz 9e7b32cceef6338cfbfdaa1d220a0969 7232 libmath-prime-util-perl_0.74-1.debian.tar.xz Dgit: 4cb318ad5066a0e7165db76d987aadc2c3e253dc debian archive/debian/0.74-1 https://git.dgit.debian.org/libmath-prime-util-perl -----BEGIN PGP SIGNATURE----- iQKTBAEBCgB9FiEE0eExbpOnYKgQTYX6uzpoAYZJqgYFAmnHB1pfFIAAAAAALgAo aXNzdWVyLWZwckBub3RhdGlvbnMub3BlbnBncC5maWZ0aGhvcnNlbWFuLm5ldEQx RTEzMTZFOTNBNzYwQTgxMDREODVGQUJCM0E2ODAxODY0OUFBMDYACgkQuzpoAYZJ qgZLvw//RhsZIRHm1DQ64u9HNtrS0R3N/AmFATmlWX8ayGIorkRP1YDfDSe43dCm IjoEBCqe3nv9u2Sg2QiV4wXZ8HhWlNC1IyY5LjhRwo17oPOic8+DIaO5EvUbi+/e L1aSj7gVx/O22CvHGvW1f7nBxK7YPaeI6UXfMlo/xrwnkE7L2odkMECq4dMgK5Uo 4eqVZ3HqMLOyLl+jqSDptqz7WGvgOWo/a1vkUcdimYZmPbPsx9+PIQi2NrVMNfTi 3bqMmO/3rdTrPMy8tvy3QduON0nUhkRiH4wASUqra6yCyOqsrIo3XxVP1XApS6g9 gTw1XBX1pOwr7dXeJDBoySQixFSkaN1auioJRl5IfrisBS7Qjug3naomtp192Om+ NLtWC9Rr+z+qgPobjzO0Rrh0bFAfXJkahYyz0PxXdtmHuLsqsaAN8mhvRibDjjSq RTP5udZQh1l3ldTcYMHsbqssC7ie/wD/wGRp0bWdkG0R3lVHmyoQSb/qVQ/2eILI aVe0W71v13XMWpINc3Wu+ZMSN1syDInGIm6AcqyTXeebpdzkwJwhv9pqxGjY7Pm2 t6EwabLUpTRkTOfEdfC7FX5IejDoM4q0NKofs0zWaV42gwPkkOlbwYnXSnCvmEFM YYt00ElyYAr9ey5FTc9pbl/IoI8CubcMsnqx2l8S8pRq1mhcn5M= =91wl -----END PGP SIGNATURE----- dpkg-source: warning: cannot verify inline signature for ./libmath-prime-util-perl_0.74-1.dsc: missing OpenPGP keyrings dpkg-source: info: verifying ./libmath-prime-util-perl_0.74-1.dsc dpkg-source: info: skipping absent keyring /usr/share/keyrings/debian-keyring.pgp dpkg-source: info: skipping absent keyring /usr/share/keyrings/debian-tag2upload.pgp dpkg-source: info: skipping absent keyring /usr/share/keyrings/debian-nonupload.pgp dpkg-source: info: skipping absent keyring /usr/share/keyrings/debian-maintainers.pgp dpkg-source: info: extracting libmath-prime-util-perl in /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74 dpkg-source: info: unpacking libmath-prime-util-perl_0.74.orig.tar.gz dpkg-source: info: unpacking libmath-prime-util-perl_0.74-1.debian.tar.xz clean up apt cache ------------------ Check disk space ---------------- Sufficient free space for build +------------------------------------------------------------------------------+ | Starting Timed Build Commands Sat, 28 Mar 2026 05:01:51 +0000 | +------------------------------------------------------------------------------+ /usr/share/debomatic/sbuildcommands/starting-build-commands/no-network libmath-prime-util-perl_0.74-1 sid amd64 --------------------------------------------------------------------------------------------------------------- I: Finished running '/usr/share/debomatic/sbuildcommands/starting-build-commands/no-network libmath-prime-util-perl_0.74-1 sid amd64'. Finished processing commands. -------------------------------------------------------------------------------- User Environment ---------------- APT_CONFIG=/var/lib/sbuild/apt.conf HOME=/sbuild-nonexistent LANGUAGE=en_GB:en LC_ALL=C.UTF-8 LD_LIBRARY_PATH=/usr/lib/libeatmydata LD_PRELOAD=libeatmydata.so LOGNAME=debomatic PATH=/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games PWD=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74 SCHROOT_ALIAS_NAME=sid-amd64-debomatic SCHROOT_CHROOT_NAME=sid-amd64-debomatic SCHROOT_COMMAND=env SCHROOT_GID=110 SCHROOT_GROUP=sbuild SCHROOT_SESSION_ID=sid-amd64-debomatic-38277412-1b03-4334-9084-0ce8abe1d8e5 SCHROOT_UID=1002 SCHROOT_USER=debomatic SHELL=/bin/sh USER=debomatic dpkg-buildpackage ----------------- Command: dpkg-buildpackage --sanitize-env -us -uc -Zxz dpkg-buildpackage: info: source package libmath-prime-util-perl dpkg-buildpackage: info: source version 0.74-1 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by gregor herrmann dpkg-source -Zxz --before-build . dpkg-buildpackage: info: host architecture amd64 debian/rules clean dh clean debian/rules override_dh_auto_clean make[1]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_auto_clean [ ! -d /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/inc.save ] || mv /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/inc.save /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/inc make[1]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_clean dpkg-source -Zxz -b . dpkg-source: info: using source format '3.0 (quilt)' dpkg-source: info: building libmath-prime-util-perl using existing ../libmath-prime-util-perl_0.74.orig.tar.gz dpkg-source: info: building libmath-prime-util-perl in ../libmath-prime-util-perl_0.74-1.debian.tar.xz dpkg-source: info: building libmath-prime-util-perl in ../libmath-prime-util-perl_0.74-1.dsc debian/rules binary dh binary dh_update_autotools_config dh_autoreconf debian/rules override_dh_auto_configure make[1]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' [ ! -d /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/inc ] || mv /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/inc /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/inc.save dh_auto_configure /usr/bin/perl Makefile.PL INSTALLDIRS=vendor OPTIMIZE="-g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2" LD="x86_64-linux-gnu-gcc -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wl,-z,relro -Wl,-z,now" It looks like you don't have the GMP library. Sad face. Checking if your kit is complete... Warning: the following files are missing in your kit: inc/Devel/CheckLib.pm Please inform the author. Generating a Unix-style Makefile Writing Makefile for Math::Prime::Util Writing MYMETA.yml and MYMETA.json make[1]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_auto_build make -j2 make[1]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' Running Mkbootstrap for Util () chmod 644 "Util.bs" cp lib/Math/Prime/Util/ECProjectivePoint.pm blib/lib/Math/Prime/Util/ECProjectivePoint.pm cp lib/Math/Prime/Util/ZetaBigFloat.pm blib/lib/Math/Prime/Util/ZetaBigFloat.pm cp lib/Math/Prime/Util/ECAffinePoint.pm blib/lib/Math/Prime/Util/ECAffinePoint.pm cp lib/Math/Prime/Util/ChaCha.pm blib/lib/Math/Prime/Util/ChaCha.pm cp lib/Math/Prime/Util/RandomPrimes.pm blib/lib/Math/Prime/Util/RandomPrimes.pm cp lib/Math/Prime/Util.pm blib/lib/Math/Prime/Util.pm cp lib/Math/Prime/Util/PrimeIterator.pm blib/lib/Math/Prime/Util/PrimeIterator.pm cp lib/ntheory.pm blib/lib/ntheory.pm cp lib/Math/Prime/Util/PPFE.pm blib/lib/Math/Prime/Util/PPFE.pm cp lib/Math/Prime/Util/PrimeArray.pm blib/lib/Math/Prime/Util/PrimeArray.pm cp lib/Math/Prime/Util/MemFree.pm blib/lib/Math/Prime/Util/MemFree.pm cp lib/Math/Prime/Util/PrimalityProving.pm blib/lib/Math/Prime/Util/PrimalityProving.pm cp lib/Math/Prime/Util/PP.pm blib/lib/Math/Prime/Util/PP.pm cp lib/Math/Prime/Util/Entropy.pm blib/lib/Math/Prime/Util/Entropy.pm x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" cache.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" factor.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" primality.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" lucas_seq.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" aks.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" legendre_phi.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" lehmer.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" lmo.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" random_prime.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" sieve.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" sieve_cluster.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" ramanujan_primes.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" semi_primes.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" almost_primes.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" twin_primes.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" omega_primes.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" prime_count_cache.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" prime_counts.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" prime_sums.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" prime_powers.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" lucky_numbers.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" goldbach.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" perfect_powers.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" congruent_numbers.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" powerfree.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" powerful.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" rational.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" real.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" rootmod.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" sort.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" totients.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" util.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" inverse_interpolate.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" entropy.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" csprng.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" chacha.c x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" ds_iset.c "/usr/bin/perl" "/usr/share/perl/5.40/ExtUtils/xsubpp" -typemap '/usr/share/perl/5.40/ExtUtils/typemap' XS.xs > XS.xsc mv XS.xsc XS.c "/usr/bin/perl" -MExtUtils::Command::MM -e 'cp_nonempty' -- Util.bs blib/arch/auto/Math/Prime/Util/Util.bs 644 x86_64-linux-gnu-gcc -c -D_REENTRANT -D_GNU_SOURCE -DDEBIAN -fwrapv -fno-strict-aliasing -pipe -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wdate-time -D_FORTIFY_SOURCE=2 -DVERSION=\"0.74\" -DXS_VERSION=\"0.74\" -fPIC "-I/usr/lib/x86_64-linux-gnu/perl/5.40/CORE" XS.c rm -f blib/arch/auto/Math/Prime/Util/Util.so x86_64-linux-gnu-gcc -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wl,-z,relro -Wl,-z,now -shared -L/usr/local/lib -fstack-protector-strong cache.o factor.o primality.o lucas_seq.o aks.o legendre_phi.o lehmer.o lmo.o random_prime.o sieve.o sieve_cluster.o ramanujan_primes.o semi_primes.o almost_primes.o twin_primes.o omega_primes.o prime_count_cache.o prime_counts.o prime_sums.o prime_powers.o lucky_numbers.o goldbach.o perfect_powers.o congruent_numbers.o powerfree.o powerful.o rational.o real.o rootmod.o sort.o totients.o util.o inverse_interpolate.o entropy.o csprng.o chacha.o ds_iset.o XS.o -o blib/arch/auto/Math/Prime/Util/Util.so \ -lm \ chmod 755 blib/arch/auto/Math/Prime/Util/Util.so cp bin/factor.pl blib/script/factor.pl cp bin/primes.pl blib/script/primes.pl "/usr/bin/perl" -MExtUtils::MY -e 'MY->fixin(shift)' -- blib/script/factor.pl "/usr/bin/perl" -MExtUtils::MY -e 'MY->fixin(shift)' -- blib/script/primes.pl Manifying 14 pod documents make[1]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_auto_test make -j2 test TEST_VERBOSE=1 make[1]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' "/usr/bin/perl" -MExtUtils::Command::MM -e 'cp_nonempty' -- Util.bs blib/arch/auto/Math/Prime/Util/Util.bs 644 PERL_DL_NONLAZY=1 "/usr/bin/perl" "-MExtUtils::Command::MM" "-MTest::Harness" "-e" "undef *Test::Harness::Switches; test_harness(1, 'blib/lib', 'blib/arch')" t/*.t t/01-load.t .................. 1..1 ok 1 - require Math::Prime::Util; ok t/011-load-ntheory.t ......... 1..1 ok 1 - require ntheory; ok t/02-can.t ................... 1..1 ok 1 - Math::Prime::Util->can(...) ok t/022-can-ntheory.t .......... 1..1 ok 1 - ntheory can do is_prime ok # XS, MPU::GMP 0.53, BI Math::BigInt. t/03-init.t .................. 1..15 ok 1 - Math::Prime::Util->can('prime_get_config') ok 2 - Internal space grew after large precalc ok 3 - Internal space went back to original size after memfree ok 4 - An object of class 'Math::Prime::Util::MemFree' isa 'Math::Prime::Util::MemFree' ok 5 - Internal space grew after large precalc ok 6 - Memory released after MemFree object goes out of scope ok 7 - Internal space grew after large precalc ok 8 - Memory not freed yet because a MemFree object still live. ok 9 - Memory released after last MemFree object goes out of scope ok 10 - Internal space grew after large precalc ok 11 - Memory freed after successful eval ok 12 - Internal space grew after large precalc ok 13 - Memory normally not freed after eval die ok 14 - Internal space grew after large precalc ok 15 - Memory is freed after eval die using object scoper ok t/04-inputvalidation.t ....... 1..29 ok 1 - Gives Error: next_prime(undef) ok 2 - Gives Error: next_prime('') ok 3 - Gives Error: next_prime(-4) ok 4 - Gives Error: next_prime(-) ok 5 - Gives Error: next_prime(+) ok 6 - Gives Error: next_prime(++4) ok 7 - Gives Error: next_prime(+-4) ok 8 - Gives Error: next_prime(0-0) ok 9 - Gives Error: next_prime(-0004) ok 10 - Gives Error: next_prime(a) ok 11 - Gives Error: next_prime(5.6) ok 12 - Gives Error: next_prime(4e) ok 13 - Gives Error: next_prime(1.1e12) ok 14 - Gives Error: next_prime(1e8) ok 15 - Gives Error: next_prime(NaN) ok 16 - Gives Error: next_prime(-4) ok 17 - Gives Error: next_prime(15.6) ok 18 - Gives Error: next_prime(NaN) ok 19 - Correct: next_prime(9) ok 20 - Correct: next_prime(0004) ok 21 - Correct: next_prime(+4) ok 22 - Correct: next_prime(5) ok 23 - Correct: next_prime(+0004) ok 24 - Correct: next_prime(4) ok 25 - Correct: next_prime(10000000000000000000000012) ok 26 - Correct: next_prime(100000000) ok 27 - Gives Error: next_prime( infinity ) ok 28 - Gives Error: next_prime( nan ) [nan = 'NaN'] ok 29 - Gives Error: next_prime('111...111x') ok t/10-isprime.t ............... 1..127 ok 1 - is_prime(undef) ok 2 - 2 is prime ok 3 - 1 is not prime ok 4 - 0 is not prime ok 5 - -1 is not prime ok 6 - -2 is not prime ok 7 - is_prime powers of 2 ok 8 - is_prime 0..3572 ok 9 - 4033 is composite ok 10 - 4369 is composite ok 11 - 4371 is composite ok 12 - 4681 is composite ok 13 - 5461 is composite ok 14 - 5611 is composite ok 15 - 6601 is composite ok 16 - 7813 is composite ok 17 - 7957 is composite ok 18 - 8321 is composite ok 19 - 8401 is composite ok 20 - 8911 is composite ok 21 - 10585 is composite ok 22 - 12403 is composite ok 23 - 13021 is composite ok 24 - 14981 is composite ok 25 - 15751 is composite ok 26 - 15841 is composite ok 27 - 16531 is composite ok 28 - 18721 is composite ok 29 - 19345 is composite ok 30 - 23521 is composite ok 31 - 24211 is composite ok 32 - 25351 is composite ok 33 - 29341 is composite ok 34 - 29539 is composite ok 35 - 31621 is composite ok 36 - 38081 is composite ok 37 - 40501 is composite ok 38 - 41041 is composite ok 39 - 44287 is composite ok 40 - 44801 is composite ok 41 - 46657 is composite ok 42 - 47197 is composite ok 43 - 52633 is composite ok 44 - 53971 is composite ok 45 - 55969 is composite ok 46 - 62745 is composite ok 47 - 63139 is composite ok 48 - 63973 is composite ok 49 - 74593 is composite ok 50 - 75361 is composite ok 51 - 79003 is composite ok 52 - 79381 is composite ok 53 - 82513 is composite ok 54 - 87913 is composite ok 55 - 88357 is composite ok 56 - 88573 is composite ok 57 - 97567 is composite ok 58 - 101101 is composite ok 59 - 340561 is composite ok 60 - 488881 is composite ok 61 - 852841 is composite ok 62 - 1373653 is composite ok 63 - 1857241 is composite ok 64 - 6733693 is composite ok 65 - 9439201 is composite ok 66 - 17236801 is composite ok 67 - 23382529 is composite ok 68 - 25326001 is composite ok 69 - 34657141 is composite ok 70 - 56052361 is composite ok 71 - 146843929 is composite ok 72 - 216821881 is composite ok 73 - 3215031751 is composite ok 74 - 2152302898747 is composite ok 75 - 3474749660383 is composite ok 76 - 341550071728321 is composite ok 77 - 341550071728321 is composite ok 78 - 3825123056546413051 is composite ok 79 - 9551 is definitely prime ok 80 - 15683 is definitely prime ok 81 - 19609 is definitely prime ok 82 - 31397 is definitely prime ok 83 - 155921 is definitely prime ok 84 - 9587 is definitely prime ok 85 - 15727 is definitely prime ok 86 - 19661 is definitely prime ok 87 - 31469 is definitely prime ok 88 - 156007 is definitely prime ok 89 - 360749 is definitely prime ok 90 - 370373 is definitely prime ok 91 - 492227 is definitely prime ok 92 - 1349651 is definitely prime ok 93 - 1357333 is definitely prime ok 94 - 2010881 is definitely prime ok 95 - 4652507 is definitely prime ok 96 - 17051887 is definitely prime ok 97 - 20831533 is definitely prime ok 98 - 47326913 is definitely prime ok 99 - 122164969 is definitely prime ok 100 - 189695893 is definitely prime ok 101 - 191913031 is definitely prime ok 102 - 387096383 is definitely prime ok 103 - 436273291 is definitely prime ok 104 - 1294268779 is definitely prime ok 105 - 1453168433 is definitely prime ok 106 - 2300942869 is definitely prime ok 107 - 3842611109 is definitely prime ok 108 - 4302407713 is definitely prime ok 109 - 10726905041 is definitely prime ok 110 - 20678048681 is definitely prime ok 111 - 22367085353 is definitely prime ok 112 - 25056082543 is definitely prime ok 113 - 42652618807 is definitely prime ok 114 - 127976334671 is definitely prime ok 115 - 182226896239 is definitely prime ok 116 - 241160624143 is definitely prime ok 117 - 297501075799 is definitely prime ok 118 - 303371455241 is definitely prime ok 119 - 304599508537 is definitely prime ok 120 - 416608695821 is definitely prime ok 121 - 461690510011 is definitely prime ok 122 - 614487453523 is definitely prime ok 123 - 738832927927 is definitely prime ok 124 - 1346294310749 is definitely prime ok 125 - 1408695493609 is definitely prime ok 126 - 1968188556461 is definitely prime ok 127 - 2614941710599 is definitely prime ok t/11-almostprimes.t .......... 1..5 # Subtest: generate almost primes ok 1 - almost_primes(0,n) ok 2 - small 0-almost-primes ok 3 - small 1-almost-primes ok 4 - small 2-almost-primes ok 5 - small 3-almost-primes ok 6 - small 4-almost-primes ok 7 - small 5-almost-primes ok 8 - almost_primes(3, 10^13 + 0, 10^13 + 50) ok 9 - almost_primes(4, 10^13 + 0, 10^13 + 50) ok 10 - almost_primes(5, 10^13 + 0, 10^13 + 50) 1..10 ok 1 - generate almost primes # Subtest: counting almost primes ok 1 - k-almost prime counts at 1000000 for k=1..20 ok 2 - There are 38537 17-almost-primes <= 1,000,000,000 ok 3 - almost_prime_count_approx n=206, k 1..10 ok 4 - almost_prime_count(10,1024) = 1 1..4 ok 2 - counting almost primes # Subtest: nth almost prime ok 1 - 2nd 1-almost-prime is 3 ok 2 - 34th 2-almost-prime is 94 ok 3 - 456th 3-almost-prime is 1802 ok 4 - 4th 2-almost-prime is 10 ok 5 - 4th 3-almost-prime is 20 ok 6 - 4th 4-almost-prime is 40 ok 7 - 5678th 4-almost-prime is 31382 ok 8 - 67890th 5-almost-prime is 558246 ok 9 - 5555th 24-almost-prime is 21678243840 ok 10 - nth_almost_prime with k=100 n=3 1..10 ok 3 - nth almost prime # Subtest: limits ok 1 - 3-almost prime limits for 59643 ok 2 - 32-almost prime limits for 12 1..2 ok 4 - limits # Subtest: approx ok 1 - approx 59643-th 3-almost prime) ok 2 - approx 12-th 32-almost prime ok 3 - approx 2011-th 63-almost prime ok 4 - approx 4557-th 150-almost prime (49 digits) ok 5 - small approx 1-almost prime ok 6 - small approx 2-almost prime ok 7 - small approx 3-almost prime ok 8 - small approx 4-almost prime 1..8 ok 5 - approx ok t/11-clusters.t .............. 1..22 ok 1 - A001359 0 200 ok 2 - A022004 317321 319727 ok 3 - A022005 557857 560293 ok 4 - Inadmissible pattern (0,2,4) finds (3,5,7) ok 5 - Inadmissible pattern (0,2,8,14,26) finds (3,5,11,17,29) and (5,7,13,19,31) ok 6 - Pattern [2] 342 in range 0 .. 20000 ok 7 - Pattern [2] 1 in range 1000000000000000000000 .. 1000000000000000001000 ok 8 - Pattern [2 6] 259 in range 0 .. 100000 ok 9 - Pattern [2 6 8] 38 in range 0 .. 100000 ok 10 - Pattern [2 6 8 12] 10 in range 0 .. 100000 ok 11 - Pattern [4 6 10 12] 11 in range 0 .. 100000 ok 12 - Pattern [4 6 10 12 16] 5 in range 0 .. 100000 ok 13 - Pattern [2 8 12 14 18 20] 2 in range 0 .. 100000 ok 14 - Pattern [2 6 8 12 18 20] 1 in range 0 .. 100000 ok 15 - Pattern [2 6] 1 in range 1000000000000000000000 .. 1000000000000000042978 ok 16 - Pattern [2 6 8] 0 in range 1000000000000000000000 .. 1000000000000000042978 ok 17 - Pattern [2 6 8 12] 0 in range 1000000000000000000000 .. 1000000000000000042978 ok 18 - Pattern [4 6 10 12] 0 in range 1000000000000000000000 .. 1000000000000000042978 ok 19 - Pattern [4 6 10 12 16] 0 in range 1000000000000000000000 .. 1000000000000000042978 ok 20 - Pattern [2 8 12 14 18 20] 0 in range 1000000000000000000000 .. 1000000000000000042978 ok 21 - Pattern [2 6 8 12 18 20] 0 in range 1000000000000000000000 .. 1000000000000000042978 ok 22 - Window around A022008 high cluster finds the cluster ok t/11-omegaprimes.t ........... 1..19 ok 1 - small 1-omega-primes ok 2 - small 2-omega-primes ok 3 - small 3-omega-primes ok 4 - small 4-omega-primes ok 5 - small 5-omega-primes ok 6 - omega_prime_count n=206, k 1..10 ok 7 - k-omega prime counts at 10000 for k=1..10 ok 8 - There are 19 6-omega-primes <= 90,000 ok 9 - There are 10 8-omega-primes <= 20,000,000 ok 10 - k-omega prime counts at 1000000 for k=1..20 ok 11 - omega_prime_count n=206111, k 1..10 ok 12 - nth_omega_prime(0,...) ok 13 - nth_omega_prime(...,0) ok 14 - nth_omega_prime(1, 1 .. 40) ok 15 - nth_omega_prime(2, 1 .. 40) ok 16 - nth_omega_prime(3, 1 .. 40) ok 17 - nth_omega_prime(4, 1 .. 40) ok 18 - nth_omega_prime(5, 1 .. 40) ok 19 - The 122nd 8-omega prime is 46692030 ok t/11-primepowers.t ........... 1..36 ok 1 - prime_powers(1000) has 193 powers ok 2 - last power from prime_powers(1000) is 997 ok 3 - prime_powers(300) ok 4 - prime_powers(1..50) ok 5 - prime_powers(1441897, 1441897 + 1000) ok 6 - next_prime_power ok 7 - next_prime_power(2^i+1) ok 8 - next_prime_power(2^i) ok 9 - prev_prime_power(0..2) = undef ok 10 - prev_prime_power ok 11 - prev_prime_power(2^i+1) ok 12 - prev_prime_power(2^i) ok 13 - prime_power_count(0) = 0 ok 14 - prime_power_count(1) = 0 ok 15 - prime_power_count(n) for 1..41 ok 16 - prime_power_count(10^n) for 1..8 ok 17 - prime_power_count(12345678) = 809830 ok 18 - prime_power_count(123456,133332) = 847 ok 19 - prime_power_count(0,30,60,...,570) ok 20 - prime_power_count ranges 0 .. 80 ok 21 - prime_power count bounds for 513 ok 22 - prime_power count bounds for 5964377 ok 23 - prime_power count bounds for small numbers ok 24 - prime_power count bounds for small samples ok 25 - nth_prime_power(0) returns undef ok 26 - first 50 prime powers with nth_prime_power ok 27 - 37993 is the 2^12th prime power ok 28 - nth_prime_power_lower(0) returns undef ok 29 - nth_prime_power_upper(0) returns undef ok 30 - nth_prime_power_approx(0) returns undef ok 31 - nth_prime_power(86) bounds ok 32 - nth_prime_power(123456) bounds ok 33 - nth_prime_power(5286238) bounds ok 34 # skip only with EXTENDED_TESTING ok 35 - nth_prime_power bounds for small powers ok 36 - nth_prime_power bounds for small samples ok t/11-primes.t ................ 1..124 ok 1 - primes(undef) ok 2 - primes(a) ok 3 - primes(-4) ok 4 - primes(2,undef) ok 5 - primes(2,x) ok 6 - primes(2,-4) ok 7 - primes(undef,7) ok 8 - primes(x,7) ok 9 - primes(-10,7) ok 10 - primes(undef,undef) ok 11 - primes(x,x) ok 12 - primes(-10,-4) ok 13 - primes(inf) ok 14 - primes(2,inf) ok 15 - primes(inf,inf) ok 16 - primes(1) should return [] ok 17 - primes(6) should return [2 3 5] ok 18 - primes(18) should return [2 3 5 7 11 13 17] ok 19 - primes(19) should return [2 3 5 7 11 13 17 19] ok 20 - primes(3) should return [2 3] ok 21 - primes(7) should return [2 3 5 7] ok 22 - primes(5) should return [2 3 5] ok 23 - primes(2) should return [2] ok 24 - primes(20) should return [2 3 5 7 11 13 17 19] ok 25 - primes(11) should return [2 3 5 7 11] ok 26 - primes(4) should return [2 3] ok 27 - primes(0) should return [] ok 28 - Primes between 0 and 3572 ok 29 - primes(2,3) should return [2 3] ok 30 - primes(2,5) should return [2 3 5] ok 31 - primes(3,3) should return [3] ok 32 - primes(3842610773,3842611109) should return [3842610773 3842611109] ok 33 - primes(3842610774,3842611108) should return [] ok 34 - primes(3,9) should return [3 5 7] ok 35 - primes(3,7) should return [3 5 7] ok 36 - primes(2,2) should return [2] ok 37 - primes(4,8) should return [5 7] ok 38 - primes(3090,3162) should return [3109 3119 3121 3137] ok 39 - primes(3,6) should return [3 5] ok 40 - primes(2,20) should return [2 3 5 7 11 13 17 19] ok 41 - primes(2010734,2010880) should return [] ok 42 - primes(3088,3164) should return [3089 3109 3119 3121 3137 3163] ok 43 - primes(30,70) should return [31 37 41 43 47 53 59 61 67] ok 44 - primes(3089,3163) should return [3089 3109 3119 3121 3137 3163] ok 45 - primes(20,2) should return [] ok 46 - primes(2010733,2010881) should return [2010733 2010881] ok 47 - primes(70,30) should return [] ok 48 - Primes between 1_693_182_318_746_371 and 1_693_182_318_747_671 ok 49 - count primes within a range ok 50 - segment(0, 3572) ok 51 - segment(2, 20) ok 52 - segment(30, 70) ok 53 - segment(30, 70) ok 54 - segment(20, 2) ok 55 - segment(1, 1) ok 56 - segment(2, 2) ok 57 - segment(3, 3) ok 58 - segment Primegap 21 inclusive ok 59 - segment Primegap 21 exclusive ok 60 - segment(3088, 3164) ok 61 - segment(3089, 3163) ok 62 - segment(3090, 3162) ok 63 - erat(0, 3572) ok 64 - erat(2, 20) ok 65 - erat(30, 70) ok 66 - erat(30, 70) ok 67 - erat(20, 2) ok 68 - erat(1, 1) ok 69 - erat(2, 2) ok 70 - erat(3, 3) ok 71 - erat Primegap 21 inclusive ok 72 - erat Primegap 21 exclusive ok 73 - erat(3088, 3164) ok 74 - erat(3089, 3163) ok 75 - erat(3090, 3162) ok 76 - trial(0, 3572) ok 77 - trial(2, 20) ok 78 - trial(30, 70) ok 79 - trial(30, 70) ok 80 - trial(20, 2) ok 81 - trial(1, 1) ok 82 - trial(2, 2) ok 83 - trial(3, 3) ok 84 - trial Primegap 21 inclusive ok 85 - trial Primegap 21 exclusive ok 86 - trial(3088, 3164) ok 87 - trial(3089, 3163) ok 88 - trial(3090, 3162) ok 89 - primes(0, 3572) ok 90 - primes(2, 20) ok 91 - primes(30, 70) ok 92 - primes(30, 70) ok 93 - primes(20, 2) ok 94 - primes(1, 1) ok 95 - primes(2, 2) ok 96 - primes(3, 3) ok 97 - primes Primegap 21 inclusive ok 98 - primes Primegap 21 exclusive ok 99 - primes(3088, 3164) ok 100 - primes(3089, 3163) ok 101 - primes(3090, 3162) ok 102 - sieve(0, 3572) ok 103 - sieve(2, 20) ok 104 - sieve(30, 70) ok 105 - sieve(30, 70) ok 106 - sieve(20, 2) ok 107 - sieve(1, 1) ok 108 - sieve(2, 2) ok 109 - sieve(3, 3) ok 110 - sieve Primegap 21 inclusive ok 111 - sieve Primegap 21 exclusive ok 112 - sieve(3088, 3164) ok 113 - sieve(3089, 3163) ok 114 - sieve(3090, 3162) ok 115 - sieve_range 0 width 1000 depth 40 returns primes ok 116 - sieve_range 1 width 4 depth 2 returns 1,2 ok 117 - sieve_range 1 width 5 depth 2 returns 1,2,4 ok 118 - sieve_range 1 width 6 depth 3 returns 1,2,4 ok 119 - sieve_range(109485,100,3) ok 120 - sieve_range(109485,100,5) ok 121 - sieve_range(109485,100,7) ok 122 - sieve_range(109485,100,11) ok 123 - sieve_range(109485,100,13) ok 124 - sieve_range(109485,100,17) ok t/11-ramanujanprimes.t ....... 1..25 ok 1 - ramanujan_primes(983) ok 2 - ramanujan_primes(11,18) should return [11 17] ok 3 - ramanujan_primes(11,29) should return [11 17 29] ok 4 - ramanujan_primes(1,11) should return [2 11] ok 5 - ramanujan_primes(10000,10100) should return [10061 10067 10079 10091 10093] ok 6 - ramanujan_primes(0,11) should return [2 11] ok 7 - ramanujan_primes(10,11) should return [11] ok 8 - ramanujan_primes(182,226) should return [] ok 9 - ramanujan_primes(11,20) should return [11 17] ok 10 - ramanujan_primes(3,11) should return [11] ok 11 - ramanujan_primes(11,17) should return [11 17] ok 12 - ramanujan_primes(599,599) should return [599] ok 13 - ramanujan_primes(2,11) should return [2 11] ok 14 - ramanujan_primes(11,16) should return [11] ok 15 - ramanujan_primes(11,19) should return [11 17] ok 16 - nth_ramanujan_prime(1 .. 72) ok 17 - The 123,456th Ramanujan prime is 3657037 ok 18 - is_ramanujan_prime( 0 .. 72) ok 19 - 997th Ramanujan prime is 19379 ok 20 - Rn[23744] is 617759 ok 21 - small ramanujan prime limits ok 22 - ramanujan prime limits for 59643 ok 23 - ramanujan prime limits for 5964377 ok 24 - ramanujan prime approx for 59643 ok 25 - ramanujan prime approx for 5964377 ok t/11-semiprimes.t ............ 1..38 ok 1 - semi_primes(95) ok 2 - nth_semiprime for small values ok 3 - semi_primes(2,11) should return [4 6 9 10] ok 4 - semi_primes(184279944,184280037) should return [184279969] ok 5 - semi_primes(26,33) should return [26 33] ok 6 - semi_primes(10,10) should return [10] ok 7 - semi_primes(10,14) should return [10 14] ok 8 - semi_primes(10,11) should return [10] ok 9 - semi_primes(4,11) should return [4 6 9 10] ok 10 - semi_primes(10,13) should return [10] ok 11 - semi_primes(0,11) should return [4 6 9 10] ok 12 - semi_primes(11,13) should return [] ok 13 - semi_primes(1,11) should return [4 6 9 10] ok 14 - semi_primes(8589990147,8589990167) should return [8589990149 8589990157 8589990166] ok 15 - semi_primes(5,16) should return [6 9 10 14 15] ok 16 - semi_primes(25,34) should return [25 26 33 34] ok 17 - semi_primes(3,11) should return [4 6 9 10] ok 18 - semi_primes(10,12) should return [10] ok 19 - semi_primes(184279943,184280038) should return [184279943 184279969 184280038] ok 20 - semiprime_count(123456) = 28589 ok 21 - semiprime_count(12345) = 3217 ok 22 - semiprime_count(1234) = 363 ok 23 - semiprime_count(1000000000,1000000100) = 14 ok 24 - semiprime_count(1000000,1000100) = 25 ok 25 - semiprime_count(1000000000,1000010000) = 1567 ok 26 - semiprime_count(1000000000,1001000000) = 155612 ok 27 - nth_semiprime(1234) = 4497 ok 28 - nth_semiprime(123456) = 573355 ok 29 - nth_semiprime(12345) = 51019 ok 30 - semiprime_count_approx(100000000000000) ~ 11715902308080 (got 11715902549300) ok 31 - semiprime_count_approx(100000000) ~ 17427258 (got 17426718) ok 32 - semiprime_count_approx(100000000000) ~ 13959990342 (got 13959992938) ok 33 - semiprime_count_approx(10000000000000000000) ~ 932300026230174178 (got 932300026146069760) ok 34 - nth_semiprime_approx(4398046511104) ~ 36676111297003 (got 36676113445988) ok 35 - nth_semiprime_approx(100000000000000000) ~ 1030179406403917981 (got 1030179406443727040) ok 36 - nth_semiprime_approx(2147483648) ~ 14540737711 (got 14540770648) ok 37 - nth_semiprime_approx(288230376151711744) ~ 3027432768282284351 (got 3027432768851175168) ok 38 # skip skip large PP nth_semiprime ok t/11-sumprimes.t ............. 1..17 ok 1 - sum_primes for 0 to 1000 ok 2 - sum primes from 10000000 to 10001000 ok 3 - sum primes from 189695660 to 189695892 ok 4 - sum primes from 1960000 to 2000050 ok 5 - sum primes from 0 to 300000 ok 6 - sum primes from 12345 to 54321 ok 7 - sum_primes(100) = 1060 ok 8 - sum_primes(1000) = 76127 ok 9 - sum_primes(10000) = 5736396 ok 10 - sum_primes(65535) = 202288087 ok 11 - sum_primes(65536) = 202288087 ok 12 - sum_primes(65537) = 202353624 ok 13 - sum_primes(321059) = 4236201628 ok 14 - sum_primes(321060) = 4236201628 ok 15 - sum_primes(321072) = 4236201628 ok 16 - sum_primes(321073) = 4236522701 ok 17 - sum_primes(1000000) = 37550402023 ok t/11-twinprimes.t ............ 1..17 ok 1 - twin_primes(1607) ok 2 - nth_twin_prime for small values ok 3 - twin_primes(5,13) should return [5 11] ok 4 - twin_primes(0,11) should return [3 5 11] ok 5 - twin_primes(4294957296,4294957796) should return [4294957307 4294957397 4294957697] ok 6 - twin_primes(213897,213997) should return [213947] ok 7 - twin_primes(6,10) should return [] ok 8 - twin_primes(5,16) should return [5 11] ok 9 - twin_primes(5,10) should return [5] ok 10 - twin_primes(4,11) should return [5 11] ok 11 - twin_primes(134217228,134217728) should return [134217401 134217437] ok 12 - twin_primes(3,11) should return [3 5 11] ok 13 - twin_primes(5,12) should return [5 11] ok 14 - twin_primes(2,11) should return [3 5 11] ok 15 - twin_primes(29,31) should return [29] ok 16 - twin_primes(1,11) should return [3 5 11] ok 17 - twin_primes(5,11) should return [5 11] ok t/12-nextprime.t ............. 1..314 ok 1 - next_prime 0 .. 3572 ok 2 - prev_prime 0 .. 3572 ok 3 - next prime of 19609 is 19609+52 ok 4 - prev prime of 19609+52 is 19609 ok 5 - next prime of 2010733 is 2010733+148 ok 6 - prev prime of 2010733+148 is 2010733 ok 7 - next prime of 360653 is 360653+96 ok 8 - prev prime of 360653+96 is 360653 ok 9 - next prime of 19608 is 19609 ok 10 - next prime of 19610 is 19661 ok 11 - next prime of 19660 is 19661 ok 12 - prev prime of 19662 is 19661 ok 13 - prev prime of 19660 is 19609 ok 14 - prev prime of 19610 is 19609 ok 15 - next prime of 10019 is 10037 ok 16 - Previous prime of 2 returns undef ok 17 - Next prime of ~0-4 returns bigint next prime ok 18 - next_prime(2010733) == 2010881 ok 19 - next_prime(2010734) == 2010881 ok 20 - next_prime(2010735) == 2010881 ok 21 - next_prime(2010736) == 2010881 ok 22 - next_prime(2010737) == 2010881 ok 23 - next_prime(2010738) == 2010881 ok 24 - next_prime(2010739) == 2010881 ok 25 - next_prime(2010740) == 2010881 ok 26 - next_prime(2010741) == 2010881 ok 27 - next_prime(2010742) == 2010881 ok 28 - next_prime(2010743) == 2010881 ok 29 - next_prime(2010744) == 2010881 ok 30 - next_prime(2010745) == 2010881 ok 31 - next_prime(2010746) == 2010881 ok 32 - next_prime(2010747) == 2010881 ok 33 - next_prime(2010748) == 2010881 ok 34 - next_prime(2010749) == 2010881 ok 35 - next_prime(2010750) == 2010881 ok 36 - next_prime(2010751) == 2010881 ok 37 - next_prime(2010752) == 2010881 ok 38 - next_prime(2010753) == 2010881 ok 39 - next_prime(2010754) == 2010881 ok 40 - next_prime(2010755) == 2010881 ok 41 - next_prime(2010756) == 2010881 ok 42 - next_prime(2010757) == 2010881 ok 43 - next_prime(2010758) == 2010881 ok 44 - next_prime(2010759) == 2010881 ok 45 - next_prime(2010760) == 2010881 ok 46 - next_prime(2010761) == 2010881 ok 47 - next_prime(2010762) == 2010881 ok 48 - next_prime(2010763) == 2010881 ok 49 - next_prime(2010764) == 2010881 ok 50 - next_prime(2010765) == 2010881 ok 51 - next_prime(2010766) == 2010881 ok 52 - next_prime(2010767) == 2010881 ok 53 - next_prime(2010768) == 2010881 ok 54 - next_prime(2010769) == 2010881 ok 55 - next_prime(2010770) == 2010881 ok 56 - next_prime(2010771) == 2010881 ok 57 - next_prime(2010772) == 2010881 ok 58 - next_prime(2010773) == 2010881 ok 59 - next_prime(2010774) == 2010881 ok 60 - next_prime(2010775) == 2010881 ok 61 - next_prime(2010776) == 2010881 ok 62 - next_prime(2010777) == 2010881 ok 63 - next_prime(2010778) == 2010881 ok 64 - next_prime(2010779) == 2010881 ok 65 - next_prime(2010780) == 2010881 ok 66 - next_prime(2010781) == 2010881 ok 67 - next_prime(2010782) == 2010881 ok 68 - next_prime(2010783) == 2010881 ok 69 - next_prime(2010784) == 2010881 ok 70 - next_prime(2010785) == 2010881 ok 71 - next_prime(2010786) == 2010881 ok 72 - next_prime(2010787) == 2010881 ok 73 - next_prime(2010788) == 2010881 ok 74 - next_prime(2010789) == 2010881 ok 75 - next_prime(2010790) == 2010881 ok 76 - next_prime(2010791) == 2010881 ok 77 - next_prime(2010792) == 2010881 ok 78 - next_prime(2010793) == 2010881 ok 79 - next_prime(2010794) == 2010881 ok 80 - next_prime(2010795) == 2010881 ok 81 - next_prime(2010796) == 2010881 ok 82 - next_prime(2010797) == 2010881 ok 83 - next_prime(2010798) == 2010881 ok 84 - next_prime(2010799) == 2010881 ok 85 - next_prime(2010800) == 2010881 ok 86 - next_prime(2010801) == 2010881 ok 87 - next_prime(2010802) == 2010881 ok 88 - next_prime(2010803) == 2010881 ok 89 - next_prime(2010804) == 2010881 ok 90 - next_prime(2010805) == 2010881 ok 91 - next_prime(2010806) == 2010881 ok 92 - next_prime(2010807) == 2010881 ok 93 - next_prime(2010808) == 2010881 ok 94 - next_prime(2010809) == 2010881 ok 95 - next_prime(2010810) == 2010881 ok 96 - next_prime(2010811) == 2010881 ok 97 - next_prime(2010812) == 2010881 ok 98 - next_prime(2010813) == 2010881 ok 99 - next_prime(2010814) == 2010881 ok 100 - next_prime(2010815) == 2010881 ok 101 - next_prime(2010816) == 2010881 ok 102 - next_prime(2010817) == 2010881 ok 103 - next_prime(2010818) == 2010881 ok 104 - next_prime(2010819) == 2010881 ok 105 - next_prime(2010820) == 2010881 ok 106 - next_prime(2010821) == 2010881 ok 107 - next_prime(2010822) == 2010881 ok 108 - next_prime(2010823) == 2010881 ok 109 - next_prime(2010824) == 2010881 ok 110 - next_prime(2010825) == 2010881 ok 111 - next_prime(2010826) == 2010881 ok 112 - next_prime(2010827) == 2010881 ok 113 - next_prime(2010828) == 2010881 ok 114 - next_prime(2010829) == 2010881 ok 115 - next_prime(2010830) == 2010881 ok 116 - next_prime(2010831) == 2010881 ok 117 - next_prime(2010832) == 2010881 ok 118 - next_prime(2010833) == 2010881 ok 119 - next_prime(2010834) == 2010881 ok 120 - next_prime(2010835) == 2010881 ok 121 - next_prime(2010836) == 2010881 ok 122 - next_prime(2010837) == 2010881 ok 123 - next_prime(2010838) == 2010881 ok 124 - next_prime(2010839) == 2010881 ok 125 - next_prime(2010840) == 2010881 ok 126 - next_prime(2010841) == 2010881 ok 127 - next_prime(2010842) == 2010881 ok 128 - next_prime(2010843) == 2010881 ok 129 - next_prime(2010844) == 2010881 ok 130 - next_prime(2010845) == 2010881 ok 131 - next_prime(2010846) == 2010881 ok 132 - next_prime(2010847) == 2010881 ok 133 - next_prime(2010848) == 2010881 ok 134 - next_prime(2010849) == 2010881 ok 135 - next_prime(2010850) == 2010881 ok 136 - next_prime(2010851) == 2010881 ok 137 - next_prime(2010852) == 2010881 ok 138 - next_prime(2010853) == 2010881 ok 139 - next_prime(2010854) == 2010881 ok 140 - next_prime(2010855) == 2010881 ok 141 - next_prime(2010856) == 2010881 ok 142 - next_prime(2010857) == 2010881 ok 143 - next_prime(2010858) == 2010881 ok 144 - next_prime(2010859) == 2010881 ok 145 - next_prime(2010860) == 2010881 ok 146 - next_prime(2010861) == 2010881 ok 147 - next_prime(2010862) == 2010881 ok 148 - next_prime(2010863) == 2010881 ok 149 - next_prime(2010864) == 2010881 ok 150 - next_prime(2010865) == 2010881 ok 151 - next_prime(2010866) == 2010881 ok 152 - next_prime(2010867) == 2010881 ok 153 - next_prime(2010868) == 2010881 ok 154 - next_prime(2010869) == 2010881 ok 155 - next_prime(2010870) == 2010881 ok 156 - next_prime(2010871) == 2010881 ok 157 - next_prime(2010872) == 2010881 ok 158 - next_prime(2010873) == 2010881 ok 159 - next_prime(2010874) == 2010881 ok 160 - next_prime(2010875) == 2010881 ok 161 - next_prime(2010876) == 2010881 ok 162 - next_prime(2010877) == 2010881 ok 163 - next_prime(2010878) == 2010881 ok 164 - next_prime(2010879) == 2010881 ok 165 - next_prime(2010880) == 2010881 ok 166 - prev_prime(2010734) == 2010733 ok 167 - prev_prime(2010735) == 2010733 ok 168 - prev_prime(2010736) == 2010733 ok 169 - prev_prime(2010737) == 2010733 ok 170 - prev_prime(2010738) == 2010733 ok 171 - prev_prime(2010739) == 2010733 ok 172 - prev_prime(2010740) == 2010733 ok 173 - prev_prime(2010741) == 2010733 ok 174 - prev_prime(2010742) == 2010733 ok 175 - prev_prime(2010743) == 2010733 ok 176 - prev_prime(2010744) == 2010733 ok 177 - prev_prime(2010745) == 2010733 ok 178 - prev_prime(2010746) == 2010733 ok 179 - prev_prime(2010747) == 2010733 ok 180 - prev_prime(2010748) == 2010733 ok 181 - prev_prime(2010749) == 2010733 ok 182 - prev_prime(2010750) == 2010733 ok 183 - prev_prime(2010751) == 2010733 ok 184 - prev_prime(2010752) == 2010733 ok 185 - prev_prime(2010753) == 2010733 ok 186 - prev_prime(2010754) == 2010733 ok 187 - prev_prime(2010755) == 2010733 ok 188 - prev_prime(2010756) == 2010733 ok 189 - prev_prime(2010757) == 2010733 ok 190 - prev_prime(2010758) == 2010733 ok 191 - prev_prime(2010759) == 2010733 ok 192 - prev_prime(2010760) == 2010733 ok 193 - prev_prime(2010761) == 2010733 ok 194 - prev_prime(2010762) == 2010733 ok 195 - prev_prime(2010763) == 2010733 ok 196 - prev_prime(2010764) == 2010733 ok 197 - prev_prime(2010765) == 2010733 ok 198 - prev_prime(2010766) == 2010733 ok 199 - prev_prime(2010767) == 2010733 ok 200 - prev_prime(2010768) == 2010733 ok 201 - prev_prime(2010769) == 2010733 ok 202 - prev_prime(2010770) == 2010733 ok 203 - prev_prime(2010771) == 2010733 ok 204 - prev_prime(2010772) == 2010733 ok 205 - prev_prime(2010773) == 2010733 ok 206 - prev_prime(2010774) == 2010733 ok 207 - prev_prime(2010775) == 2010733 ok 208 - prev_prime(2010776) == 2010733 ok 209 - prev_prime(2010777) == 2010733 ok 210 - prev_prime(2010778) == 2010733 ok 211 - prev_prime(2010779) == 2010733 ok 212 - prev_prime(2010780) == 2010733 ok 213 - prev_prime(2010781) == 2010733 ok 214 - prev_prime(2010782) == 2010733 ok 215 - prev_prime(2010783) == 2010733 ok 216 - prev_prime(2010784) == 2010733 ok 217 - prev_prime(2010785) == 2010733 ok 218 - prev_prime(2010786) == 2010733 ok 219 - prev_prime(2010787) == 2010733 ok 220 - prev_prime(2010788) == 2010733 ok 221 - prev_prime(2010789) == 2010733 ok 222 - prev_prime(2010790) == 2010733 ok 223 - prev_prime(2010791) == 2010733 ok 224 - prev_prime(2010792) == 2010733 ok 225 - prev_prime(2010793) == 2010733 ok 226 - prev_prime(2010794) == 2010733 ok 227 - prev_prime(2010795) == 2010733 ok 228 - prev_prime(2010796) == 2010733 ok 229 - prev_prime(2010797) == 2010733 ok 230 - prev_prime(2010798) == 2010733 ok 231 - prev_prime(2010799) == 2010733 ok 232 - prev_prime(2010800) == 2010733 ok 233 - prev_prime(2010801) == 2010733 ok 234 - prev_prime(2010802) == 2010733 ok 235 - prev_prime(2010803) == 2010733 ok 236 - prev_prime(2010804) == 2010733 ok 237 - prev_prime(2010805) == 2010733 ok 238 - prev_prime(2010806) == 2010733 ok 239 - prev_prime(2010807) == 2010733 ok 240 - prev_prime(2010808) == 2010733 ok 241 - prev_prime(2010809) == 2010733 ok 242 - prev_prime(2010810) == 2010733 ok 243 - prev_prime(2010811) == 2010733 ok 244 - prev_prime(2010812) == 2010733 ok 245 - prev_prime(2010813) == 2010733 ok 246 - prev_prime(2010814) == 2010733 ok 247 - prev_prime(2010815) == 2010733 ok 248 - prev_prime(2010816) == 2010733 ok 249 - prev_prime(2010817) == 2010733 ok 250 - prev_prime(2010818) == 2010733 ok 251 - prev_prime(2010819) == 2010733 ok 252 - prev_prime(2010820) == 2010733 ok 253 - prev_prime(2010821) == 2010733 ok 254 - prev_prime(2010822) == 2010733 ok 255 - prev_prime(2010823) == 2010733 ok 256 - prev_prime(2010824) == 2010733 ok 257 - prev_prime(2010825) == 2010733 ok 258 - prev_prime(2010826) == 2010733 ok 259 - prev_prime(2010827) == 2010733 ok 260 - prev_prime(2010828) == 2010733 ok 261 - prev_prime(2010829) == 2010733 ok 262 - prev_prime(2010830) == 2010733 ok 263 - prev_prime(2010831) == 2010733 ok 264 - prev_prime(2010832) == 2010733 ok 265 - prev_prime(2010833) == 2010733 ok 266 - prev_prime(2010834) == 2010733 ok 267 - prev_prime(2010835) == 2010733 ok 268 - prev_prime(2010836) == 2010733 ok 269 - prev_prime(2010837) == 2010733 ok 270 - prev_prime(2010838) == 2010733 ok 271 - prev_prime(2010839) == 2010733 ok 272 - prev_prime(2010840) == 2010733 ok 273 - prev_prime(2010841) == 2010733 ok 274 - prev_prime(2010842) == 2010733 ok 275 - prev_prime(2010843) == 2010733 ok 276 - prev_prime(2010844) == 2010733 ok 277 - prev_prime(2010845) == 2010733 ok 278 - prev_prime(2010846) == 2010733 ok 279 - prev_prime(2010847) == 2010733 ok 280 - prev_prime(2010848) == 2010733 ok 281 - prev_prime(2010849) == 2010733 ok 282 - prev_prime(2010850) == 2010733 ok 283 - prev_prime(2010851) == 2010733 ok 284 - prev_prime(2010852) == 2010733 ok 285 - prev_prime(2010853) == 2010733 ok 286 - prev_prime(2010854) == 2010733 ok 287 - prev_prime(2010855) == 2010733 ok 288 - prev_prime(2010856) == 2010733 ok 289 - prev_prime(2010857) == 2010733 ok 290 - prev_prime(2010858) == 2010733 ok 291 - prev_prime(2010859) == 2010733 ok 292 - prev_prime(2010860) == 2010733 ok 293 - prev_prime(2010861) == 2010733 ok 294 - prev_prime(2010862) == 2010733 ok 295 - prev_prime(2010863) == 2010733 ok 296 - prev_prime(2010864) == 2010733 ok 297 - prev_prime(2010865) == 2010733 ok 298 - prev_prime(2010866) == 2010733 ok 299 - prev_prime(2010867) == 2010733 ok 300 - prev_prime(2010868) == 2010733 ok 301 - prev_prime(2010869) == 2010733 ok 302 - prev_prime(2010870) == 2010733 ok 303 - prev_prime(2010871) == 2010733 ok 304 - prev_prime(2010872) == 2010733 ok 305 - prev_prime(2010873) == 2010733 ok 306 - prev_prime(2010874) == 2010733 ok 307 - prev_prime(2010875) == 2010733 ok 308 - prev_prime(2010876) == 2010733 ok 309 - prev_prime(2010877) == 2010733 ok 310 - prev_prime(2010878) == 2010733 ok 311 - prev_prime(2010879) == 2010733 ok 312 - prev_prime(2010880) == 2010733 ok 313 - prev_prime(2010881) == 2010733 ok 314 - next_prime(1234567890) == 1234567891) ok t/13-primecount.t ............ 1..192 ok 1 - prime_count in void context ok 2 - Pi(1000000) <= upper estimate ok 3 - Pi(1000000) >= lower estimate ok 4 - prime_count_approx(1000000) within 100 ok 5 - Pi(30239) <= upper estimate ok 6 - Pi(30239) >= lower estimate ok 7 - prime_count_approx(30239) within 100 ok 8 - Pi(100) <= upper estimate ok 9 - Pi(100) >= lower estimate ok 10 - prime_count_approx(100) within 100 ok 11 - Pi(60067) <= upper estimate ok 12 - Pi(60067) >= lower estimate ok 13 - prime_count_approx(60067) within 100 ok 14 - Pi(100000000) <= upper estimate ok 15 - Pi(100000000) >= lower estimate ok 16 - prime_count_approx(100000000) within 100 ok 17 - Pi(10) <= upper estimate ok 18 - Pi(10) >= lower estimate ok 19 - prime_count_approx(10) within 100 ok 20 - Pi(65535) <= upper estimate ok 21 - Pi(65535) >= lower estimate ok 22 - prime_count_approx(65535) within 100 ok 23 - Pi(100000) <= upper estimate ok 24 - Pi(100000) >= lower estimate ok 25 - prime_count_approx(100000) within 100 ok 26 - Pi(2147483647) <= upper estimate ok 27 - Pi(2147483647) >= lower estimate ok 28 - prime_count_approx(2147483647) within 500 ok 29 - Pi(1000) <= upper estimate ok 30 - Pi(1000) >= lower estimate ok 31 - prime_count_approx(1000) within 100 ok 32 - Pi(16777215) <= upper estimate ok 33 - Pi(16777215) >= lower estimate ok 34 - prime_count_approx(16777215) within 100 ok 35 - Pi(10000) <= upper estimate ok 36 - Pi(10000) >= lower estimate ok 37 - prime_count_approx(10000) within 100 ok 38 - Pi(30249) <= upper estimate ok 39 - Pi(30249) >= lower estimate ok 40 - prime_count_approx(30249) within 100 ok 41 - Pi(1000000000) <= upper estimate ok 42 - Pi(1000000000) >= lower estimate ok 43 - prime_count_approx(1000000000) within 500 ok 44 - Pi(4294967295) <= upper estimate ok 45 - Pi(4294967295) >= lower estimate ok 46 - prime_count_approx(4294967295) within 500 ok 47 - Pi(1) <= upper estimate ok 48 - Pi(1) >= lower estimate ok 49 - prime_count_approx(1) within 100 ok 50 - Pi(10000000) <= upper estimate ok 51 - Pi(10000000) >= lower estimate ok 52 - prime_count_approx(10000000) within 100 ok 53 - Pi(100000) = 9592 ok 54 - Pi(1000) = 168 ok 55 - Pi(1000000) = 78498 ok 56 - Pi(10) = 4 ok 57 - Pi(65535) = 6542 ok 58 - Pi(60067) = 6062 ok 59 - Pi(100) = 25 ok 60 - Pi(30239) = 3269 ok 61 - Pi(30249) = 3270 ok 62 - Pi(10000) = 1229 ok 63 - Pi(1) = 0 ok 64 - Pi(68719476735) <= upper estimate ok 65 - Pi(68719476735) >= lower estimate ok 66 - prime_count_approx(68719476735) within 0.0005% of Pi(68719476735) ok 67 - Pi(281474976710655) <= upper estimate ok 68 - Pi(281474976710655) >= lower estimate ok 69 - prime_count_approx(281474976710655) within 0.0005% of Pi(281474976710655) ok 70 - Pi(100000000000000000) <= upper estimate ok 71 - Pi(100000000000000000) >= lower estimate ok 72 - prime_count_approx(100000000000000000) within 0.0005% of Pi(100000000000000000) ok 73 - Pi(100000000000) <= upper estimate ok 74 - Pi(100000000000) >= lower estimate ok 75 - prime_count_approx(100000000000) within 0.0005% of Pi(100000000000) ok 76 - Pi(10000000000000000000) <= upper estimate ok 77 - Pi(10000000000000000000) >= lower estimate ok 78 - prime_count_approx(10000000000000000000) within 0.0005% of Pi(10000000000000000000) ok 79 - Pi(4503599627370495) <= upper estimate ok 80 - Pi(4503599627370495) >= lower estimate ok 81 - prime_count_approx(4503599627370495) within 0.0005% of Pi(4503599627370495) ok 82 - Pi(17592186044415) <= upper estimate ok 83 - Pi(17592186044415) >= lower estimate ok 84 - prime_count_approx(17592186044415) within 0.0005% of Pi(17592186044415) ok 85 - Pi(1000000000000000000) <= upper estimate ok 86 - Pi(1000000000000000000) >= lower estimate ok 87 - prime_count_approx(1000000000000000000) within 0.0005% of Pi(1000000000000000000) ok 88 - Pi(100000000000000) <= upper estimate ok 89 - Pi(100000000000000) >= lower estimate ok 90 - prime_count_approx(100000000000000) within 0.0005% of Pi(100000000000000) ok 91 - Pi(1000000000000000) <= upper estimate ok 92 - Pi(1000000000000000) >= lower estimate ok 93 - prime_count_approx(1000000000000000) within 0.0005% of Pi(1000000000000000) ok 94 - Pi(1000000000000) <= upper estimate ok 95 - Pi(1000000000000) >= lower estimate ok 96 - prime_count_approx(1000000000000) within 0.0005% of Pi(1000000000000) ok 97 - Pi(10000000000000) <= upper estimate ok 98 - Pi(10000000000000) >= lower estimate ok 99 - prime_count_approx(10000000000000) within 0.0005% of Pi(10000000000000) ok 100 - Pi(1099511627775) <= upper estimate ok 101 - Pi(1099511627775) >= lower estimate ok 102 - prime_count_approx(1099511627775) within 0.0005% of Pi(1099511627775) ok 103 - Pi(72057594037927935) <= upper estimate ok 104 - Pi(72057594037927935) >= lower estimate ok 105 - prime_count_approx(72057594037927935) within 0.0005% of Pi(72057594037927935) ok 106 - Pi(10000000000000000) <= upper estimate ok 107 - Pi(10000000000000000) >= lower estimate ok 108 - prime_count_approx(10000000000000000) within 0.0005% of Pi(10000000000000000) ok 109 - Pi(1152921504606846975) <= upper estimate ok 110 - Pi(1152921504606846975) >= lower estimate ok 111 - prime_count_approx(1152921504606846975) within 0.0005% of Pi(1152921504606846975) ok 112 - Pi(18446744073709551615) <= upper estimate ok 113 - Pi(18446744073709551615) >= lower estimate ok 114 - prime_count_approx(18446744073709551615) within 0.0005% of Pi(18446744073709551615) ok 115 - Pi(10000000000) <= upper estimate ok 116 - Pi(10000000000) >= lower estimate ok 117 - prime_count_approx(10000000000) within 0.0005% of Pi(10000000000) ok 118 - prime_count(7 to 54321) = 5522 ok 119 - prime_count(1e14 +2**16) = 1973 ok 120 - prime_count(3 to 15000) = 1753 ok 121 - prime_count(1e13 +85536) = 2868 ok 122 - prime_count(0 to 1) = 0 ok 123 - prime_count(127976334672 +467) = 1 ok 124 - prime_count(3 to 17) = 6 ok 125 - prime_count(127976334671 +468) = 2 ok 126 - prime_count(191912783 +247) = 1 ok 127 - prime_count(127976334671 +467) = 1 ok 128 - prime_count(191912784 +246) = 0 ok 129 - prime_count(4 to 16) = 4 ok 130 - prime_count(17 to 13) = 0 ok 131 - prime_count(1 to 3) = 2 ok 132 - prime_count(191912783 +248) = 2 ok 133 - prime_count(1e10 +2**16) = 2821 ok 134 - prime_count(127976334672 +466) = 0 ok 135 - prime_count(4 to 17) = 5 ok 136 - prime_count(0 to 2) = 1 ok 137 - prime_count(1e12 +85536) = 3089 ok 138 - prime_count(1118105 to 9961674) = 575195 ok 139 - prime_count(868396 to 9478505) = 563275 ok 140 - prime_count(24689 to 7973249) = 535368 ok 141 - prime_count(191912784 +247) = 1 ok 142 - prime_count(130066574) = 7381740 ok 143 - XS Lehmer count ok 144 - XS Meissel count ok 145 - XS Legendre count ok 146 - XS LMOS count ok 147 - XS LMO count ok 148 - XS segment count ok 149 - require Math::Prime::Util::PP; ok 150 - PP Lehmer count ok 151 - PP sieve count ok 152 - twin prime count 13 to 31 ok 153 - twin prime count 10^8 to +34587 ok 154 - twin prime count 654321 ok 155 - twin prime count 1000000000123456 ok 156 - twin prime count 50000000000000 ok 157 - twin_prime_count_approx(50000000000000) is 0.000103% ok 158 - twin prime count 500000 ok 159 - twin_prime_count_approx(500000) is 0.306681% ok 160 - twin prime count 5000000000000000 ok 161 - twin_prime_count_approx(5000000000000000) is 0.000025% ok 162 - twin prime count 500000000000 ok 163 - twin_prime_count_approx(500000000000) is 0.001407% ok 164 - twin prime count 5000 ok 165 - twin_prime_count_approx(5000) is 1.587302% ok 166 - twin prime count 50000000 ok 167 - twin_prime_count_approx(50000000) is 0.002091% ok 168 - twin prime count 5000000000 ok 169 - twin_prime_count_approx(5000000000) is 0.002004% ok 170 - semiprime count 13 to 31 ok 171 - semiprime count 654321 ok 172 - semiprime count 10^8 to +34587 ok 173 - semiprime count 10000123456 ok 174 - semiprime count 5000000000 ok 175 - semiprime count 500000000 ok 176 - semiprime count 5000000 ok 177 - semiprime count 50000 ok 178 - semiprime count 50000000 ok 179 - semiprime count 8192 ok 180 - semiprime count 2048 ok 181 - semiprime count 5000 ok 182 - semiprime count 500000 ok 183 - Ramanujan prime count 13 to 31 ok 184 - Ramanujan prime count 1357 ok 185 - Ramanujan prime count 10^8 to +34587 ok 186 - Ramanujan prime count 654321 ok 187 - Ramanujan prime count 5000000 ok 188 - Ramanujan prime count 65536 ok 189 - Ramanujan prime count 50000 ok 190 - Ramanujan prime count 500000 ok 191 - Ramanujan prime count 135791 ok 192 - Ramanujan prime count 5000 ok t/14-nthprime.t .............. 1..5 # Subtest: nth_prime ok 1 - nth_prime(0) = undef ok 2 - nth_prime(1..100) ok 3 - nth_prime(n) results around 10k, 100k, 1M ok 4 - nth_prime(6305537, 6305540, 6305543) ok 5 - nth_prime(n) 1k,10k,100k,1M,10M ok 6 # skip nth_prime(21234567890) for 64-bit XS EXTENDED_TESTING 1..6 ok 1 - nth_prime # Subtest: nth_prime upper/lower/approx ok 1 - nth_prime(6305542) <= upper estimate ok 2 - nth_prime(6305542) >= lower estimate ok 3 - nth_prime_approx(6305542) =~ 110040499 (+7111) ok 4 - nth_prime(6305541) <= upper estimate ok 5 - nth_prime(6305541) >= lower estimate ok 6 - nth_prime_approx(6305541) =~ 110040467 (+7124) ok 7 - nth_prime(1) <= upper estimate ok 8 - nth_prime(1) >= lower estimate ok 9 - nth_prime_approx(1) =~ 2 (0) ok 10 - nth_prime(100000000) <= upper estimate ok 11 - nth_prime(100000000) >= lower estimate ok 12 - nth_prime_approx(100000000) =~ 2038074743 (+1845) ok 13 - nth_prime(10000000) <= upper estimate ok 14 - nth_prime(10000000) >= lower estimate ok 15 - nth_prime_approx(10000000) =~ 179424673 (+6566) ok 16 - nth_prime(6305539) <= upper estimate ok 17 - nth_prime(6305539) >= lower estimate ok 18 - nth_prime_approx(6305539) =~ 110040391 (+7163) ok 19 - nth_prime(100000) <= upper estimate ok 20 - nth_prime(100000) >= lower estimate ok 21 - nth_prime_approx(100000) =~ 1299709 (+25) ok 22 - nth_prime(100) <= upper estimate ok 23 - nth_prime(100) >= lower estimate ok 24 - nth_prime_approx(100) =~ 541 (-4) ok 25 - nth_prime(6305537) <= upper estimate ok 26 - nth_prime(6305537) >= lower estimate ok 27 - nth_prime_approx(6305537) =~ 110040379 (+7138) ok 28 - nth_prime(6305540) <= upper estimate ok 29 - nth_prime(6305540) >= lower estimate ok 30 - nth_prime_approx(6305540) =~ 110040407 (+7166) ok 31 - nth_prime(1000000) <= upper estimate ok 32 - nth_prime(1000000) >= lower estimate ok 33 - nth_prime_approx(1000000) =~ 15485863 (-1823) ok 34 - nth_prime(10) <= upper estimate ok 35 - nth_prime(10) >= lower estimate ok 36 - nth_prime_approx(10) =~ 29 (0) ok 37 - nth_prime(6305543) <= upper estimate ok 38 - nth_prime(6305543) >= lower estimate ok 39 - nth_prime_approx(6305543) =~ 110040503 (+7125) ok 40 - nth_prime(6305538) <= upper estimate ok 41 - nth_prime(6305538) >= lower estimate ok 42 - nth_prime_approx(6305538) =~ 110040383 (+7153) ok 43 - nth_prime(10000) <= upper estimate ok 44 - nth_prime(10000) >= lower estimate ok 45 - nth_prime_approx(10000) =~ 104729 (+39) ok 46 - nth_prime(1000) <= upper estimate ok 47 - nth_prime(1000) >= lower estimate ok 48 - nth_prime_approx(1000) =~ 7919 (+4) ok 49 - nth_prime(10000000000000) <= upper estimate ok 50 - nth_prime(10000000000000) >= lower estimate ok 51 - nth_prime_approx(10000000000000) =~ 323780508946331 (+3465179) ok 52 - nth_prime(1000000000000000) <= upper estimate ok 53 - nth_prime(1000000000000000) >= lower estimate ok 54 - nth_prime_approx(1000000000000000) =~ 37124508045065437 (+11290075) ok 55 - nth_prime(10000000000000000) <= upper estimate ok 56 - nth_prime(10000000000000000) >= lower estimate ok 57 - nth_prime_approx(10000000000000000) =~ 394906913903735329 (-105510353) ok 58 - nth_prime(1000000000) <= upper estimate ok 59 - nth_prime(1000000000) >= lower estimate ok 60 - nth_prime_approx(1000000000) =~ 22801763489 (+34087) ok 61 - nth_prime(100000000000000) <= upper estimate ok 62 - nth_prime(100000000000000) >= lower estimate ok 63 - nth_prime_approx(100000000000000) =~ 3475385758524527 (+1766196) ok 64 - nth_prime(100000000000) <= upper estimate ok 65 - nth_prime(100000000000) >= lower estimate ok 66 - nth_prime_approx(100000000000) =~ 2760727302517 (+449836) ok 67 - nth_prime(10000000000) <= upper estimate ok 68 - nth_prime(10000000000) >= lower estimate ok 69 - nth_prime_approx(10000000000) =~ 252097800623 (-84846) ok 70 - nth_prime(100000000000000000) <= upper estimate ok 71 - nth_prime(100000000000000000) >= lower estimate ok 72 - nth_prime_approx(100000000000000000) =~ 4185296581467695669 (+208774396) ok 73 - nth_prime(1000000000000) <= upper estimate ok 74 - nth_prime(1000000000000) >= lower estimate ok 75 - nth_prime_approx(1000000000000) =~ 29996224275833 (+1117633) ok 76 - nth_prime_lower(maxindex) <= maxprime ok 77 - nth_prime_upper(maxindex) >= maxprime ok 78 - nth_prime_lower(maxindex+1) >= nth_prime_lower(maxindex) 1..78 ok 2 - nth_prime upper/lower/approx # Subtest: nth_twin_prime and approx ok 1 - nth_twin_prime(0) = undef ok 2 - 239 = 17th twin prime ok 3 - 101207 = 1234'th twin prime ok 4 - nth_twin_prime_approx(50000000) =~ 19358093939 (+1740071) ok 5 - nth_twin_prime_approx(50000) =~ 8264957 (-22673) ok 6 - nth_twin_prime_approx(5000) =~ 557519 (-998) ok 7 - nth_twin_prime_approx(500000) =~ 115438667 (+8625) ok 8 - nth_twin_prime_approx(500) =~ 32411 (+82) ok 9 - nth_twin_prime_approx(5) =~ 29 (0) ok 10 - nth_twin_prime_approx(5000000) =~ 1523975909 (-647513) ok 11 - nth_twin_prime_approx(50) =~ 1487 (0) ok 12 - nth_twin_prime_approx(500000000) =~ 239211160649 (+2063917) 1..12 ok 3 - nth_twin_prime and approx # Subtest: nth_semiprime ok 1 - nth_semiprime(0) = undef ok 2 - nth_semiprime(1 .. 153) ok 3 - nth_semiprime(123456) = 573355 ok 4 - nth_semiprime(12345) = 51019 ok 5 - nth_semiprime(1234) = 4497 ok 6 - nth_semiprime(12345678) = 69914722 ok 7 - nth_semiprime(1234567) = 6365389 1..7 ok 4 - nth_semiprime # Subtest: inverse_li and inverse_li_nv ok 1 - inverse_li: Li^-1(0..50) ok 2 - inverse_li(1e9) ok 3 - inverse_li(11e11) ok 4 - inverse_li_nv(4) =~ 5.60927669305089 (+8.88178419700125e-16) ok 5 - inverse_li_nv(64.2731216921018) =~ 277 (-1.70530256582424e-13) ok 6 - inverse_li_nv(40000) =~ 478956.000953764 (-2.3283064365387e-10) ok 7 - inverse_li_nv(1234567890123) =~ 37301814610592.3 (+0.046875) 1..7 ok 5 - inverse_li and inverse_li_nv ok t/15-probprime.t ............. 1..127 ok 1 - is_prob_prime(undef) ok 2 - 2 is prime ok 3 - 1 is not prime ok 4 - 0 is not prime ok 5 - -1 is not prime ok 6 - -2 is not prime ok 7 - is_prob_prime powers of 2 ok 8 - is_prob_prime 0..3572 ok 9 - 4033 is composite ok 10 - 4369 is composite ok 11 - 4371 is composite ok 12 - 4681 is composite ok 13 - 5461 is composite ok 14 - 5611 is composite ok 15 - 6601 is composite ok 16 - 7813 is composite ok 17 - 7957 is composite ok 18 - 8321 is composite ok 19 - 8401 is composite ok 20 - 8911 is composite ok 21 - 10585 is composite ok 22 - 12403 is composite ok 23 - 13021 is composite ok 24 - 14981 is composite ok 25 - 15751 is composite ok 26 - 15841 is composite ok 27 - 16531 is composite ok 28 - 18721 is composite ok 29 - 19345 is composite ok 30 - 23521 is composite ok 31 - 24211 is composite ok 32 - 25351 is composite ok 33 - 29341 is composite ok 34 - 29539 is composite ok 35 - 31621 is composite ok 36 - 38081 is composite ok 37 - 40501 is composite ok 38 - 41041 is composite ok 39 - 44287 is composite ok 40 - 44801 is composite ok 41 - 46657 is composite ok 42 - 47197 is composite ok 43 - 52633 is composite ok 44 - 53971 is composite ok 45 - 55969 is composite ok 46 - 62745 is composite ok 47 - 63139 is composite ok 48 - 63973 is composite ok 49 - 74593 is composite ok 50 - 75361 is composite ok 51 - 79003 is composite ok 52 - 79381 is composite ok 53 - 82513 is composite ok 54 - 87913 is composite ok 55 - 88357 is composite ok 56 - 88573 is composite ok 57 - 97567 is composite ok 58 - 101101 is composite ok 59 - 340561 is composite ok 60 - 488881 is composite ok 61 - 852841 is composite ok 62 - 1373653 is composite ok 63 - 1857241 is composite ok 64 - 6733693 is composite ok 65 - 9439201 is composite ok 66 - 17236801 is composite ok 67 - 23382529 is composite ok 68 - 25326001 is composite ok 69 - 34657141 is composite ok 70 - 56052361 is composite ok 71 - 146843929 is composite ok 72 - 216821881 is composite ok 73 - 3215031751 is composite ok 74 - 2152302898747 is composite ok 75 - 3474749660383 is composite ok 76 - 341550071728321 is composite ok 77 - 341550071728321 is composite ok 78 - 3825123056546413051 is composite ok 79 - 9551 is definitely prime ok 80 - 15683 is definitely prime ok 81 - 19609 is definitely prime ok 82 - 31397 is definitely prime ok 83 - 155921 is definitely prime ok 84 - 9587 is definitely prime ok 85 - 15727 is definitely prime ok 86 - 19661 is definitely prime ok 87 - 31469 is definitely prime ok 88 - 156007 is definitely prime ok 89 - 360749 is definitely prime ok 90 - 370373 is definitely prime ok 91 - 492227 is definitely prime ok 92 - 1349651 is definitely prime ok 93 - 1357333 is definitely prime ok 94 - 2010881 is definitely prime ok 95 - 4652507 is definitely prime ok 96 - 17051887 is definitely prime ok 97 - 20831533 is definitely prime ok 98 - 47326913 is definitely prime ok 99 - 122164969 is definitely prime ok 100 - 189695893 is definitely prime ok 101 - 191913031 is definitely prime ok 102 - 387096383 is definitely prime ok 103 - 436273291 is definitely prime ok 104 - 1294268779 is definitely prime ok 105 - 1453168433 is definitely prime ok 106 - 2300942869 is definitely prime ok 107 - 3842611109 is definitely prime ok 108 - 4302407713 is definitely prime ok 109 - 10726905041 is definitely prime ok 110 - 20678048681 is definitely prime ok 111 - 22367085353 is definitely prime ok 112 - 25056082543 is definitely prime ok 113 - 42652618807 is definitely prime ok 114 - 127976334671 is definitely prime ok 115 - 182226896239 is definitely prime ok 116 - 241160624143 is definitely prime ok 117 - 297501075799 is definitely prime ok 118 - 303371455241 is definitely prime ok 119 - 304599508537 is definitely prime ok 120 - 416608695821 is definitely prime ok 121 - 461690510011 is definitely prime ok 122 - 614487453523 is definitely prime ok 123 - 738832927927 is definitely prime ok 124 - 1346294310749 is definitely prime ok 125 - 1408695493609 is definitely prime ok 126 - 1968188556461 is definitely prime ok 127 - 2614941710599 is definitely prime ok t/16-randomprime.t ........... 1..9 # Subtest: expected failures ok 1 - random_prime(undef) ok 2 - random_prime(-3) ok 3 - random_prime(a) ok 4 - random_prime(undef,undef) ok 5 - random_prime(2,undef) ok 6 - random_prime(2,a) ok 7 - random_prime(undef,0) ok 8 - random_prime(0,undef) ok 9 - random_prime(2,undef) ok 10 - random_prime(2,-4) ok 11 - random_prime(2,+infinity) ok 12 - random_prime(+infinity) ok 13 - random_prime(-infinity) ok 14 - random_ndigit_prime(0) ok 15 - random_nbit_prime(0) ok 16 - random_maurer_prime(0) ok 17 - random_shawe_taylor_prime(0) 1..17 ok 1 - expected failures # Subtest: random_prime(lo,hi) ok 1 - random_prime(lo,hi) returns undef when no primes in range ok 2 - (0,2) => 2 in [2,2] ok 3 - (2,2) => 2 in [2,2] ok 4 - (2,3) => 3 in [2,3] ok 5 - (3,5) => 3 in [3,5] ok 6 - (10,20) => 17 in [11,19] ok 7 - (8,12) => 11 in [11,11] ok 8 - (10,12) => 11 in [11,11] ok 9 - (16706143,16706143) => 16706143 in [16706143,16706143] ok 10 - (16706142,16706144) => 16706143 in [16706143,16706143] ok 11 - (3842610773,3842611109) => 3842610773 in [3842610773,3842611109] ok 12 - (3842610772,3842611110) => 3842611109 in [3842610773,3842611109] ok 13 - (2,20) => 11 in [2,19] ok 14 - (3,7) => 3 in [3,7] ok 15 - (20,100) => 43 in [23,97] ok 16 - (5678,9876) => 6823 in [5683,9871] ok 17 - (27767,88493) => 57641 in [27767,88493] ok 18 - (27764,88498) => 44501 in [27767,88493] ok 19 - (27764,88493) => 40819 in [27767,88493] ok 20 - (27767,88498) => 79693 in [27767,88493] ok 21 - (17051687,17051899) => 17051687 in [17051687,17051899] ok 22 - (17051688,17051898) => 17051887 in [17051707,17051887] 1..22 ok 2 - random_prime(lo,hi) # Subtest: random_prime(hi) ok 1 - returned prime values in [2,2] ok 2 - returned prime values in [2,3] ok 3 - returned prime values in [2,4] ok 4 - returned prime values in [2,5] ok 5 - returned prime values in [2,6] ok 6 - returned prime values in [2,7] ok 7 - returned prime values in [2,8] ok 8 - returned prime values in [2,100] ok 9 - returned prime values in [2,1000] ok 10 - returned prime values in [2,1000000] ok 11 - returned prime values in [2,4294967295] 1..11 ok 3 - random_prime(hi) # Subtest: random_ndigit_prime ok 1 - (1) is a 1-digit prime (got 3) ok 2 - (2) is a 2-digit prime (got 79) ok 3 - (3) is a 3-digit prime (got 457) ok 4 - (4) is a 4-digit prime (got 4339) ok 5 - (5) is a 5-digit prime (got 65147) ok 6 - (6) is a 6-digit prime (got 646067) ok 7 - (7) is a 7-digit prime (got 3725107) ok 8 - (8) is a 8-digit prime (got 95039713) ok 9 - (9) is a 9-digit prime (got 476935793) ok 10 - (10) is a 10-digit prime (got 5878787653) ok 11 - (11) is a 11-digit prime (got 53802127619) ok 12 - (15) is a 15-digit prime (got 993934243645897) ok 13 - (19) is a 19-digit prime (got 8916127495797140807) ok 14 - (20) is a 20-digit prime (got 13374499761840173989) 1..14 ok 4 - random_ndigit_prime # Subtest: random_nbit_prime ok 1 - random nbit prime '2' is a 2-bit prime ok 2 - random nbit prime '5' is a 3-bit prime ok 3 - random nbit prime '11' is a 4-bit prime ok 4 - random nbit prime '31' is a 5-bit prime ok 5 - random nbit prime '59' is a 6-bit prime ok 6 - random nbit prime '89' is a 7-bit prime ok 7 - random nbit prime '227' is a 8-bit prime ok 8 - random nbit prime '457' is a 9-bit prime ok 9 - random nbit prime '701' is a 10-bit prime ok 10 - random nbit prime '17881' is a 15-bit prime ok 11 - random nbit prime '46771' is a 16-bit prime ok 12 - random nbit prime '79907' is a 17-bit prime ok 13 - random nbit prime '228268967' is a 28-bit prime ok 14 - random nbit prime '4177706749' is a 32-bit prime ok 15 - random nbit prime '15225018217' is a 34-bit prime 1..15 ok 5 - random_nbit_prime # Subtest: large random nbit/ndigit ok 1 - random 80-bit prime returns a BigInt ok 2 - random 80-bit prime '622446184691466771329669' is in range ok 3 - random 30-digit prime returns a BigInt ok 4 - random 30-digit prime '686082021947952366857992924027' is in range 1..4 ok 6 - large random nbit/ndigit # Subtest: semiprimes ok 1 - random_semiprime(3) ok 2 - random_unrestricted_semiprime(2) ok 3 - random_semiprime(4) = 9 ok 4 - random_unrestricted_semiprime(3) is 4 or 6 ok 5 - random_semiprime(4) is in range and semiprime ok 6 - random_unrestricted_semiprime(4) is in range and semiprime ok 7 - random_semiprime(5) is in range and semiprime ok 8 - random_unrestricted_semiprime(5) is in range and semiprime ok 9 - random_semiprime(6) is in range and semiprime ok 10 - random_unrestricted_semiprime(6) is in range and semiprime ok 11 - random_semiprime(7) is in range and semiprime ok 12 - random_unrestricted_semiprime(7) is in range and semiprime ok 13 - random_semiprime(8) is in range and semiprime ok 14 - random_unrestricted_semiprime(8) is in range and semiprime ok 15 - random_semiprime(9) is in range and semiprime ok 16 - random_unrestricted_semiprime(9) is in range and semiprime ok 17 - random_semiprime(10) is in range and semiprime ok 18 - random_unrestricted_semiprime(10) is in range and semiprime ok 19 - random_semiprime(26) is a 26-bit semiprime ok 20 - random_semiprime(81) is 81 bits ok 21 - random_unrestricted_semiprime(81) is 81 bits 1..21 ok 7 - semiprimes # Subtest: safe primes ok 1 - random_safe_prime(2) is invalid ok 2 - random_safe_prime(3) is in range and is a safe prime ok 3 - random_safe_prime(5) is in range and is a safe prime ok 4 - random_safe_prime(8) is in range and is a safe prime ok 5 - random_safe_prime(40) is in range and is a safe prime ok 6 - random_safe_prime(70) is in range and is a safe prime 1..6 ok 8 - safe primes # Subtest: strong primes ok 1 - random_strong_prime(127) throws error as expected ok 2 - random strong prime '324275952789...016240264971' is a 128-bit prime ok 3 - random_strong_prime(128) isn't obviously weak ok 4 - random strong prime '182656150342...225278747083' is a 247-bit prime ok 5 - random_strong_prime(247) isn't obviously weak ok 6 - random strong prime '119228332086...127049779993' is a 512-bit prime ok 7 - random_strong_prime(512) isn't obviously weak 1..7 ok 9 - strong primes ok t/17-pseudoprime.t ........... 1..9 # Subtest: invalid inputs should croak ok 1 - MR base 0 fails ok 2 - MR base 1 fails 1..2 ok 1 - invalid inputs should croak # Subtest: basic functionality ok 1 - MR with 0 shortcut composite ok 2 - MR with 0 shortcut composite ok 3 - MR with 2 shortcut prime ok 4 - MR with 3 shortcut prime ok 5 - is_pseudoprime(n) = is_pseudoprime(n,2) ok 6 - is_pseudoprime(n,@baselist) ok 7 - is_pseudoprime(n,()) 1..7 ok 2 - basic functionality # Subtest: pseudoprimes (Fermat test) ok 1 - Small PSP-2 ok 2 - Small PSP-3 ok 3 - Large PSP-3 ok 4 - 143168581 is a Fermat pseudoprime to bases 2,3,5,7,11 1..4 ok 3 - pseudoprimes (Fermat test) # Subtest: strong pseudoprimes (Miller-Rabin test) ok 1 - Small SPSP-2 ok 2 - Small SPSP-3 ok 3 - Small SPSP-5 ok 4 - Small SPSP-7 ok 5 - Small SPSP-11 ok 6 - Small SPSP-13 ok 7 - Small SPSP-17 ok 8 - Small SPSP-19 ok 9 - Small SPSP-23 ok 10 - Small SPSP-29 ok 11 - Small SPSP-31 ok 12 - Small SPSP-37 ok 13 - Small SPSP-61 ok 14 - Small SPSP-73 ok 15 - Small SPSP-325 ok 16 - Small SPSP-9375 ok 17 - Small SPSP-28178 ok 18 - Small SPSP-75088 ok 19 - Small SPSP-450775 ok 20 - Small SPSP-642735 ok 21 - Small SPSP-9780504 ok 22 - Small SPSP-203659041 ok 23 - Small SPSP-553174392 ok 24 - Small SPSP-1005905886 ok 25 - Small SPSP-1340600841 ok 26 - Small SPSP-1795265022 ok 27 - Small SPSP-3046413974 ok 28 - Small SPSP-3613982119 ok 29 - Large SPSP-3 ok 30 - spsp( 3, 3) ok 31 - spsp( 11, 11) ok 32 - spsp( 89, 5785) ok 33 - spsp(257, 6168) ok 34 - spsp(367, 367) ok 35 - spsp(367, 1101) ok 36 - spsp(49001, 921211727) ok 37 - spsp( 331, 921211727) ok 38 - spsp(49117, 921211727) ok 39 - MR base 2 for 2..4032 ok 40 # skip base 2,3 without EXTENDED_TESTING ok 41 - A014233: first strong pseudoprime to N prime bases ok 42 - 318665857834031151167461 is a pseudoprime to many bases 1..42 ok 4 - strong pseudoprimes (Miller-Rabin test) # Subtest: Lucas pseudoprimes ok 1 - Small Lucas ok 2 - Small strong Lucas ok 3 - Small extra strong Lucas ok 4 - Small almost extra strong Lucas ok 5 - Small almost extra strong Lucas (increment 2) ok 6 - The first 100 primes are selected by is_extra_strong_lucas_pseudoprime ok 7 - is_strong_lucas_pseudoprime(2) = 1 ok 8 - Not SLPSP: [9 16 100 102 2047 2048 5781 9000 14381] ok 9 - LPSP: 2199055761527 ok 10 - SLPSP: 4294967311 4294967357 12598021314449 ok 11 - ESLPSP: 4294967311 4294967357 10099386070337 ok 12 - AESLPSP: 4294967311 4294967357 10071551814917 1..12 ok 5 - Lucas pseudoprimes # Subtest: other pseudoprimes ok 1 - Small Euler-Plumb ok 2 - Small Euler base 2 ok 3 - Small Euler base 2 ok 4 - Small Euler base 29 ok 5 - Small Euler-Jacobi base 2 ok 6 - Small Fibonacci ok 7 - Small Pell 1..7 ok 6 - other pseudoprimes # Subtest: Perrin pseudoprimes ok 1 - Small Perrin ok 2 # skip larger Perrin ok 3 - 271441 is an unrestricted Perrin pseudoprime ok 4 - 271441 is not a minimal restricted Perrin pseudoprime ok 5 - 36407440637569 is minimal restricted Perrin pseudoprime ok 6 - 36407440637569 is not an Adams/Shanks Perrin pseudoprime ok 7 - 364573433665 is an Adams/Shanks Perrin pseudoprime ok 8 - 364573433665 is not a Grantham restricted Perrin pseudoprime ok 9 # skip very large pseudoprime without EXTENDED_TESTING 1..9 ok 7 - Perrin pseudoprimes # Subtest: Catalan pseudoprimes ok 1 - Catalan [5907 1194649 12327121] 1..1 ok 8 - Catalan pseudoprimes # Subtest: Frobenius type pseudoprimes ok 1 - Small Frobenius(1,-1) ok 2 - Small Frobenius(3,-5) ok 3 - 32-bit Frobenius Underwood (100 random) ok 4 - 32-bit Frobenius Khashin (100 random) ok 5 - 64-bit Frobenius Underwood (2 random) ok 6 - 64-bit Frobenius Khashin (2 random) 1..6 ok 9 - Frobenius type pseudoprimes ok t/18-10-unary_int.t .......... 1..11 ok 1 - absint(-100..100) ok 2 - negint(-100..100) ok 3 - signint(-100..100) ok 4 - absint(0), negint(0), signint(0) ok 5 - absint(-0), negint(-0), signint(-0) ok 6 - absint with positive inputs ok 7 - absint with negative inputs ok 8 - negint with positive inputs ok 9 - negint with negative inputs ok 10 - signint with positive inputs ok 11 - signint with negative inputs ok t/18-15-cmpint.t ............. 1..8 ok 1 - 1 < 2 ok 2 - 2 > 1 ok 3 - 2 == 2 ok 4 - 2^64+2048 > 2^64-1 ok 5 - 2^64+1048 > 2^64-1 ok 6 - 2^64-1 < 2^64 ok 7 - -2^64-1 < 2^64-1 ok 8 - Use cmpint as part of array median comparator ok t/18-20-addint.t ............. 1..6 ok 1 - addint( -3 .. 3, -3 .. 3) ok 2 - subint( -3 .. 3, -3 .. 3) # Subtest: selected test values ok 1 - addint a+b=c ok 2 - addint b+a=c ok 3 - subint c-b=a ok 4 - subint c-a=b ok 5 - addint is commutative 1..5 ok 3 - selected test values ok 4 - add1int ok 5 - sub1int # Subtest: add and subtract 0 on large values ok 1 - addint(n,0) == n for large n ok 2 - addint(0,n) == n for large n ok 3 - subint(n,0) == n for large n ok 4 - subint(n,n) == 0 for large n ok 5 - subint(0,n) == -n for large n 1..5 ok 6 - add and subtract 0 on large values ok t/18-22-mulint.t ............. 1..6 ok 1 - mulint( -3 .. 3, -3 .. 3) ok 2 - mulint a*b=c ok 3 - mulint b*a=c ok 4 - mulint(big,0) == 0 ok 5 - mulint(0,big) == 0 ok 6 - mulint(n,-1) == negint(n) ok t/18-24-powint.t ............. 1..20 ok 1 - powint(-3,0..3) = [1 -3 9 -27] expect [1 -3 9 -27] ok 2 - powint(-2,0..3) = [1 -2 4 -8] expect [1 -2 4 -8] ok 3 - powint(-1,0..3) = [1 -1 1 -1] expect [1 -1 1 -1] ok 4 - powint(0,0..3) = [1 0 0 0] expect [1 0 0 0] ok 5 - powint(1,0..3) = [1 1 1 1] expect [1 1 1 1] ok 6 - powint(2,0..3) = [1 2 4 8] expect [1 2 4 8] ok 7 - powint(3,0..3) = [1 3 9 27] expect [1 3 9 27] ok 8 - powint a**b=c ok 9 - (2^32)^3 ok 10 - 3^(2^7) ok 11 - powint returns a bigint for 46,22 ok 12 - powint returns a bigint for -544,7 ok 13 - 0^0 = 1 ok 14 - 0^1 = 0 ok 15 - 0^5 = 0 ok 16 - 1^0 = 1 ok 17 - 1^100 = 1 ok 18 - (-1)^n alternates 1,-1 ok 19 - (-7)^6 == 7^6 (even exp) ok 20 - (-7)^7 == -(7^7) (odd exp) ok t/18-26-shiftint.t ........... 1..23 ok 1 - lshiftint(0..50) ok 2 - rshiftint(0..50) ok 3 - rashiftint(0..50) ok 4 - lshiftint(-65 .. 65, 5) ok 5 - left shift negative inputs ok 6 - right shift negative inputs ok 7 - signed arithmetic right shift negative inputs ok 8 - left shift of 2^31 with implied 1 bit ok 9 - left shift of 2^63 with implied 1 bit ok 10 - lshiftint(n,0) == n ok 11 - rshiftint(n,0) == n ok 12 - rashiftint(n,0) == n ok 13 - rshiftint == rashiftint for non-negative n ok 14 - big right shift of positive n gives 0 ok 15 - rshiftint(negative, big k) == 0 ok 16 - rashiftint(negative, big k) == -1 ok 17 - rshiftint(UV_MAX, BITS_PER_WORD) == 0 ok 18 - negative k flips direction for all three shift functions ok 19 - lshiftint(UV_MAX, 1) produces correct bigint ok 20 - rshiftint(lshiftint(n,k),k) == n for non-negative n ok 21 - rshiftint(UV_MAX, BITS-1) == 1 ok 22 - rashiftint(-1, BITS-1) == -1 ok 23 - lshiftint(1, BITS-1) == 2^(BITS-1) ok t/18-40-divmodrem.t .......... 1..52 ok 1 - divide by zero correctly trapped ok 2 - divint(1024,x) for 1 .. 1025 ok 3 - divint(-1024,x) for 1 .. 1025 ok 4 - modint(1024,x) for 1 .. 1025 ok 5 - modint(-1024,x) for 1 .. 1025 ok 6 - modint(-1117091728166568014,59) = 4 ok 7 - tdivrem with +/- 8,3 ok 8 - divrem with +/- 8,3 ok 9 - fdivrem with +/- 8,3 ok 10 - cdivrem with +/- 8,3 ok 11 - divint+modint with +/- 8,3 ok 12 - cdivint with +/- 8,3 ok 13 - tdivrem with +/- 1,2 ok 14 - divrem with +/- 1,2 ok 15 - fdivrem with +/- 1,2 ok 16 - cdivrem with +/- 1,2 ok 17 - divint+modint with +/- 1,2 ok 18 - cdivint with +/- 1,2 ok 19 - Divide 31-bit input by -1 ok 20 - Divide 32-bit input by -1 ok 21 - Divide 32-bit input by -1 (ceiling) ok 22 - Divide 63-bit input by -1 ok 23 - Divide 64-bit input by -1 ok 24 - Divide 64-bit input by 2 ok 25 - Divide 64-bit input by itself ok 26 - Divide small int by 64-bit input ok 27 - Divide negative small int by 64-bit input ok 28 - Divide (ceil) small int by 64-bit input ok 29 - Divide (ceil) negative small int by 64-bit input ok 30 - cdivrem with small quotient and 64-bit denominator shouldn't overflow IV ok 31 - cdivint (2^63 +/- 1) / 2^48 ok 32 - cdivint (2^64 +/- 1) / 2^48 ok 33 - S + + divint, cdivint, modint ok 34 - S + + divrem, tdivrem, fdivrem, cdivrem ok 35 - S - + divint, cdivint, modint ok 36 - S - + divrem, tdivrem, fdivrem, cdivrem ok 37 - L + + divint, cdivint, modint ok 38 - L + + divrem, tdivrem, fdivrem, cdivrem ok 39 - L + - divint, cdivint, modint ok 40 - L + - divrem, tdivrem, fdivrem, cdivrem ok 41 - L - + divint, cdivint, modint ok 42 - L - + divrem, tdivrem, fdivrem, cdivrem ok 43 - L - - divint, cdivint, modint ok 44 - L - - divrem, tdivrem, fdivrem, cdivrem ok 45 - b*divint(a,b) + modint(a,b) == a for all test pairs ok 46 - divrem: a == b*q + r for all sign combinations ok 47 - tdivrem: a == b*q + r for all sign combinations ok 48 - fdivrem: a == b*q + r for all sign combinations ok 49 - cdivrem: a == b*q + r for all sign combinations ok 50 - divrem: remainder is always >= 0 ok 51 - cdivrem: remainder has opposite sign from divisor (or is zero) ok 52 - fdivrem results match divint+modint ok t/18-50-sqrtint.t ............ 1..3 ok 1 - sqrtint(n): n must not be negative ok 2 - sqrtint 0 .. 100 ok 3 - sqrtint(n) for multiple values ok t/18-52-rootint.t ............ 1..9 ok 1 - rootint(n,0) gives error ok 2 - rootint(-n,k) gives error ok 3 - rootint(928342398,1) returns 928342398 ok 4 - rootint(88875,3) returns 44 ok 5 - integer third root of 266667176579895999 is 643659 ok 6 - rootint on perfect powers where log fails ok 7 - rootint on selected 64-bit values ok 8 - integer 7th root of a large 7th power ok 9 - integer 7th root of almost a large 7th power ok t/18-60-logint.t ............. 1..10 ok 1 - logint(n,base): n must be at least 1 ok 2 - logint(n,base): base must be at least 2 ok 3 - logint base 2: 0 .. 200 ok 4 - logint base 3: 0 .. 200 ok 5 - logint base 5: 0 .. 200 ok 6 - logint base 10: 0 .. 200 ok 7 - logint(19284098234,16) = 8 ok 8 - power is 16^8 ok 9 - logint(58,~0) = 0 ok 10 - logint(2^120,2) = 120 ok # Perl safe min: -9223372036854775808 # Perl safe max: 18446744073709551615 t/18-90-int_rtype.t .......... 1..14 ok 1 - 18446744073709551614 should be a UV ok 2 - 18446744073709551615 should be a UV ok 3 - 18446744073709551616 should be a bigint ok 4 - 18446744073709551617 should be a bigint ok 5 - 18446744073709551615 [NATIVE] expect 18446744073709551615 [NATIVE] ok 6 - 18446744073709551615 [NATIVE] expect 18446744073709551615 [NATIVE] ok 7 - 18446744073709551616 [BIGINT] expect 18446744073709551616 [BIGINT] ok 8 - 18446744073709551616 [BIGINT] expect 18446744073709551616 [BIGINT] ok 9 - 18446744073709551617 [BIGINT] expect 18446744073709551617 [BIGINT] ok 10 - 18446744073709551617 [BIGINT] expect 18446744073709551617 [BIGINT] ok 11 - 18446744073709551615 [NATIVE] expect 18446744073709551615 [NATIVE] ok 12 - 18446744073709551615 [NATIVE] expect 18446744073709551615 [NATIVE] ok 13 - add1int and sub1int return correct types ok 14 - mulint returns correct types ok t/18-91-edge.t ............... 1..26 ok 1 - addint is associative ok 2 - subint(IV_MIN, 1) == addint(IV_MIN, -1) ok 3 - addint(UV_MAX, 1) crosses into bigint ok 4 - addint(IV_MIN-1, 1) returns to IV_MIN ok 5 - subint(0, UV_MAX) = -UV_MAX ok 6 - subint(IV_MIN, IV_MAX) + IV_MAX == IV_MIN ok 7 - mulint products near UV boundary ok 8 - mulint distributive: a*(b+c) == a*b + a*c ok 9 - mulint(-1, IV_MIN) = IV_MAX+1 ok 10 - powint special cases: 0^k, 1^k, (-1)^k, 2^k, (-2)^k ok 11 - powint(2, BITS) produces bigint UV_MAX+1 ok 12 - cmpint agrees with sign(subint(a,b)) for boundary values ok 13 - cmpint(n,n) == 0 for all test values ok 14 - cmpint: sorted list has correct ordering (transitivity) ok 15 - cmpint: all negative values < all non-negative values ok 16 - divint(n,1)==n, modint(n,1)==0, divint(n,-1)==negint(n) ok 17 - fdivrem gives zero remainder for exact multiples ok 18 - divint: small / large gives correct quotient ok 19 - a == b*q + r for all division modes on boundary values ok 20 - addmod(a,b,m) == modint(addint(a,b), m) ok 21 - mulmod(a,b,m) == modint(mulint(a,b), m) ok 22 - powmod(a, 0, m) == 1 for m > 1 ok 23 - powmod(a, 1, m) == a mod m ok 24 - mulmod near UV_MAX boundary ok 25 - muladdmod/mulsubmod == addmod/submod(mulmod(...)) ok 26 - submod(addmod(a,b,m), b, m) == a mod m ok t/19-chebyshev.t ............. 1..17 ok 1 - chebyshev_theta(69201234) ok 2 - chebyshev_theta(0) ok 3 - chebyshev_theta(4) ok 4 - chebyshev_theta(5) ok 5 - chebyshev_theta(3) ok 6 - chebyshev_theta(123456) ok 7 - chebyshev_theta(2) ok 8 - chebyshev_theta(243) ok 9 - chebyshev_theta(1) ok 10 - chebyshev_psi(123456) ok 11 - chebyshev_psi(2) ok 12 - chebyshev_psi(1) ok 13 - chebyshev_psi(243) ok 14 - chebyshev_psi(0) ok 15 - chebyshev_psi(4) ok 16 - chebyshev_psi(5) ok 17 - chebyshev_psi(3) ok t/19-chinese.t ............... 1..4 ok 1 - chinese() ok 2 - chinese2() ok 3 - chinese() big result ok 4 - chinese2() big result ok t/19-divisorsum.t ............ 1..18 ok 1 - divisor_sum(0,k) = 0 ok 2 - Sum of divisors to the 1th power: Sigma_1 ok 3 - Sigma_1 using integer instead of sub ok 4 - Sum of divisors to the 0th power: Sigma_0 ok 5 - Sigma_0 using integer instead of sub ok 6 - Sum of divisors to the 3th power: Sigma_3 ok 7 - Sigma_3 using integer instead of sub ok 8 - Sum of divisors to the 2th power: Sigma_2 ok 9 - Sigma_2 using integer instead of sub ok 10 - divisor_sum(n) ok 11 - tau as divisor_sum(n, sub {1}) ok 12 - tau as divisor_sum(n, 0) ok 13 - Tau4 (A007426), nested divisor sums ok 14 - divisor_sum(2^27,2) ok 15 - divisor_sum(2^18,3) ok 16 - divisor_sum(2^16,4) ok 17 - divisor_sum(2^11,5) ok 18 - divisor_sum(5003,5) ok t/19-gcd.t ................... 1..59 ok 1 - gcd() = 0 ok 2 - gcd(8) = 8 ok 3 - gcd(9,9) = 9 ok 4 - gcd(0,0) = 0 ok 5 - gcd(1,0,0) = 1 ok 6 - gcd(0,0,1) = 1 ok 7 - gcd(17,19) = 1 ok 8 - gcd(54,24) = 6 ok 9 - gcd(42,56) = 14 ok 10 - gcd(9,28) = 1 ok 11 - gcd(48,180) = 12 ok 12 - gcd(2705353758,2540073744,3512215098,2214052398) = 18 ok 13 - gcd(2301535282,3609610580,3261189640) = 106 ok 14 - gcd(694966514,510402262,195075284,609944479) = 181 ok 15 - gcd(294950648,651855678,263274296,493043500,581345426) = 58 ok 16 - gcd(-30,-90,90) = 30 ok 17 - gcd(-3,-9,-18) = 3 ok 18 - gcd(-5) = 5 ok 19 - gcd(-5,5) = 5 ok 20 - gcd(-5,7) = 1 ok 21 - gcd(12848174105599691600,15386870946739346600,11876770906605497900) = 700 ok 22 - gcd(9785375481451202685,17905669244643674637,11069209430356622337) = 117 ok 23 - lcm() = 1 ok 24 - lcm(8) = 8 ok 25 - lcm(9,9) = 9 ok 26 - lcm(0,0) = 0 ok 27 - lcm(1,0,0) = 0 ok 28 - lcm(0,0,1) = 0 ok 29 - lcm(17,19) = 323 ok 30 - lcm(54,24) = 216 ok 31 - lcm(42,56) = 168 ok 32 - lcm(9,28) = 252 ok 33 - lcm(48,180) = 720 ok 34 - lcm(36,45) = 180 ok 35 - lcm(-36,45) = 180 ok 36 - lcm(-36,-45) = 180 ok 37 - lcm(30,15,5) = 30 ok 38 - lcm(2,3,4,5) = 60 ok 39 - lcm(30245,114552) = 3464625240 ok 40 - lcm(11926,78001,2211) = 2790719778 ok 41 - lcm(1426,26195,3289,8346) = 4254749070 ok 42 - lcm(-5) = 5 ok 43 - lcm(-5,5) = 5 ok 44 - lcm(-5,7) = 35 ok 45 - lcm(26505798,9658520,967043,18285904) = 15399063829732542960 ok 46 - lcm(267220708,143775143,261076) = 15015659316963449908 ok 47 - gcdext(0,0) = [0 0 0] ok 48 - gcdext(0,28) = [0 1 28] ok 49 - gcdext(28,0) = [1 0 28] ok 50 - gcdext(0,-28) = [0 -1 28] ok 51 - gcdext(-28,0) = [-1 0 28] ok 52 - gcdext(3706259912,1223661804) = [123862139 -375156991 4] ok 53 - gcdext(3706259912,-1223661804) = [123862139 375156991 4] ok 54 - gcdext(-3706259912,1223661804) = [-123862139 -375156991 4] ok 55 - gcdext(-3706259912,-1223661804) = [-123862139 375156991 4] ok 56 - gcdext(22,242) = [1 0 22] ok 57 - gcdext(2731583792,3028241442) = [-187089956 168761937 2] ok 58 - gcdext(42272720,12439910) = [-21984 74705 70] ok 59 - gcdext(10139483024654235947,8030280778952246347) = [-2715309548282941287 3428502169395958570 1] ok t/19-kronecker.t ............. 1..42 ok 1 - kronecker(109981, 737777) = 1 ok 2 - kronecker(737779, 121080) = -1 ok 3 - kronecker(-737779, 121080) = 1 ok 4 - kronecker(737779, -121080) = -1 ok 5 - kronecker(-737779, -121080) = -1 ok 6 - kronecker(12345, 331) = -1 ok 7 - kronecker(1001, 9907) = -1 ok 8 - kronecker(19, 45) = 1 ok 9 - kronecker(8, 21) = -1 ok 10 - kronecker(5, 21) = 1 ok 11 - kronecker(5, 1237) = -1 ok 12 - kronecker(10, 49) = 1 ok 13 - kronecker(123, 4567) = -1 ok 14 - kronecker(3, 18) = 0 ok 15 - kronecker(3, -18) = 0 ok 16 - kronecker(-2, 0) = 0 ok 17 - kronecker(-1, 0) = 1 ok 18 - kronecker(0, 0) = 0 ok 19 - kronecker(1, 0) = 1 ok 20 - kronecker(2, 0) = 0 ok 21 - kronecker(-2, 1) = 1 ok 22 - kronecker(-1, 1) = 1 ok 23 - kronecker(0, 1) = 1 ok 24 - kronecker(1, 1) = 1 ok 25 - kronecker(2, 1) = 1 ok 26 - kronecker(-2, -1) = -1 ok 27 - kronecker(-1, -1) = -1 ok 28 - kronecker(0, -1) = 1 ok 29 - kronecker(1, -1) = 1 ok 30 - kronecker(2, -1) = 1 ok 31 - kronecker(3686556869, 428192857) = 1 ok 32 - kronecker(-1453096827, 364435739) = -1 ok 33 - kronecker(3527710253, -306243569) = 1 ok 34 - kronecker(-1843526669, -332265377) = 1 ok 35 - kronecker(321781679, 4095783323) = -1 ok 36 - kronecker(454249403, -79475159) = -1 ok 37 - kronecker(17483840153492293897, 455592493) = 1 ok 38 - kronecker(-1402663995299718225, 391125073) = 1 ok 39 - kronecker(16715440823750591903, -534621209) = -1 ok 40 - kronecker(13106964391619451641, 16744199040925208803) = 1 ok 41 - kronecker(11172354269896048081, 10442187294190042188) = -1 ok 42 - kronecker(-5694706465843977004, 9365273357682496999) = -1 ok t/19-legendrephi.t ........... 1..18 ok 1 - legendre_phi(0,92372) = 0 ok 2 - legendre_phi(5,15) = 1 ok 3 - legendre_phi(89,4) = 21 ok 4 - legendre_phi(46,4) = 11 ok 5 - legendre_phi(47,4) = 12 ok 6 - legendre_phi(48,4) = 12 ok 7 - legendre_phi(52,4) = 12 ok 8 - legendre_phi(53,4) = 13 ok 9 - legendre_phi(10000,5) = 2077 ok 10 - legendre_phi(526,7) = 95 ok 11 - legendre_phi(588,6) = 111 ok 12 - legendre_phi(100000,5) = 20779 ok 13 - legendre_phi(5882,6) = 1128 ok 14 - legendre_phi(100000,7) = 18053 ok 15 - legendre_phi(10000,8) = 1711 ok 16 - legendre_phi(1000000,168) = 78331 ok 17 - legendre_phi(800000,213) = 63739 ok 18 - legendre_phi(4000,255) = 296 ok t/19-liouville.t ............. 1..76 ok 1 - liouville(24) = 1 ok 2 - liouville(51) = 1 ok 3 - liouville(94) = 1 ok 4 - liouville(183) = 1 ok 5 - liouville(294) = 1 ok 6 - liouville(629) = 1 ok 7 - liouville(1488) = 1 ok 8 - liouville(3684) = 1 ok 9 - liouville(8006) = 1 ok 10 - liouville(8510) = 1 ok 11 - liouville(32539) = 1 ok 12 - liouville(57240) = 1 ok 13 - liouville(103138) = 1 ok 14 - liouville(238565) = 1 ok 15 - liouville(444456) = 1 ok 16 - liouville(820134) = 1 ok 17 - liouville(1185666) = 1 ok 18 - liouville(3960407) = 1 ok 19 - liouville(4429677) = 1 ok 20 - liouville(13719505) = 1 ok 21 - liouville(29191963) = 1 ok 22 - liouville(57736144) = 1 ok 23 - liouville(134185856) = 1 ok 24 - liouville(262306569) = 1 ok 25 - liouville(324235872) = 1 ok 26 - liouville(563441153) = 1 ok 27 - liouville(1686170713) = 1 ok 28 - liouville(2489885844) = 1 ok 29 - liouville(1260238066729040) = 1 ok 30 - liouville(10095256575169232896) = 1 ok 31 - liouville(23) = -1 ok 32 - liouville(47) = -1 ok 33 - liouville(113) = -1 ok 34 - liouville(163) = -1 ok 35 - liouville(378) = -1 ok 36 - liouville(942) = -1 ok 37 - liouville(1669) = -1 ok 38 - liouville(2808) = -1 ok 39 - liouville(8029) = -1 ok 40 - liouville(9819) = -1 ok 41 - liouville(23863) = -1 ok 42 - liouville(39712) = -1 ok 43 - liouville(87352) = -1 ok 44 - liouville(210421) = -1 ok 45 - liouville(363671) = -1 ok 46 - liouville(562894) = -1 ok 47 - liouville(1839723) = -1 ok 48 - liouville(3504755) = -1 ok 49 - liouville(7456642) = -1 ok 50 - liouville(14807115) = -1 ok 51 - liouville(22469612) = -1 ok 52 - liouville(49080461) = -1 ok 53 - liouville(132842464) = -1 ok 54 - liouville(146060791) = -1 ok 55 - liouville(279256445) = -1 ok 56 - liouville(802149183) = -1 ok 57 - liouville(1243577750) = -1 ok 58 - liouville(3639860654) = -1 ok 59 - liouville(1807253903626380) = -1 ok 60 - liouville(12063177829788352512) = -1 ok 61 - sumliouville L(n) for small n ok 62 - sumliouville(10000000) = -842 ok 63 - sumliouville(906150257) = 1 ok 64 - sumliouville(100) = -2 ok 65 - sumliouville(444444) = -368 ok 66 - sumliouville(293) = -21 ok 67 - sumliouville(468) = -24 ok 68 - sumliouville(10000) = -94 ok 69 - sumliouville(1000000) = -530 ok 70 - sumliouville(684) = -28 ok 71 - sumliouville(48512) = -2 ok 72 - sumliouville(96862) = -414 ok 73 - sumliouville(76015169) = -10443 ok 74 - sumliouville(1000) = -14 ok 75 - sumliouville(100000) = -288 ok 76 - sumliouville(100000000) = -3884 ok t/19-mangoldt.t .............. 1..20 ok 1 - exp_mangoldt(399982) == 1 ok 2 - exp_mangoldt(10) == 1 ok 3 - exp_mangoldt(1) == 1 ok 4 - exp_mangoldt(823543) == 7 ok 5 - exp_mangoldt(7) == 7 ok 6 - exp_mangoldt(4) == 2 ok 7 - exp_mangoldt(83521) == 17 ok 8 - exp_mangoldt(5) == 5 ok 9 - exp_mangoldt(3) == 3 ok 10 - exp_mangoldt(130321) == 19 ok 11 - exp_mangoldt(27) == 3 ok 12 - exp_mangoldt(399981) == 1 ok 13 - exp_mangoldt(11) == 11 ok 14 - exp_mangoldt(6) == 1 ok 15 - exp_mangoldt(2) == 2 ok 16 - exp_mangoldt(9) == 3 ok 17 - exp_mangoldt(399983) == 399983 ok 18 - exp_mangoldt(25) == 5 ok 19 - exp_mangoldt(8) == 2 ok 20 - exp_mangoldt(0) == 1 ok t/19-moebius.t ............... 1..17 ok 1 - moebius(0) ok 2 - moebius 1 .. 20 (single) ok 3 - moebius 1 .. 20 (range) ok 4 - moebius -1 .. -20 (single) ok 5 - moebius -14 .. -9 (range) ok 6 - moebius -7 .. 5 (range) ok 7 - moebius(3*5*7*11*13) = -1 ok 8 - moebius(73\#/2) = 1 ok 9 - moebius ranges around 2^32 ok 10 - moebius ranges around 2^64 ok 11 - sum(moebius(k) for k=1..n) small n ok 12 - sum(moebius(1,n)) small n ok 13 - mertens(n) small n ok 14 - mertens(100000) ok 15 - mertens(1000000) ok 16 - mertens(10000000) ok 17 - mertens(444444) ok t/19-popcount.t .............. 1..2 ok 1 - hammingweight for various inputs ok 2 - non-GMP hammingweight for various inputs ok t/19-primroots.t ............. 1..85 ok 1 - znprimroot(90441961) == 113 ok 2 - znprimroot(5109721) == 94 ok 3 - znprimroot(8) == ok 4 - znprimroot(4) == 3 ok 5 - znprimroot(-11) == 2 ok 6 - znprimroot(9223372036854775837) == 5 ok 7 - znprimroot(44434394326141300867665315903406029736550298166159399085858) == 23 ok 8 - znprimroot(17551561) == 97 ok 9 - znprimroot(36002292036481) == 13 ok 10 - znprimroot(474264225821700214950222988868518911801235024731324721) == 7 ok 11 - znprimroot(1520874431) == 17 ok 12 - znprimroot(2232881419280027) == 6 ok 13 - znprimroot(89637484042681) == 335 ok 14 - znprimroot(1407827621) == 2 ok 15 - znprimroot(1729) == ok 16 - znprimroot(7) == 3 ok 17 - znprimroot(2) == 1 ok 18 - znprimroot(14123555781055773271) == 6 ok 19 - znprimroot(100000001) == ok 20 - znprimroot(10) == 3 ok 21 - znprimroot(9) == 2 ok 22 - znprimroot(2067900233973681742) == 17 ok 23 - znprimroot(5) == 2 ok 24 - znprimroot(1580603145023079446166874838636458851122) == 7 ok 25 - znprimroot(1) == 0 ok 26 - znprimroot(6) == 5 ok 27 - znprimroot(72004584072962) == 13 ok 28 - znprimroot(1685283601) == 164 ok 29 - znprimroot(8000468009126059319) == 13 ok 30 - znprimroot(11154774760949852441478897023837868805975434161260919037124141673071282481903446814549) == 2 ok 31 - znprimroot(3) == 2 ok 32 - znprimroot("-100000898") == 31 ok 33 - 113 is a primitive root mod 90441961 ok 34 - 94 is a primitive root mod 5109721 ok 35 - 2 is not a primitive root mod 8 ok 36 - 3 is a primitive root mod 4 ok 37 - 2 is a primitive root mod -11 ok 38 - 5 is a primitive root mod 9223372036854775837 ok 39 - 23 is a primitive root mod 44434394326141300867665315903406029736550298166159399085858 ok 40 - 97 is a primitive root mod 17551561 ok 41 - 13 is a primitive root mod 36002292036481 ok 42 - 7 is a primitive root mod 474264225821700214950222988868518911801235024731324721 ok 43 - 17 is a primitive root mod 1520874431 ok 44 - 6 is a primitive root mod 2232881419280027 ok 45 - 335 is a primitive root mod 89637484042681 ok 46 - 2 is a primitive root mod 1407827621 ok 47 - 2 is not a primitive root mod 1729 ok 48 - 3 is a primitive root mod 7 ok 49 - 1 is a primitive root mod 2 ok 50 - 6 is a primitive root mod 14123555781055773271 ok 51 - 2 is not a primitive root mod 100000001 ok 52 - 3 is a primitive root mod 10 ok 53 - 2 is a primitive root mod 9 ok 54 - 17 is a primitive root mod 2067900233973681742 ok 55 - 2 is a primitive root mod 5 ok 56 - 7 is a primitive root mod 1580603145023079446166874838636458851122 ok 57 - 0 is a primitive root mod 1 ok 58 - 5 is a primitive root mod 6 ok 59 - 13 is a primitive root mod 72004584072962 ok 60 - 164 is a primitive root mod 1685283601 ok 61 - 13 is a primitive root mod 8000468009126059319 ok 62 - 2 is a primitive root mod 11154774760949852441478897023837868805975434161260919037124141673071282481903446814549 ok 63 - 2 is a primitive root mod 3 ok 64 - is_primitive_root(2,0) => undef ok 65 - 19 is a primitive root mod 191 ok 66 - 13 is not a primitive root mod 191 ok 67 - 35 is not a primitive root mod 982 ok 68 - 74513 is a primitive root mod 2 ok 69 - 74513 is a primitive root mod 3 ok 70 - qnr(0) returns undef ok 71 - qnr(1..15) ok 72 - qnr(2^k) = 2 for k>=1 ok 73 - The least quadratice non-residue of 5711 is 19 ok 74 - The least quadratice non-residue of 366791 is 43 ok 75 - qnr(7*17*23) = 2 ok 76 - qnr(2*5*925733) = 2 ok 77 - is_qr(x,0) returns undef ok 78 - is_qr(a,1) = 1 ok 79 - is_qr(a,2) = 1 ok 80 - is_qr(0..10,3) ok 81 - is_qr(0..10,4) ok 82 - is_qr(0..10,6) ok 83 - is_qr(0..20,9) ok 84 - is_qr(0..32,15) ok 85 - 2636542937688 is a qr mod 3409243234243 ok t/19-ramanujan.t ............. 1..38 ok 1 - Ramanujan Sum c_0(34) = 0 ok 2 - Ramanujan Sum c_34(0) ok 3 - Ramanujan sum c_{1..30}(1..30) ok 4 - H(11) = 12 ok 5 - H(1555) = 48 ok 6 - H(31243) = 192 ok 7 - H(8) = 12 ok 8 - H(20563) = 156 ok 9 - H(34483) = 180 ok 10 - H(23) = 36 ok 11 - H(907) = 36 ok 12 - H(6307) = 96 ok 13 - H(71) = 84 ok 14 - H(3) = 4 ok 15 - H(20) = 24 ok 16 - H(4) = 6 ok 17 - H(-3) = 0 ok 18 - H(427) = 24 ok 19 - H(39) = 48 ok 20 - H(7) = 12 ok 21 - H(12) = 16 ok 22 - H(4031) = 1008 ok 23 - H(30067) = 168 ok 24 - H(0) = -1 ok 25 - H(163) = 12 ok 26 - H(1) = 0 ok 27 - H(47) = 60 ok 28 - H(2) = 0 ok 29 - Ramanujan Tau(2) = -24 ok 30 - Ramanujan Tau(0) = 0 ok 31 - Ramanujan Tau(3) = 252 ok 32 - Ramanujan Tau(106) = 38305336752 ok 33 - Ramanujan Tau(1) = 1 ok 34 - Ramanujan Tau(53) = -1596055698 ok 35 - Ramanujan Tau(4) = -1472 ok 36 - Ramanujan Tau(243) = 13400796651732 ok 37 - Ramanujan Tau(5) = 4830 ok 38 - Ramanujan Tau(16089) = 12655813883111729342208 ok t/19-totients.t .............. 1..36 ok 1 - euler_phi 0 .. 69 ok 2 - euler_phi with range: 0, 69 ok 3 - sum of totients to 240 ok 4 - euler_phi(123456) == 41088 ok 5 - euler_phi(123457) == 123456 ok 6 - euler_phi(123456789) == 82260072 ok 7 - euler_phi(-123456) == 0 ok 8 - euler_phi(0,0) ok 9 - euler_phi with end < start ok 10 - euler_phi 0-1 ok 11 - euler_phi 1-2 ok 12 - euler_phi 1-3 ok 13 - euler_phi 2-3 ok 14 - euler_phi 10-20 ok 15 - euler_phi(1513,1537) ok 16 - euler_phi -5 to 5 ok 17 - euler_phi ranges around 2^32 ok 18 - euler_phi ranges around 2^64 ok 19 - carmichael_lambda with range: 0, 69 ok 20 - Totient count 0-100 = 198 ok 21 - inverse_totient(1728) = 62 ok 22 - inverse_totient(9!) = 1138 ok 23 # skip Larger inverse totient with EXTENDED_TESTING ok 24 - inverse_totient(0) ok 25 - inverse_totient(1) ok 26 - inverse_totient(2) ok 27 - inverse_totient(3) ok 28 - inverse_totient(4) ok 29 - inverse_totient(2*12135413) ok 30 - inverse_totient(2*10754819) ok 31 - inverse_totient(10000008) ok 32 - inverse_totient(10000) ok 33 - inverse_totient(82260072) includes 123456789 ok 34 - sumtotient(0..10) ok 35 - sumtotient(12345) ok 36 - sumtotient(654321) ok t/19-valuation.t ............. 1..6 ok 1 - valuation(-4,2) = 2 ok 2 - valuation(0,2) = ok 3 - valuation(1,2) = 0 ok 4 - valuation(96552,6) = 3 ok 5 - valuation(1879048192,2) = 28 ok 6 - valuation(65520150907877741108803406077280119039314703968014509493068998974809747144832,2) = 7 ok t/19-znorder.t ............... 1..22 ok 1 - znorder(1, 35) = 1 ok 2 - znorder(2, 35) = 12 ok 3 - znorder(4, 35) = 6 ok 4 - znorder(6, 35) = 2 ok 5 - znorder(7, 35) = ok 6 - znorder(1, 1) = 1 ok 7 - znorder(0, 0) = ok 8 - znorder(1, 0) = ok 9 - znorder(25, 0) = ok 10 - znorder(1, 1) = 1 ok 11 - znorder(19, 1) = 1 ok 12 - znorder(1, 19) = 1 ok 13 - znorder(2, 19) = 18 ok 14 - znorder(3, 20) = 4 ok 15 - znorder(57, 1000000003) = 189618 ok 16 - znorder(67, 999999749) = 30612237 ok 17 - znorder(22, 999991815) = 69844 ok 18 - znorder(10, 2147475467) = 31448382 ok 19 - znorder(141, 2147475467) = 1655178 ok 20 - znorder(7410, 2147475467) = 39409 ok 21 - znorder(31407, 2147475467) = 266 ok 22 - znorder(2, 2405286912458753) = 1073741824 ok t/20-jordantotient.t ......... 1..13 ok 1 - Jordan's Totient J_2 ok 2 - Jordan's Totient J_7 ok 3 - Jordan's Totient J_5 ok 4 - Jordan's Totient J_3 ok 5 - Jordan's Totient J_6 ok 6 - Jordan's Totient J_4 ok 7 - Jordan's Totient J_1 ok 8 - Dedekind psi(n) = J_2(n)/J_1(n) ok 9 - Dedekind psi(n) = divisor_sum(n, moebius(d)^2 / d) ok 10 - Jordan totient 5, using jordan_totient ok 11 - Jordan totient 5, using divisor sum ok 12 - J_4(12345) ok 13 - n=12345, k=4 : n**k = divisor_sum(n, jordan_totient(k, d)) ok t/20-primorial.t ............. 1..64 ok 1 - primorial(nth(0)) ok 2 - pn_primorial(0) ok 3 - primorial(nth(1)) ok 4 - pn_primorial(1) ok 5 - primorial(nth(2)) ok 6 - pn_primorial(2) ok 7 - primorial(nth(3)) ok 8 - pn_primorial(3) ok 9 - primorial(nth(4)) ok 10 - pn_primorial(4) ok 11 - primorial(nth(5)) ok 12 - pn_primorial(5) ok 13 - primorial(nth(6)) ok 14 - pn_primorial(6) ok 15 - primorial(nth(7)) ok 16 - pn_primorial(7) ok 17 - primorial(nth(8)) ok 18 - pn_primorial(8) ok 19 - primorial(nth(9)) ok 20 - pn_primorial(9) ok 21 - primorial(nth(10)) ok 22 - pn_primorial(10) ok 23 - primorial(nth(11)) ok 24 - pn_primorial(11) ok 25 - primorial(nth(12)) ok 26 - pn_primorial(12) ok 27 - primorial(nth(13)) ok 28 - pn_primorial(13) ok 29 - primorial(nth(14)) ok 30 - pn_primorial(14) ok 31 - primorial(nth(15)) ok 32 - pn_primorial(15) ok 33 - primorial(nth(16)) ok 34 - pn_primorial(16) ok 35 - primorial(nth(17)) ok 36 - pn_primorial(17) ok 37 - primorial(nth(18)) ok 38 - pn_primorial(18) ok 39 - primorial(nth(19)) ok 40 - pn_primorial(19) ok 41 - primorial(nth(20)) ok 42 - pn_primorial(20) ok 43 - primorial(nth(21)) ok 44 - pn_primorial(21) ok 45 - primorial(nth(22)) ok 46 - pn_primorial(22) ok 47 - primorial(nth(23)) ok 48 - pn_primorial(23) ok 49 - primorial(nth(24)) ok 50 - pn_primorial(24) ok 51 - primorial(nth(25)) ok 52 - pn_primorial(25) ok 53 - primorial(nth(26)) ok 54 - pn_primorial(26) ok 55 - primorial(nth(27)) ok 56 - pn_primorial(27) ok 57 - primorial(nth(28)) ok 58 - pn_primorial(28) ok 59 - primorial(nth(29)) ok 60 - pn_primorial(29) ok 61 - primorial(nth(30)) ok 62 - pn_primorial(30) ok 63 - primorial(100) ok 64 - primorial(541) ok t/21-conseq-lcm.t ............ 1..102 ok 1 - consecutive_integer_lcm(0) ok 2 - consecutive_integer_lcm(1) ok 3 - consecutive_integer_lcm(2) ok 4 - consecutive_integer_lcm(3) ok 5 - consecutive_integer_lcm(4) ok 6 - consecutive_integer_lcm(5) ok 7 - consecutive_integer_lcm(6) ok 8 - consecutive_integer_lcm(7) ok 9 - consecutive_integer_lcm(8) ok 10 - consecutive_integer_lcm(9) ok 11 - consecutive_integer_lcm(10) ok 12 - consecutive_integer_lcm(11) ok 13 - consecutive_integer_lcm(12) ok 14 - consecutive_integer_lcm(13) ok 15 - consecutive_integer_lcm(14) ok 16 - consecutive_integer_lcm(15) ok 17 - consecutive_integer_lcm(16) ok 18 - consecutive_integer_lcm(17) ok 19 - consecutive_integer_lcm(18) ok 20 - consecutive_integer_lcm(19) ok 21 - consecutive_integer_lcm(20) ok 22 - consecutive_integer_lcm(21) ok 23 - consecutive_integer_lcm(22) ok 24 - consecutive_integer_lcm(23) ok 25 - consecutive_integer_lcm(24) ok 26 - consecutive_integer_lcm(25) ok 27 - consecutive_integer_lcm(26) ok 28 - consecutive_integer_lcm(27) ok 29 - consecutive_integer_lcm(28) ok 30 - consecutive_integer_lcm(29) ok 31 - consecutive_integer_lcm(30) ok 32 - consecutive_integer_lcm(31) ok 33 - consecutive_integer_lcm(32) ok 34 - consecutive_integer_lcm(33) ok 35 - consecutive_integer_lcm(34) ok 36 - consecutive_integer_lcm(35) ok 37 - consecutive_integer_lcm(36) ok 38 - consecutive_integer_lcm(37) ok 39 - consecutive_integer_lcm(38) ok 40 - consecutive_integer_lcm(39) ok 41 - consecutive_integer_lcm(40) ok 42 - consecutive_integer_lcm(41) ok 43 - consecutive_integer_lcm(42) ok 44 - consecutive_integer_lcm(43) ok 45 - consecutive_integer_lcm(44) ok 46 - consecutive_integer_lcm(45) ok 47 - consecutive_integer_lcm(46) ok 48 - consecutive_integer_lcm(47) ok 49 - consecutive_integer_lcm(48) ok 50 - consecutive_integer_lcm(49) ok 51 - consecutive_integer_lcm(50) ok 52 - consecutive_integer_lcm(51) ok 53 - consecutive_integer_lcm(52) ok 54 - consecutive_integer_lcm(53) ok 55 - consecutive_integer_lcm(54) ok 56 - consecutive_integer_lcm(55) ok 57 - consecutive_integer_lcm(56) ok 58 - consecutive_integer_lcm(57) ok 59 - consecutive_integer_lcm(58) ok 60 - consecutive_integer_lcm(59) ok 61 - consecutive_integer_lcm(60) ok 62 - consecutive_integer_lcm(61) ok 63 - consecutive_integer_lcm(62) ok 64 - consecutive_integer_lcm(63) ok 65 - consecutive_integer_lcm(64) ok 66 - consecutive_integer_lcm(65) ok 67 - consecutive_integer_lcm(66) ok 68 - consecutive_integer_lcm(67) ok 69 - consecutive_integer_lcm(68) ok 70 - consecutive_integer_lcm(69) ok 71 - consecutive_integer_lcm(70) ok 72 - consecutive_integer_lcm(71) ok 73 - consecutive_integer_lcm(72) ok 74 - consecutive_integer_lcm(73) ok 75 - consecutive_integer_lcm(74) ok 76 - consecutive_integer_lcm(75) ok 77 - consecutive_integer_lcm(76) ok 78 - consecutive_integer_lcm(77) ok 79 - consecutive_integer_lcm(78) ok 80 - consecutive_integer_lcm(79) ok 81 - consecutive_integer_lcm(80) ok 82 - consecutive_integer_lcm(81) ok 83 - consecutive_integer_lcm(82) ok 84 - consecutive_integer_lcm(83) ok 85 - consecutive_integer_lcm(84) ok 86 - consecutive_integer_lcm(85) ok 87 - consecutive_integer_lcm(86) ok 88 - consecutive_integer_lcm(87) ok 89 - consecutive_integer_lcm(88) ok 90 - consecutive_integer_lcm(89) ok 91 - consecutive_integer_lcm(90) ok 92 - consecutive_integer_lcm(91) ok 93 - consecutive_integer_lcm(92) ok 94 - consecutive_integer_lcm(93) ok 95 - consecutive_integer_lcm(94) ok 96 - consecutive_integer_lcm(95) ok 97 - consecutive_integer_lcm(96) ok 98 - consecutive_integer_lcm(97) ok 99 - consecutive_integer_lcm(98) ok 100 - consecutive_integer_lcm(99) ok 101 - consecutive_integer_lcm(100) ok 102 - consecutive_integer_lcm(2000) ok t/22-aks-prime.t ............. 1..13 ok 1 - is_prime(undef) ok 2 - 2 is prime ok 3 - 1 is not prime ok 4 - 0 is not prime ok 5 - -1 is not prime ok 6 - -2 is not prime ok 7 - is_aks_prime(877) is true ok 8 - is_aks_prime(69197) is true ok 9 - is_aks_prime(69199) is false ok 10 - is_aks_prime(101)=1 ok 11 - is_aks_prime(15481)=0 ok 12 - is_aks_prime(12109)=1 ok 13 - is_aks_prime(536891893)=1 ok t/23-primality-proofs.t ...... 1..88 ok 1 - 871139809 is composite ok 2 - 1490266103 is provably prime ok 3 - 20907001 is prime ok 4 - is_provable_prime_with_cert returns 2 ok 5 - certificate is non-null ok 6 - verification of certificate for 20907001 done ok 7 - prime_certificate is also non-null ok 8 - certificate is identical to first ok 9 - 809120722675364249 is prime ok 10 - is_provable_prime_with_cert returns 2 ok 11 - certificate is non-null ok 12 - verification of certificate for 809120722675364249 done ok 13 - prime_certificate is also non-null ok 14 - certificate is identical to first ok 15 - 65635624165761929287 is prime ok 16 - is_provable_prime_with_cert returns 2 ok 17 - certificate is non-null ok 18 - verification of certificate for 65635624165761929287 done ok 19 - prime_certificate is also non-null ok 20 - certificate is identical to first ok 21 - 1162566711635022452267983 is prime ok 22 - is_provable_prime_with_cert returns 2 ok 23 - certificate is non-null ok 24 - verification of certificate for 1162566711635022452267983 done ok 25 - prime_certificate is also non-null ok 26 - certificate is identical to first ok 27 - simple Lucas/Pratt proof verified ok 28 - ECPP primality proof of 1030291136596639351761062717 verified ok 29 - warning for unknown method ok 30 - ...and returns 0 ok 31 - warning for invalid Lucas/Pratt ok 32 - ...and returns 0 ok 33 - warning for invalid Lucas/Pratt ok 34 - ...and returns 0 ok 35 - warning for invalid Lucas/Pratt ok 36 - ...and returns 0 ok 37 - warning for invalid n-1 (too many arguments) ok 38 - ...and returns 0 ok 39 - warning for invalid n-1 (non-array f,a) ok 40 - ...and returns 0 ok 41 - warning for invalid n-1 (non-array a) ok 42 - ...and returns 0 ok 43 - warning for invalid n-1 (too few a values) ok 44 - ...and returns 0 ok 45 - warning for invalid ECPP (no n-certs) ok 46 - ...and returns 0 ok 47 - warning for invalid ECPP (non-array block) ok 48 - ...and returns 0 ok 49 - warning for invalid ECPP (wrong size block) ok 50 - ...and returns 0 ok 51 - warning for invalid ECPP (block n != q) ok 52 - ...and returns 0 ok 53 - warning for invalid ECPP (block point wrong format) ok 54 - ...and returns 0 ok 55 - warning for invalid ECPP (block point wrong format) ok 56 - ...and returns 0 ok 57 - verify null is composite ok 58 - verify [2] is prime ok 59 - verify [9] is composite ok 60 - verify [14] is composite ok 61 - verify BPSW with n > 2^64 fails ok 62 - verify BPSW with composite fails ok 63 - Lucas/Pratt proper ok 64 - Pratt with non-prime factors ok 65 - Pratt with non-prime factors ok 66 - Pratt with wrong factors ok 67 - Pratt with not enough factors ok 68 - Pratt with coprime a ok 69 - Pratt with non-psp a ok 70 - Pratt with a not valid for all f ok 71 - n-1 proper ok 72 - n-1 with wrong factors ok 73 - n-1 without 2 as a factor ok 74 - n-1 with a non-prime factor ok 75 - n-1 with a non-prime array factor ok 76 - n-1 without enough factors ok 77 - n-1 with bad BLS75 r/s ok 78 - n-1 with bad a value ok 79 - ECPP proper ok 80 - ECPP q is divisible by 2 ok 81 - ECPP a/b invalid ok 82 - ECPP q is too small ok 83 - ECPP multiplication wrong (infinity) ok 84 - ECPP multiplication wrong (not infinity) ok 85 - ECPP non-prime last q ok 86 - Verify Pocklington ok 87 - Verify BLS15 ok 88 - Verify ECPP3 ok t/23-random-certs.t .......... 1..6 ok 1 - Random Maurer prime returns a 80-bits prime ok 2 - with a valid certificate ok 3 - Random Shawe-Taylor prime returns a 80-bits prime ok 4 - with a valid certificate ok 5 - Random proven prime returns a 80-bits prime ok 6 - with a valid certificate ok t/24-partitions.t ............ 1..3 # Subtest: partitions ok 1 - partitions(0) ok 2 - partitions(1) ok 3 - partitions(2) ok 4 - partitions(3) ok 5 - partitions(4) ok 6 - partitions(5) ok 7 - partitions(6) ok 8 - partitions(7) ok 9 - partitions(8) ok 10 - partitions(9) ok 11 - partitions(10) ok 12 - partitions(11) ok 13 - partitions(12) ok 14 - partitions(13) ok 15 - partitions(14) ok 16 - partitions(15) ok 17 - partitions(16) ok 18 - partitions(17) ok 19 - partitions(18) ok 20 - partitions(19) ok 21 - partitions(20) ok 22 - partitions(21) ok 23 - partitions(22) ok 24 - partitions(23) ok 25 - partitions(24) ok 26 - partitions(25) ok 27 - partitions(26) ok 28 - partitions(27) ok 29 - partitions(28) ok 30 - partitions(29) ok 31 - partitions(30) ok 32 - partitions(31) ok 33 - partitions(32) ok 34 - partitions(33) ok 35 - partitions(34) ok 36 - partitions(35) ok 37 - partitions(36) ok 38 - partitions(37) ok 39 - partitions(38) ok 40 - partitions(39) ok 41 - partitions(40) ok 42 - partitions(41) ok 43 - partitions(42) ok 44 - partitions(43) ok 45 - partitions(44) ok 46 - partitions(45) ok 47 - partitions(46) ok 48 - partitions(47) ok 49 - partitions(48) ok 50 - partitions(49) ok 51 - partitions(50) ok 52 # skip partition(1001) w/out EXTENDED_TESTING ok 53 # skip partition(4128) w/out EXTENDED_TESTING ok 54 - partitions(256) ok 55 - partitions(101) ok 56 # skip partition(2347) w/out EXTENDED_TESTING ok 57 # skip partition(501) w/out EXTENDED_TESTING 1..57 ok 1 - partitions # Subtest: forpart ok 1 - forpart 0 ok 2 - forpart 1 ok 3 - forpart 2 ok 4 - forpart 3 ok 5 - forpart 4 ok 6 - forpart 6 ok 7 - forpart 17 restricted n=[2,2] ok 8 - forpart 27 restricted nmax 5 ok 9 - forpart 27 restricted nmin 20 ok 10 - forpart 19 restricted n=[10..13] ok 11 - forpart 20 restricted amax 4 ok 12 - forpart 15 restricted amin 4 ok 13 - forpart 21 restricted a=[3..6] ok 14 - forpart 22 restricted n=4 and a=[3..6] ok 15 - forpart 20 restricted to odd primes ok 16 - forpart 21 restricted amax 0 ok 17 - A007963(89) = number of odd-prime 3-tuples summing to 2*89+1 = 86 ok 18 - 23 partitioned into 4 with mininum 2 => 54 ok 19 - 23 partitioned into 4 with mininum 2 and prime => 5 ok 20 - 23 partitioned into 4 with mininum 2 and composite => 1 1..20 ok 2 - forpart # Subtest: forcomp ok 1 - forcomp 0 ok 2 - forcomp 1 ok 3 - forcomp 2 ok 4 - forcomp 3 ok 5 - forcomp 5 restricted n=3 ok 6 - forcomp 12 restricted n=3,a=[3..5] 1..6 ok 3 - forcomp ok t/25-lucas_sequences.t ....... 1..209 ok 1 - lucas_sequence U_n(1 -1) -- Fibonacci numbers ok 2 - lucas_sequence V_n(1 -1) -- Lucas numbers ok 3 - lucas_sequence U_n(2 -1) -- Pell numbers ok 4 - lucas_sequence V_n(2 -1) -- Pell-Lucas numbers ok 5 - lucas_sequence U_n(1 -2) -- Jacobsthal numbers ok 6 - lucas_sequence V_n(1 -2) -- Jacobsthal-Lucas numbers ok 7 - lucas_sequence U_n(2 2) -- sin(x)*exp(x) ok 8 - lucas_sequence V_n(2 2) -- offset sin(x)*exp(x) ok 9 - lucas_sequence U_n(2 5) -- A045873 ok 10 - lucas_sequence U_n(3 -5) -- 3*a(n-1)+5*a(n-2) [0,1] ok 11 - lucas_sequence V_n(3 -5) -- 3*a(n-1)+5*a(n-2) [2,3] ok 12 - lucas_sequence U_n(3 -4) -- 3*a(n-1)+4*a(n-2) [0,1] ok 13 - lucas_sequence V_n(3 -4) -- 3*a(n-1)+4*a(n-2) [2,3] ok 14 - lucas_sequence U_n(3 -1) -- A006190 ok 15 - lucas_sequence V_n(3 -1) -- A006497 ok 16 - lucas_sequence U_n(3 1) -- Fibonacci(2n) ok 17 - lucas_sequence V_n(3 1) -- Lucas(2n) ok 18 - lucas_sequence U_n(3 2) -- 2^n-1 Mersenne numbers (prime and composite) ok 19 - lucas_sequence V_n(3 2) -- 2^n+1 ok 20 - lucas_sequence U_n(4 -1) -- Denominators of continued fraction convergents to sqrt(5) ok 21 - lucas_sequence V_n(4 -1) -- Even Lucas numbers Lucas(3n) ok 22 - lucas_sequence U_n(4 1) -- A001353 ok 23 - lucas_sequence V_n(4 1) -- A003500 ok 24 - lucas_sequence U_n(5 4) -- (4^n-1)/3 ok 25 - lucas_sequence U_n(4 4) -- n*2^(n-1) ok 26 - lucasu(1 -1) -- Fibonacci numbers ok 27 - lucasv(1 -1) -- Lucas numbers ok 28 - lucasu(2 -1) -- Pell numbers ok 29 - lucasv(2 -1) -- Pell-Lucas numbers ok 30 - lucasu(1 -2) -- Jacobsthal numbers ok 31 - lucasv(1 -2) -- Jacobsthal-Lucas numbers ok 32 - lucasu(2 2) -- sin(x)*exp(x) ok 33 - lucasv(2 2) -- offset sin(x)*exp(x) ok 34 - lucasu(2 5) -- A045873 ok 35 - lucasu(3 -5) -- 3*a(n-1)+5*a(n-2) [0,1] ok 36 - lucasv(3 -5) -- 3*a(n-1)+5*a(n-2) [2,3] ok 37 - lucasu(3 -4) -- 3*a(n-1)+4*a(n-2) [0,1] ok 38 - lucasv(3 -4) -- 3*a(n-1)+4*a(n-2) [2,3] ok 39 - lucasu(3 -1) -- A006190 ok 40 - lucasv(3 -1) -- A006497 ok 41 - lucasu(3 1) -- Fibonacci(2n) ok 42 - lucasv(3 1) -- Lucas(2n) ok 43 - lucasu(3 2) -- 2^n-1 Mersenne numbers (prime and composite) ok 44 - lucasv(3 2) -- 2^n+1 ok 45 - lucasu(4 -1) -- Denominators of continued fraction convergents to sqrt(5) ok 46 - lucasv(4 -1) -- Even Lucas numbers Lucas(3n) ok 47 - lucasu(4 1) -- A001353 ok 48 - lucasv(4 1) -- A003500 ok 49 - lucasu(5 4) -- (4^n-1)/3 ok 50 - lucasu(4 4) -- n*2^(n-1) ok 51 - OEIS 81264: Odd Fibonacci pseudoprimes ok 52 - First entry of OEIS A141137: Even Fibonacci pseudoprimes ok 53 - lucasumod agrees ok 54 - lucasvmod agrees ok 55 - lucasuvmod(5,-1,81,323) ok 56 - lucasumod(5,-1,81,323) ok 57 - lucasvmod(5,-1,81,323) ok 58 - lucasuvmod(1,1,324,323) ok 59 - lucasumod(1,1,324,323) ok 60 - lucasvmod(1,1,324,323) ok 61 - lucasuvmod(3,1,81,323) ok 62 - lucasumod(3,1,81,323) ok 63 - lucasvmod(3,1,81,323) ok 64 - lucasuvmod(25,117,24501,49001) ok 65 - lucasumod(25,117,24501,49001) ok 66 - lucasvmod(25,117,24501,49001) ok 67 - lucasuvmod(10001,-1,4743,18971) ok 68 - lucasumod(10001,-1,4743,18971) ok 69 - lucasvmod(10001,-1,4743,18971) ok 70 - lucasuvmod(3,1,324,323) ok 71 - lucasumod(3,1,324,323) ok 72 - lucasvmod(3,1,324,323) ok 73 - lucasuvmod(1,-1,547968612,547968611) ok 74 - lucasumod(1,-1,547968612,547968611) ok 75 - lucasvmod(1,-1,547968612,547968611) ok 76 - lucasuvmod(1,-1,136992153,547968611) ok 77 - lucasumod(1,-1,136992153,547968611) ok 78 - lucasvmod(1,-1,136992153,547968611) ok 79 - lucasuvmod(1,-1,3613982122,3613982121) ok 80 - lucasumod(1,-1,3613982122,3613982121) ok 81 - lucasvmod(1,-1,3613982122,3613982121) ok 82 - lucasuvmod(1,-1,3613982124,3613982123) ok 83 - lucasumod(1,-1,3613982124,3613982123) ok 84 - lucasvmod(1,-1,3613982124,3613982123) ok 85 - lucasuvmod(1,-1,1806991061,3613982121) ok 86 - lucasumod(1,-1,1806991061,3613982121) ok 87 - lucasvmod(1,-1,1806991061,3613982121) ok 88 - lucasuvmod(4,1,324,323) ok 89 - lucasumod(4,1,324,323) ok 90 - lucasvmod(4,1,324,323) ok 91 - lucasuvmod(4,5,324,323) ok 92 - lucasumod(4,5,324,323) ok 93 - lucasvmod(4,5,324,323) ok 94 - lucasuvmod(-8882,1,77,7777) ok 95 - lucasumod(-8882,1,77,7777) ok 96 - lucasvmod(-8882,1,77,7777) ok 97 - lucasuv(-8882,1,77) % 7777 ok 98 - lucasu(-8882,1,77) % 7777 ok 99 - lucasv(-8882,1,77) % 7777 ok 100 - lucasuvmod(1976,5,32,7778) ok 101 - lucasumod(1976,5,32,7778) ok 102 - lucasvmod(1976,5,32,7778) ok 103 - lucasuv(1976,5,32) % 7778 ok 104 - lucasu(1976,5,32) % 7778 ok 105 - lucasv(1976,5,32) % 7778 ok 106 - lucasuvmod(-6,9,77,7777) ok 107 - lucasumod(-6,9,77,7777) ok 108 - lucasvmod(-6,9,77,7777) ok 109 - lucasuv(-6,9,77) % 7777 ok 110 - lucasu(-6,9,77) % 7777 ok 111 - lucasv(-6,9,77) % 7777 ok 112 - lucasuvmod(7776,1,32,7778) ok 113 - lucasumod(7776,1,32,7778) ok 114 - lucasvmod(7776,1,32,7778) ok 115 - lucasuv(7776,1,32) % 7778 ok 116 - lucasu(7776,1,32) % 7778 ok 117 - lucasv(7776,1,32) % 7778 ok 118 - lucasuvmod(3,5834,77,7777) ok 119 - lucasumod(3,5834,77,7777) ok 120 - lucasvmod(3,5834,77,7777) ok 121 - lucasuv(3,5834,77) % 7777 ok 122 - lucasu(3,5834,77) % 7777 ok 123 - lucasv(3,5834,77) % 7777 ok 124 - lucasuvmod(2,1,77,7777) ok 125 - lucasumod(2,1,77,7777) ok 126 - lucasvmod(2,1,77,7777) ok 127 - lucasuv(2,1,77) % 7777 ok 128 - lucasu(2,1,77) % 7777 ok 129 - lucasv(2,1,77) % 7777 ok 130 - lucasuvmod(8823012438914798,7334809241809243190243,37,10891238901329801329843210) ok 131 - lucasumod(8823012438914798,7334809241809243190243,37,10891238901329801329843210) ok 132 - lucasvmod(8823012438914798,7334809241809243190243,37,10891238901329801329843210) ok 133 - lucasuv(8823012438914798,7334809241809243190243,37) % 10891238901329801329843210 ok 134 - lucasu(8823012438914798,7334809241809243190243,37) % 10891238901329801329843210 ok 135 - lucasv(8823012438914798,7334809241809243190243,37) % 10891238901329801329843210 ok 136 - lucasuvmod(3,5835,77,7777) ok 137 - lucasumod(3,5835,77,7777) ok 138 - lucasvmod(3,5835,77,7777) ok 139 - lucasuv(3,5835,77) % 7777 ok 140 - lucasu(3,5835,77) % 7777 ok 141 - lucasv(3,5835,77) % 7777 ok 142 - lucasuvmod(-6,7,77,7777) ok 143 - lucasumod(-6,7,77,7777) ok 144 - lucasvmod(-6,7,77,7777) ok 145 - lucasuv(-6,7,77) % 7777 ok 146 - lucasu(-6,7,77) % 7777 ok 147 - lucasv(-6,7,77) % 7777 ok 148 - lucasuvmod(4,3,77,7777) ok 149 - lucasumod(4,3,77,7777) ok 150 - lucasvmod(4,3,77,7777) ok 151 - lucasuv(4,3,77) % 7777 ok 152 - lucasu(4,3,77) % 7777 ok 153 - lucasv(4,3,77) % 7777 ok 154 - lucasuvmod(7776,1,33,7778) ok 155 - lucasumod(7776,1,33,7778) ok 156 - lucasvmod(7776,1,33,7778) ok 157 - lucasuv(7776,1,33) % 7778 ok 158 - lucasu(7776,1,33) % 7778 ok 159 - lucasv(7776,1,33) % 7778 ok 160 - lucasuvmod(4,4,77,7777) ok 161 - lucasumod(4,4,77,7777) ok 162 - lucasvmod(4,4,77,7777) ok 163 - lucasuv(4,4,77) % 7777 ok 164 - lucasu(4,4,77) % 7777 ok 165 - lucasv(4,4,77) % 7777 ok 166 - lucasuvmod(1,5833,77,7777) ok 167 - lucasumod(1,5833,77,7777) ok 168 - lucasvmod(1,5833,77,7777) ok 169 - lucasuv(1,5833,77) % 7777 ok 170 - lucasu(1,5833,77) % 7777 ok 171 - lucasv(1,5833,77) % 7777 ok 172 - lucasuvmod(1976,5,33,7778) ok 173 - lucasumod(1976,5,33,7778) ok 174 - lucasvmod(1976,5,33,7778) ok 175 - lucasuv(1976,5,33) % 7778 ok 176 - lucasu(1976,5,33) % 7778 ok 177 - lucasv(1976,5,33) % 7778 ok 178 - lucasuvmod(1,-1,951,4) = 2 0 ok 179 - lucasuvmod(2,-1,951,4) = 1 2 ok 180 - lucasuvmod(1,-1,47,8) = 1 7 ok 181 - lucasuvmod(2,-1,47,8) = 1 6 ok 182 - lucasuvmod(1,-1,0,5) = 0 2 ok 183 - lucasuvmod(2,-1,0,5) = 0 2 ok 184 - lucasuvmod(1,-1,66,5) = 3 3 ok 185 - lucasuvmod(2,-1,66,5) = 0 3 ok 186 - lucasuvmod(-4,4,50,1001) = 173 827 ok 187 - lucasuvmod(-4,7,50,1001) = 87 457 ok 188 - lucasuvmod(1,-1,50,1001) = 330 486 ok 189 - lucasuvmod(1,-1,4,5) = 3 2 ok 190 - lucasuvmod(6,9,36,3) = 0 0 ok 191 - lucasuvmod(10,25,101,5) = 0 0 ok 192 - lucasuvmod(10,25,101,6) = 5 4 ok 193 - lucasuvmod(-6,9,0,3) = 0 2 ok 194 - lucasuvmod(30,1,15,1) = 0 0 ok 195 - lucasuvmod(3,3,1,3) = 1 0 ok 196 - lucasuvmod(-30,-30,1,3) = 1 0 ok 197 - lucasuvmod(9,5,0,1) = 0 0 ok 198 - lucasuvmod(-14,49,0,104) = 0 2 ok 199 - lucasuvmod(-14,49,1,104) = 1 90 ok 200 - lucasuvmod(2,1,1,8) = 1 2 ok 201 - lucasuvmod(0,0,1,16) = 1 0 ok 202 - lucasuvmod(11,-27,0,2) = 0 0 ok 203 - lucasuvmod(30,-2,1,3) = 1 0 ok 204 - lucasumod comparison with modint lucasu ok 205 - lucasvmod comparison with modint lucasv ok 206 - lucasuvmod comparison with modint lucasuv ok 207 - lucasuvmod with all large bigint inputs ok 208 - lucasumod with all large bigint inputs ok 209 - lucasvmod with all large bigint inputs ok t/26-binomial.t .............. 1..32 ok 1 - binomial(0..10,0..10) ok 2 - binomial(-10..-1,0..10) ok 3 - binomial(0..10,-10..-1) ok 4 - binomial(-10..-1,-10..-1) ok 5 - binomial(13,n) for n in -15 .. 15 ok 6 - binomial(-13,n) for n in -15 .. 15 ok 7 - binomial: Loeb 1995 Region 1 (positive n, positive k) ok 8 - binomial: Loeb 1995 Region 2 (negative n, positive k) ok 9 - binomial: Loeb 1995 Region 3 (negative n, negative k) ok 10 - binomial(20,15)) = 15504 ok 11 - binomial(35,16)) = 4059928950 ok 12 - binomial(40,19)) = 131282408400 ok 13 - binomial(67,31)) = 11923179284862717872 ok 14 - binomial(228,12)) = 30689926618143230620 ok 15 - binomial(34,16)) = 2203961430 ok 16 - binomial(62,28)) = 349615716557887465 ok 17 - binomial(67,30)) = 9989690752182277136 ok 18 - binomial(70,25)) = 6455761770304780752 ok 19 - binomial(125,61)) = 2923171367321931373425996933337783875 ok 20 - binomial(131,64)) = 183062151498210163887302260440097215750 ok 21 - binomial(177,78)) = 3314450882216440395106465322941753788648564665022000 ok 22 - binomial(61,17)) = 536830054536825 ok 23 - binomial(-11,22)) = 64512240 ok 24 - binomial(-12,23)) = -286097760 ok 25 - binomial(-23,-26)) = -2300 ok 26 - binomial(-12,-23)) = -705432 ok 27 - binomial(12,-23)) = 0 ok 28 - binomial(12,-12)) = 0 ok 29 - binomial(-12,0)) = 1 ok 30 - binomial(36893488147419103233,1)) = 36893488147419103233 ok 31 - binomial(36893488147419103233,2)) = 680564733841876926945195958937245974528 ok 32 - binomial(36893488147419103233,3)) = 8369468980515574351781052564276888554796991677927476166656 ok t/26-binomialmod.t ........... 1..25 ok 1 - binomialmod(0,0,7) = 1 ok 2 - binomialmod(0,1,7) = 0 ok 3 - binomialmod(0,2,7) = 0 ok 4 - binomialmod(3,0,7) = 1 ok 5 - binomialmod(7,5,11) = 10 ok 6 - binomialmod(950,100,123456) = 24942 ok 7 - binomialmod(950,100,7) = 2 ok 8 - binomialmod(8100,4000,1155) = 924 ok 9 - binomialmod(950,100,1000000007) = 640644226 ok 10 - binomialmod(189,34,877) = 81 ok 11 - binomialmod(189,34,253009) = 47560 ok 12 - binomialmod(189,34,36481) = 14169 ok 13 - binomialmod(1900,17,41) = 0 ok 14 - binomialmod(5000,654,101223721) = 59171352 ok 15 - binomialmod(-112,5,351) = 313 ok 16 - binomialmod(-189,34,877) = 141 ok 17 - binomialmod(-23,-29,377) = 117 ok 18 - binomialmod(189,-34,877) = 0 ok 19 - binomialmod(100000000,87654321,1005973) = 937361 ok 20 - binomialmod(100000000,7654321,1299709) = 582708 ok 21 - binomialmod(100000000,7654321,12345678) = 4152168 ok 22 - binomialmod(100000,7654,32768) = 12288 ok 23 - binomialmod(100000,7654,196608) = 110592 ok 24 - binomialmod(100000,7654,101223721) = 5918452 ok 25 - Small binomialmod works ok t/26-chenprimes.t ............ 1..4 ok 1 - is_chen_prime(0..200) ok 2 - next_chen_prime for small values ok 3 - is_chen_prime(10^13+687) ok 4 # skip large next_chen_prime only with EXTENDED_TESTING ok t/26-combinatorial.t ......... 1..5 # Subtest: forcomb ok 1 - forcomb {} 0 ok 2 - forcomb {} 1 ok 3 - forcomb {} 2 ok 4 - forcomb {} 3 ok 5 - forcomb {} 0,0 ok 6 - forcomb {} 5,6 ok 7 - forcomb {} 5,5 ok 8 - forcomb {} 5,4 ok 9 - forcomb {} 5,3 ok 10 - forcomb {} 5,2 ok 11 - forcomb {} 5,1 ok 12 - forcomb {} 5,0 ok 13 - forcomb {} 4,4 ok 14 - forcomb {} 4,3 ok 15 - forcomb {} 4,2 ok 16 - forcomb {} 4,1 ok 17 - forcomb {} 4,0 ok 18 - forcomb {} 3,2 ok 19 - forcomb 4,3 ok 20 - forcomb { } 20,15 yields binomial(20,15) combinations 1..20 ok 1 - forcomb # Subtest: forperm ok 1 - forperm 1 ok 2 - forperm 3 ok 3 - forperm 2 ok 4 - forperm 0 ok 5 - forperm 4 ok 6 - forperm 7 yields factorial(7) permutations 1..6 ok 2 - forperm # Subtest: formultiperm ok 1 - formultiperm [] ok 2 - formultiperm 1,2,2 ok 3 - formultiperm a,a,b,b ok 4 - formultiperm aabb 1..4 ok 3 - formultiperm # Subtest: forderange ok 1 - forderange 0 ok 2 - forderange 1 ok 3 - forderange 2 ok 4 - forderange 3 ok 5 - forderange 7 count 1..5 ok 4 - forderange # Subtest: numtoperm / permtonum ok 1 - numtoperm(0,0) ok 2 - numtoperm(1,0) ok 3 - numtoperm(1,1) ok 4 - numtoperm(5,15) ok 5 - numtoperm(24,987654321) ok 6 - permtonum([]) ok 7 - permtonum([0]) ok 8 - permtonum([6,3,4,2,5,0,1]) ok 9 - permtonum( 20 ) ok 10 - permtonum( 26 ) ok 11 - permtonum(numtoperm) 1..11 ok 5 - numtoperm / permtonum ok t/26-congruentnum.t .......... 1..61 ok 1 - congruent numbers to 200 ok 2 - congruent numbers 10^6 + (1..10) ok 3 - congruent numbers to 200 (no filtering) ok 4 - Non-congruent family of p3 ok 5 - Non-congruent family of (1+sqrt2,p) ok 6 - Non-congruent family of 2p Bastien ok 7 - Non-congruent family of pq 33 ok 8 - Non-congruent family of pq 13 ok 9 - Non-congruent family of pq 57 ok 10 - Non-congruent family of 2pq 55 ok 11 - Non-congruent family of 2pq 33 ok 12 - Non-congruent family of 2pq 15 ok 13 - Non-congruent family of 2pq 37 ok 14 - Non-congruent family of 2pq 77 ok 15 - Non-congruent family of 2pq 11 ok 16 - Non-congruent family of pqr 133 ok 17 - Non-congruent family of pqr 357 ok 18 - Non-congruent family of pqr 377 ok 19 - Non-congruent family of pqr 131 ok 20 - Non-congruent family of pqr 131 (2) ok 21 - Non-congruent family of pqr 157 ok 22 - Non-congruent family of pqr 355 ok 23 - Non-congruent family of pqr 333 ok 24 - Non-congruent family of pqr 111 ok 25 - Non-congruent family of 2pqr 133 ok 26 - Non-congruent family of 2pqr 155 ok 27 - Non-congruent family of 2pqr 357 ok 28 - Non-congruent family of 2pqr 111 ok 29 - Non-congruent family of 2pqr 577 ok 30 - Non-congruent family of 2pqr 115 ok 31 - Non-congruent family of 2pqr 335 ok 32 - Non-congruent family of 2pqr 555 ok 33 - Non-congruent family of pqrs 5577 ok 34 - Non-congruent family of pqrs 3357 ok 35 - Non-congruent family of pqrs 1333 ok 36 - Non-congruent family of pqrs 3333 ok 37 - Non-congruent family of pqrs 1357 ok 38 - Non-congruent family of pqrs 1133 ok 39 - Non-congruent family of 2pqrs 1133 ok 40 - Non-congruent family of 2pqrs 3557 ok 41 - Non-congruent family of 2pqrs 1335 ok 42 - Non-congruent family of 2pqrs 3337 ok 43 - Non-congruent family of 2pqrs 1555 ok 44 - Non-congruent family of 2pqrs 3333 ok 45 - Non-congruent family of 2pqrs 5555 ok 46 - Non-congruent family of 2pqrs 3355 ok 47 - Non-congruent family of Iskra 1996 ok 48 - Non-congruent family of Reinholz 2013 ok 49 - Non-congruent family of Cheng 2019 ok 50 - Non-congruent family of Cheng 2018 T1.1 ok 51 - Non-congruent family of Cheng 2018 T1.2 ok 52 - Non-congruent family of Cheng 2018 T1.3 ok 53 - Non-congruent family of Cheng 2018 T1.4 ok 54 - Non-congruent family of Das 2020 ok 55 # skip NC filters don't use arbitrary factor order ok 56 # skip NC filters don't use arbitrary factor order ok 57 # skip NC filters don't use arbitrary factor order ok 58 # skip NC filters don't use arbitrary factor order ok 59 # skip NC filters don't use arbitrary factor order ok 60 # skip NC filters don't use arbitrary factor order ok 61 # skip NC filters don't use arbitrary factor order ok t/26-contfrac.t .............. 1..7 # Subtest: contfrac and from_contfrac roundtrip ok 1 - contfrac(0,1) ok 2 - from_contfrac(0) ok 3 - contfrac(1,3) ok 4 - from_contfrac(0 3) ok 5 - contfrac(4,11) ok 6 - from_contfrac(0 2 1 3) ok 7 - contfrac(67,29) ok 8 - from_contfrac(2 3 4 2) ok 9 - contfrac(121,23) ok 10 - from_contfrac(5 3 1 5) ok 11 - contfrac(3,4837) ok 12 - from_contfrac(0 1612 3) ok 13 - contfrac(65521,32749) ok 14 - from_contfrac(2 1423 1 6 1 2) ok 15 - contfrac(83116,51639) ok 16 - from_contfrac(1 1 1 1 1 3 1 1 2 2 4 1 2 1 1 1 3) ok 17 - contfrac(9238492834,2398702938777) ok 18 - from_contfrac(0 259 1 1 1 3 1 7 2 3 7 2 1 1 2 4 2 1 10 5 3 1 5 6) ok 19 - contfrac(243224233245235253407096734543059,4324213412343432913758138673203834) ok 20 - from_contfrac(0 17 1 3 1 1 12 1 2 33 2 1 1 1 1 49 1 1 1 1 17 34 1 1 304 1 2 1 1 1 2 1 48 1 20 2 3 5 1 1 16 9 1 1 5 1 2 2 7 4 3 1 7 1 1 17 1 1 29 1 12 2 5) ok 21 - contfrac(415,93) ok 22 - from_contfrac(4 2 6 7) ok 23 - contfrac(649,200) ok 24 - from_contfrac(3 4 12 4) ok 25 - contfrac(4,9) ok 26 - from_contfrac(0 2 4) 1..26 ok 1 - contfrac and from_contfrac roundtrip # Subtest: pi convergents ok 1 - contfrac(22/7) ok 2 - from_contfrac pi convergent ok 3 - contfrac(333/106) ok 4 - from_contfrac pi convergent ok 5 - contfrac(355/113) ok 6 - from_contfrac pi convergent ok 7 - contfrac(377/120) ok 8 - from_contfrac pi convergent ok 9 - contfrac(3927/1250) ok 10 - from_contfrac pi convergent ok 11 - contfrac(103993/33102) ok 12 - from_contfrac pi convergent ok 13 - contfrac(104348/33215) ok 14 - from_contfrac pi convergent ok 15 - contfrac(208341/66317) ok 16 - from_contfrac pi convergent ok 17 - contfrac(312689/99532) ok 18 - from_contfrac pi convergent ok 19 - contfrac(833719/265381) ok 20 - from_contfrac pi convergent ok 21 - contfrac(1146408/364913) ok 22 - from_contfrac pi convergent ok 23 - contfrac(4272943/1360120) ok 24 - from_contfrac pi convergent ok 25 - contfrac(80143857/25510582) ok 26 - from_contfrac pi convergent ok 27 - contfrac(262452630335382199398/83541266890691994833) ok 28 - from_contfrac pi convergent 1..28 ok 2 - pi convergents # Subtest: Fibonacci ratio convergents ok 1 - contfrac(F/F) len 12 ok 2 - from_contfrac(F/F) len 12 ok 3 - contfrac(F/F) len 92 ok 4 - from_contfrac(F/F) len 92 ok 5 - contfrac(F/F) len 200 ok 6 - from_contfrac(F/F) len 200 1..6 ok 3 - Fibonacci ratio convergents # Subtest: non-coprime inputs ok 1 - contfrac(62832,20000) non-coprime ok 2 - contfrac(0,2) non-coprime ok 3 - contfrac(8,22) non-coprime 1..3 ok 4 - non-coprime inputs # Subtest: negative numerator ok 1 - contfrac(-93,37) ok 2 - from_contfrac(-3 2 18) ok 3 - contfrac(-312689,99532) ok 4 - from_contfrac(-4 1 6 15 1 292 1 2) ok 5 - contfrac(-4,11) ok 6 - from_contfrac(-1 1 1 1 3) ok 7 - contfrac(-4,5837) ok 8 - from_contfrac(-1 1 1458 4) ok 9 - contfrac(-4,11111) ok 10 - from_contfrac(-1 1 2776 1 3) ok 11 - contfrac(-1,11111) ok 12 - from_contfrac(-1 1 11110) ok 13 - contfrac(-11110,11111) ok 14 - from_contfrac(-1 11111) ok 15 - contfrac(-11112,11111) ok 16 - from_contfrac(-2 1 11110) ok 17 - contfrac(-1,1) ok 18 - from_contfrac(-1) ok 19 - contfrac(-7,1) ok 20 - from_contfrac(-7) ok 21 - contfrac(-100,1) ok 22 - from_contfrac(-100) 1..22 ok 5 - negative numerator # Subtest: edge cases ok 1 - contfrac(0,1) ok 2 - from_contfrac(0) ok 3 - contfrac(1,1) ok 4 - from_contfrac(1) ok 5 - contfrac(7,1) ok 6 - from_contfrac(7) ok 7 - contfrac(100,1) ok 8 - from_contfrac(100) ok 9 - contfrac(1,2) ok 10 - from_contfrac(0,2) ok 11 - contfrac(1,3) ok 12 - from_contfrac(0,3) ok 13 - contfrac(1,100) ok 14 - from_contfrac(0,100) ok 15 - from_contfrac() = (0,1) ok 16 - from_contfrac(-3) ok 17 - from_contfrac(-3,7) ok 18 - contfrac(0,100) ok 19 - from_contfrac(0) = (0,1) 1..19 ok 6 - edge cases # Subtest: bigint ok 1 - contfrac(1180591620717411303425,590295810358705651712) bigint ok 2 - from_contfrac bigint 1..2 ok 7 - bigint ok t/26-cornacchia.t ............ 1..15 ok 1 - Expected (0,0) for x^2 + 0*y^2 = 0 ok 2 - Expected no solution for for x^2 + 0*y^2 = 13 ok 3 - Expected (4,0) for x^2 + 0*y^2 = 16 ok 4 - Expected (8,7) for x^2 + 1*y^2 = 113 ok 5 - Expected (3,2) for x^2 + 5*y^2 = 29 ok 6 - Expected (2,4) for x^2 + 7*y^2 = 116 ok 7 - Expected (52,45) for x^2 + 5*y^2 = 12829 ok 8 - Expected (7,3) for x^2 + 6*y^2 = 103 ok 9 - Expected (16,14) for x^2 + 1*y^2 = 452 ok 10 - Expected (20,6) for x^2 + 1*y^2 = 436 ok 11 - Expected (21,9) for x^2 + 2*y^2 = 603 ok 12 - Expected (10547339,694995) for x^2 + 24*y^2 = 122838793181521 ok 13 - Expected (135,41) for x^2 + 59551*y^2 = 100123456 ok 14 - Expected (9934,5) for x^2 + 57564*y^2 = 100123456 ok 15 - Expected (3016,40) for x^2 + 56892*y^2 = 100123456 ok t/26-delicateprime.t ......... 1..9 ok 1 - is_delicate_prime(504991) = 0 ok 2 - is_delicate_prime(929573) = 0 ok 3 - is_delicate_prime(n) = 1 for first 25 known. ok 4 - first delicate primes for bases 2, 5, 8, 10, and 16. ok 5 - First 9 delicate primes base 2 ok 6 - First 9 delicate primes base 3 ok 7 - First 9 delicate primes base 5 ok 8 - First 9 delicate primes base 7 ok 9 - First 9 delicate primes base 11 ok t/26-digits.t ................ 1..47 ok 1 - fromdigits binary with leading 0 ok 2 - fromdigits binary ok 3 - fromdigits decimal ok 4 - fromdigits base 3 ok 5 - fromdigits base 16 ok 6 - fromdigits base 16 with overflow ok 7 - fromdigits base 5 with carry ok 8 - fromdigits base 3 with carry ok 9 - fromdigits base 2 with carry ok 10 - fromdigits base 16 with many digits ok 11 - fromdigits hex string ok 12 - fromdigits decimal ok 13 - fromdigits with Large base 36 number ok 14 - todigits 0 ok 15 - todigits 1 ok 16 - todigits 77 ok 17 - todigits 77 base 2 ok 18 - todigits 77 base 3 ok 19 - todigits 77 base 21 ok 20 - todigits 900 base 2 ok 21 - todigits 900 base 2 len 0 ok 22 - todigits 900 base 2 len 3 ok 23 - todigits 900 base 2 len 32 ok 24 - vecsum of todigits of bigint ok 25 - todigits ignores negative sign ok 26 - sumdigits(-45.36) ok 27 - sumdigits 0 to 1000 ok 28 - sumdigits hex ok 29 - sumdigits bigint ok 30 - sumdigits ignores negative sign ok 31 - todigitstring base 3 ok 32 - todigitstring base 9 ok 33 - todigitstring base 11 ok 34 - todigitstring ignores negative sign ok 35 - todigitstring will 0 pad ok 36 - todigits 1234135634 base 16 ok 37 - todigits 56 base 2 len 8 ok 38 - fromdigits of previous ok 39 - 56 as binary string ok 40 - fromdigits of previous ok 41 - todigitstring 37 ok 42 - fromdigits 5128 base 10 ok 43 - fromdigits 91 base 2 ok 44 - fromdigits 1923 base 10 ok 45 - fromdigits 91 base 2 ok 46 - fromdigits with carry ok 47 - only last 4 digits ok t/26-factorial.t ............. 1..5 # Subtest: factorial ok 1 - factorial(-5) gives error ok 2 - factorial(0..100) matched Math::BigInt 1..2 ok 1 - factorial # Subtest: subfactorial ok 1 - subfactorial(-5) gives error ok 2 - subfactoral(n) for 0..23 ok 3 - subfactorial(110) 1..3 ok 2 - subfactorial ok 3 - fubini(n) for 0..19 # Subtest: falling_factorial ok 1 - falling_factorial(-10..10, 0..10) ok 2 - falling_factorial selected values 1..2 ok 4 - falling_factorial # Subtest: rising_factorial ok 1 - rising_factorial(-10..10, 0..10) ok 2 - rising_factorial selected values 1..2 ok 5 - rising_factorial ok t/26-factorialmod.t .......... 1..4 ok 1 - factorialmod n! mod m for m 1 to 50, n 0 to m ok 2 - 1000000000! mod 1000000008 is zero ok 3 - 50000! mod 10000019 ok 4 # skip large value without EXTENDED_TESTING on 64-bit ok t/26-frobeniusnum.t .......... 1..8 ok 1 - frobenius_number() = undef ok 2 - frobenius_number(4093) = undef ok 3 - Non-coprime set gives error ok 4 - frobenius_number simple tests ok 5 - frobenius_number bigger tests ok 6 - frobenius_number hard knapsack problems ok 7 - frobenius_number(12345,1494268454735486) = 18445249805254826839 ok 8 - frobenius_number(12345,14948739119699798) = 184527235693574294167 ok t/26-goldbach.t .............. 1..7 ok 1 - minimal_goldbach_pair for small inputs ok 2 - minimal_goldbach_pair(60119912) = 1093 ok 3 # skip skipping minimal_goldbach_pair(83778272185315920949659591651127238812) without EXTENDED_TESTING ok 4 - minimal_goldbach_pair(3325581707333960528) = 9781 ok 5 - minimal_goldbach_pair(15317795894) = 2017 ok 6 - goldbach_pair_count for small inputs ok 7 - goldbach_pairs for small inputs ok t/26-isalmostprime.t ......... 1..32 ok 1 - is_almost_prime(0, 0..40) ok 2 - is_almost_prime(1, 0..40) ok 3 - is_almost_prime(2, 0..40) ok 4 - is_almost_prime(3, 0..40) ok 5 - is_almost_prime(4, 0..40) ok 6 - is_almost_prime(5, 0..40) ok 7 - is_almost_prime(6, 0..40) ok 8 - is_almost_prime(7, 0..40) ok 9 - is_almost_prime(8, 0..40) ok 10 - is_almost_prime(9, 0..40) ok 11 - is_almost_prime(10, 0..40) ok 12 - Test first 10 7-almost-primes return true ok 13 - Test first 10 20-almost-primes return true ok 14 - Test first 10 17-almost-primes return true ok 15 - Test first 10 14-almost-primes return true ok 16 - Test first 1 0-almost-primes return true ok 17 - Test first 10 11-almost-primes return true ok 18 - Test first 10 15-almost-primes return true ok 19 - Test first 10 8-almost-primes return true ok 20 - Test first 10 2-almost-primes return true ok 21 - Test first 10 19-almost-primes return true ok 22 - Test first 10 16-almost-primes return true ok 23 - Test first 10 12-almost-primes return true ok 24 - Test first 10 1-almost-primes return true ok 25 - Test first 10 9-almost-primes return true ok 26 - Test first 10 4-almost-primes return true ok 27 - Test first 10 10-almost-primes return true ok 28 - Test first 10 18-almost-primes return true ok 29 - Test first 10 13-almost-primes return true ok 30 - Test first 10 5-almost-primes return true ok 31 - Test first 10 3-almost-primes return true ok 32 - Test first 10 6-almost-primes return true ok t/26-iscarmichael.t .......... 1..9 ok 1 - Carmichael numbers to 20000 ok 2 - Large Carmichael ok 3 - Large Carmichael ok 4 - Large non-Carmichael ok 5 - Medium size non-Carmichael numbers that should be quickly rejected ok 6 - Quasi-Carmichael numbers to 400 ok 7 - 95 Quasi-Carmichael numbers under 5000 ok 8 - 5092583 is a Quasi-Carmichael number with 1 base ok 9 - 777923 is a Quasi-Carmichael number with 7 bases ok t/26-iscyclic.t .............. 1..4 ok 1 - Cyclic numbers -20 to 20: primes plus 15 ok 2 - Cyclic composites under 200 ok 3 - 32753 (the 10,000th cyclic number) is cyclic ok 4 # skip count 10k cyclic numbers only with extended testing ok t/26-isdivisible.t ........... 1..87 ok 1 - is_divisible(x,0) = 0 for x != 0 ok 2 - is_divisible(x,1) for 32-bit x ok 3 - is_divisible(x,1) for 64-bit x ok 4 - is_divisible(-x,1) for 32-bit x ok 5 - is_divisible(x,-1) for 32-bit x ok 6 - is_divisible(-x,-1) for 32-bit x ok 7 - is_divisible(x,2) for 32-bit x ok 8 - is_divisible(x,2) for 64-bit x ok 9 - is_divisible(-x,2) for 32-bit x ok 10 - is_divisible(x,-2) for 32-bit x ok 11 - is_divisible(-x,-2) for 32-bit x ok 12 - is_divisible(x,3) for 32-bit x ok 13 - is_divisible(x,3) for 64-bit x ok 14 - is_divisible(-x,3) for 32-bit x ok 15 - is_divisible(x,-3) for 32-bit x ok 16 - is_divisible(-x,-3) for 32-bit x ok 17 - is_divisible(x,4) for 32-bit x ok 18 - is_divisible(x,4) for 64-bit x ok 19 - is_divisible(-x,4) for 32-bit x ok 20 - is_divisible(x,-4) for 32-bit x ok 21 - is_divisible(-x,-4) for 32-bit x ok 22 - is_divisible(x,5) for 32-bit x ok 23 - is_divisible(x,5) for 64-bit x ok 24 - is_divisible(-x,5) for 32-bit x ok 25 - is_divisible(x,-5) for 32-bit x ok 26 - is_divisible(-x,-5) for 32-bit x ok 27 - is_divisible(x,6) for 32-bit x ok 28 - is_divisible(x,6) for 64-bit x ok 29 - is_divisible(-x,6) for 32-bit x ok 30 - is_divisible(x,-6) for 32-bit x ok 31 - is_divisible(-x,-6) for 32-bit x ok 32 - is_divisible(x,7) for 32-bit x ok 33 - is_divisible(x,7) for 64-bit x ok 34 - is_divisible(-x,7) for 32-bit x ok 35 - is_divisible(x,-7) for 32-bit x ok 36 - is_divisible(-x,-7) for 32-bit x ok 37 - is_divisible(x,8) for 32-bit x ok 38 - is_divisible(x,8) for 64-bit x ok 39 - is_divisible(-x,8) for 32-bit x ok 40 - is_divisible(x,-8) for 32-bit x ok 41 - is_divisible(-x,-8) for 32-bit x ok 42 - is_divisible(x,9) for 32-bit x ok 43 - is_divisible(x,9) for 64-bit x ok 44 - is_divisible(-x,9) for 32-bit x ok 45 - is_divisible(x,-9) for 32-bit x ok 46 - is_divisible(-x,-9) for 32-bit x ok 47 - is_divisible(0,0) = 1 ok 48 - is_divisible(17,0) = 0 ok 49 - is_divisible(0,1) = 1 ok 50 - is_divisible(123,1) = 1 ok 51 - is_divisible(-123,1) = 1 ok 52 - is_divisible(0,2) = 1 ok 53 - is_divisible(1,2) = 0 ok 54 - is_divisible(2,2) = 1 ok 55 - is_divisible(-2,2) = 1 ok 56 - is_divisible(340282366920938463463374607431768211456,2) = 1 ok 57 - is_divisible(340282366920938463463374607431768211457,2) = 0 ok 58 - is_divisible(3689348814741910323,3) = 1 ok 59 - is_divisible(3689348814741910322,3) = 0 ok 60 - is_divisible(68056473384187692692674921486353642291,3) = 1 ok 61 - is_divisible(68056473384187692692674921486353642290,3) = 0 ok 62 - is_divisible(3689348813882916864,6442450944) = 1 ok 63 - is_divisible(68056473384187692688985572671611731968,27670116110564327424) = 1 ok 64 - is_divisible(408338840305126156152360180103379943424,27670116110564327424) = 0 ok 65 - is_divisible(10223372036854775807,-10223372036854775807) = 1 ok 66 - is_divisible(36472996418050588672,33171997) = 1 ok 67 - is_divisible(26000117000117,2,3,5,7,11) ok 68 - is_divisible(26000117000117,2,3,5,7,11,13) ok 69 - is_congruent(x,-2,0) = 0 for x != -2 ok 70 - is_congruent(x,-1,0) = 0 for x != -1 ok 71 - is_congruent(x,0,0) = 0 for x != 0 ok 72 - is_congruent(x,1,0) = 0 for x != 1 ok 73 - is_congruent(x,2,0) = 0 for x != 2 ok 74 - is_congruent(x,3,13) for 32-bit and 64-bit x ok 75 - is_congruent(x,-27,17) for 32-bit and 64-bit x ok 76 - is_congruent(0,0,0) = 1 ok 77 - is_congruent(11,11,0) = 1 ok 78 - is_congruent(3,11,0) = 0 ok 79 - is_congruent(0,0,1) = 1 ok 80 - is_congruent(1,0,1) = 1 ok 81 - is_congruent(0,1,1) = 1 ok 82 - is_congruent(123,456,1) = 1 ok 83 - is_congruent(335812727629498640265,2812431594283598168865,1) = 1 ok 84 - is_congruent(3689348814741910323,858993459,6442450944) = 1 ok 85 - is_congruent(68056473384187692692674921486353642291,3689348814741910323,27670116110564327424) = 1 ok 86 - is_congruent(18325193793,-9162596895,13743895344) = 1 ok 87 - is_congruent(78706108047827420225,-39353054023913710111,59029581035870565168) = 1 ok t/26-isfundamental.t ......... 1..4 ok 1 - is_fundamental(-50 .. 0) ok 2 - is_fundamental(0 .. 50) ok 3 - is_fundamental(2^67+73) ok 4 - is_fundamental(-2^67+17) ok t/26-isgaussianprime.t ....... 1..7 ok 1 - 29 is not a Gaussian Prime ok 2 - 31 is a Gaussian Prime ok 3 - 0-29i is not a Gaussian Prime ok 4 - 0-31i is a Gaussian Prime ok 5 - 58924+132000511i is a Gaussian Prime ok 6 - 519880-2265929i is a Gaussian Prime ok 7 - 20571+150592260i is not a Gaussian Prime ok t/26-ishappy.t ............... 1..16 ok 1 - is_happy(0..715) boolean ok 2 - is_happy(0..709) heights ok 3 - 78999 has a happy height of 8 ok 4 - 3788(9)_973 has a happy height of 9 ok 5 - 31 is the start of 2 consecutive happy numbers ok 6 - 1880 is the start of 3 consecutive happy numbers ok 7 - 7839 is the start of 4 consecutive happy numbers ok 8 - 44488 is the start of 5 consecutive happy numbers ok 9 - 7899999999999959999999996 is the start of 6 consecutive happy numbers ok 10 - 7899999999999959999999996 is the start of 7 consecutive happy numbers ok 11 - some selected examples ok 12 - is_happy(0..214,3,2) boolean (base 3) ok 13 - is_happy(0..250,5,2) boolean (base 5) ok 14 - is_happy(0..149,16,2) boolean (base 16) ok 15 - is_happy(0..500,36,2) boolean (base 36) ok 16 - is_happy(0..3000,10,3) boolean (sum of cubes of digits) ok t/26-isodd.t ................. 1..4 ok 1 - is_odd(-50..50) ok 2 - is_even(-50..50) ok 3 - is_odd bigint ok 4 - is_even bigint ok t/26-isomegaprime.t .......... 1..11 ok 1 - some omega primes correctly calculated ok 2 - 1-omega primes 10000 .. 10100 ok 3 - 2-omega primes 10000 .. 10100 ok 4 - 3-omega primes 10000 .. 10100 ok 5 - 4-omega primes 10000 .. 10100 ok 6 - 5-omega primes 10000 .. 10100 ok 7 - 6-omega primes 10000 .. 10100 ok 8 - is_omega_prime(10,24705358214159761813058494125740243) ok 9 - is_omega_prime(14,264161530428233522652629658999365) ok 10 - is_omega_prime(18,32271228927564477576537111610496905348679567) = 0 ok 11 - is_omega_prime(17,32271228927564477576537111610496905348679567) ok t/26-isperfectnumber.t ....... 1..3 ok 1 - is_perfect_number(-10 .. 500) ok 2 - perfect: [8128 33550336 8589869056 137438691328 2305843008139952128 2658455991569831744654692615953842176] ok 3 - not perfect: [8505 12285 19845 28665 31185 198585576189 8 32 2096128 35184367894528 144115187807420416 9444732965670570950656] ok t/26-ispower.t ............... 1..86 ok 1 - is_power 0 .. 32 ok 2 - is_prime_power 0 .. 32 ok 3 - is_power 200 small ints ok 4 - is_prime_power 200 small ints ok 5 - ispower(609359740010496,0,r) = 6^19. Expect 6^19 ok 6 - ispower(10000000000000000000,0,r) = 10^19. Expect 10^19 ok 7 - ispower(12157665459056928801,0,r) = 3^40. Expect 3^40 ok 8 - ispower(16926659444736,0,r) = 6^17. Expect 6^17 ok 9 - ispower(9223372036854775808,0,r) = 2^63. Expect 2^63 ok 10 - ispower(789730223053602816,0,r) = 6^23. Expect 6^23 ok 11 - ispower(100000000000000000,0,r) = 10^17. Expect 10^17 ok 12 - ispower(4611686018427387904,0,r) = 2^62. Expect 2^62 ok 13 - ispower(4738381338321616896,0,r) = 6^24. Expect 6^24 ok 14 - isprimepower => 3909821048582988049 = 7^22 (7 22) ok 15 - isprimepower => 762939453125 = 5^17 (5 17) ok 16 - isprimepower => 450283905890997363 = 3^37 (3 37) ok 17 - isprimepower => 11920928955078125 = 5^23 (5 23) ok 18 - isprimepower => 11398895185373143 = 7^19 (7 19) ok 19 - isprimepower => 8650415919381337933 = 13^17 (13 17) ok 20 - isprimepower => 12157665459056928801 = 3^40 (3 40) ok 21 - isprimepower => 232630513987207 = 7^17 (7 17) ok 22 - isprimepower => 7450580596923828125 = 5^27 (5 27) ok 23 - isprimepower => 68630377364883 = 3^29 (3 29) ok 24 - isprimepower => 617673396283947 = 3^31 (3 31) ok 25 - isprimepower => 5559917313492231481 = 11^18 (11 18) ok 26 - isprimepower => 15181127029874798299 = 19^15 (19 15) ok 27 - isprimepower => 2862423051509815793 = 17^15 (17 15) ok 28 - -8 is a third power ok 29 - -8 is a third power of -2 ok 30 - -8 is not a fourth power ok 31 - -16 is not a fourth power ok 32 - is_power(n) returns 2 for [4 9 25 36 49 18446743927680663841] ok 33 - is_power(n,2) returns 1 for [4 9 25 36 49 18446743927680663841] ok 34 - is_power(n) returns 40 for [1099511627776 12157665459056928801] ok 35 - is_power(n,40) returns 1 for [1099511627776 12157665459056928801] ok 36 - is_power(n) returns 3 for [8 27 125 343 17576 2250923753991375] ok 37 - is_power(n,3) returns 1 for [8 27 125 343 17576 2250923753991375] ok 38 - is_power(n) returns 0 for [-2 -1 0 1 2 3 5 6 7 10 11 12 13 14 15 17 18 19 9908918038843197151] ok 39 - is_power(n,0) returns 0 for [-2 -1 0 1 2 3 5 6 7 10 11 12 13 14 15 17 18 19 9908918038843197151] ok 40 - is_power(n) returns 4 for [16 38416 1150530828529256001] ok 41 - is_power(n,4) returns 1 for [16 38416 1150530828529256001] ok 42 - is_power(n) returns 17 for [129140163 232630513987207] ok 43 - is_power(n,17) returns 1 for [129140163 232630513987207] ok 44 - is_power(n) returns 9 for [19683 1000000000 118587876497] ok 45 - is_power(n,9) returns 1 for [19683 1000000000 118587876497] ok 46 - is_power(n) returns 11 for [362797056 12200509765705829] ok 47 - is_power(n,11) returns 1 for [362797056 12200509765705829] ok 48 - is_power(n) returns 31 for [617673396283947] ok 49 - is_power(n,31) returns 1 for [617673396283947] ok 50 - is_power(n) returns 13 for [1594323 9904578032905937] ok 51 - is_power(n,13) returns 1 for [1594323 9904578032905937] ok 52 - Every integer is a first power ok 53 - is_power(-7^0 ) = 0 ok 54 - is_power(-7^1 ) = 0 ok 55 - is_power(-7^2 ) = 0 ok 56 - is_power(-7^3 ) = 3 ok 57 - is_power(-7^4 ) = 0 ok 58 - is_power(-7^5 ) = 5 ok 59 - is_power(-7^6 ) = 3 ok 60 - is_power(-7^7 ) = 7 ok 61 - is_power(-7^8 ) = 0 ok 62 - is_power(-7^9 ) = 9 ok 63 - is_power(-7^10 ) = 5 ok 64 - -1 is a 5th power ok 65 - 24 isn't a perfect square... ok 66 - ...and the root wasn't set ok 67 - 1000031^3 is a perfect cube... ok 68 - ...and the root was set ok 69 - 36^5 is a 10th power... ok 70 - ...and the root is 6 ok 71 - 56129 is not a 3rd power ok 72 - 50653 is a 3rd power ok 73 - 76840601 is not a 5th power ok 74 - 69343957 is a 5th power ok 75 - 4782969 is a 7th power ok 76 - 4782971 is not a 7th power ok 77 - is_square for -4 .. 16 ok 78 - 603729 is a square ok 79 - is_square() = 1 ok 80 - is_sum_of_squares (k=0) for -10 .. 10 ok 81 - is_sum_of_squares (k=1) for -10 .. 10 ok 82 - is_sum_of_squares (k=2) for -10 .. 100 ok 83 - is_sum_of_squares (k=3) for -10 .. 100 ok 84 - is_sum_of_squares (k=4) for -10 .. 10 ok 85 - is_sum_of_squares (k=2) for selected non-representable integers ok 86 - is_sum_of_squares (k=3) for selected integers ok t/26-issemiprime.t ........... 1..6 ok 1 - Semiprimes that were incorrectly calculated in v0.70 ok 2 - Identify semiprimes from 10000 to 10100 ok 3 - is_semiprime(752159046363135949) ok 4 - is_semiprime(9881022443630858407) ok 5 - is_semiprime(1814186289136250293214268090047441301) ok 6 - is_semiprime(42535430147496493121551759) ok t/26-issquarefree.t .......... 1..56 ok 1 - is_square_free(16) ok 2 - is_square_free(-16) ok 3 - is_square_free(3) ok 4 - is_square_free(-3) ok 5 - is_square_free(758096738) ok 6 - is_square_free(-758096738) ok 7 - is_square_free(15) ok 8 - is_square_free(-15) ok 9 - is_square_free(506916483) ok 10 - is_square_free(-506916483) ok 11 - is_square_free(602721315) ok 12 - is_square_free(-602721315) ok 13 - is_square_free(9) ok 14 - is_square_free(-9) ok 15 - is_square_free(723570005) ok 16 - is_square_free(-723570005) ok 17 - is_square_free(10) ok 18 - is_square_free(-10) ok 19 - is_square_free(7) ok 20 - is_square_free(-7) ok 21 - is_square_free(434420340) ok 22 - is_square_free(-434420340) ok 23 - is_square_free(2) ok 24 - is_square_free(-2) ok 25 - is_square_free(870589313) ok 26 - is_square_free(-870589313) ok 27 - is_square_free(12) ok 28 - is_square_free(-12) ok 29 - is_square_free(695486396) ok 30 - is_square_free(-695486396) ok 31 - is_square_free(14) ok 32 - is_square_free(-14) ok 33 - is_square_free(1) ok 34 - is_square_free(-1) ok 35 - is_square_free(752518565) ok 36 - is_square_free(-752518565) ok 37 - is_square_free(418431087) ok 38 - is_square_free(-418431087) ok 39 - is_square_free(13) ok 40 - is_square_free(-13) ok 41 - is_square_free(11) ok 42 - is_square_free(-11) ok 43 - is_square_free(0) ok 44 - is_square_free(-0) ok 45 - is_square_free(6) ok 46 - is_square_free(-6) ok 47 - is_square_free(617459403) ok 48 - is_square_free(-617459403) ok 49 - is_square_free(5) ok 50 - is_square_free(-5) ok 51 - is_square_free(8) ok 52 - is_square_free(-8) ok 53 - is_square_free(4) ok 54 - is_square_free(-4) ok 55 - 1716716933610412497881337454598508842322 is square free ok 56 - 638277566021123181834824715385258732627350 is not square free ok t/26-istotient.t ............. 1..9 ok 1 - is_totient 0 .. 40 ok 2 - is_fundamental(2^29_1 .. 2^29+80) ok 3 - is_totient(2^63+28) ok 4 - is_totient(2^63+20) ok 5 - is_totient(2^63+34) ok 6 - is_totient(2^83+88) ok 7 # skip Skipping is_totient for 2^83 + ... ok 8 # skip Skipping is_totient for 2^83 + ... ok 9 - is_totient(2**48) ok t/26-lucky.t ................. 1..35 ok 1 - lucky_numbers(200) ok 2 - lucky numbers for each n from 0 to 200 ok 3 - correct count for lucky_numbers(12345) ok 4 - Lucky numbers under 350k: 27420 ok 5 - Lucky numbers under 350k: correct sum ok 6 - all lucky numbers ranges 0 .. 40 ok 7 - range sieve: lucky_numbers(51221,51289) ok 8 - is_lucky for 0 to 200 ok 9 - 42975 is a lucky number ok 10 - 513 is not a lucky number ok 11 - 49023 is not a lucky number ok 12 - 120001 is a lucky number ok 13 - 1000047 is not a lucky number ok 14 - 1000047 is a lucky number ok 15 - lucky_count(0..997) ok 16 - lucky_count ranges 0 .. 40 ok 17 - lucky count bounds for 513 ok 18 - lucky count bounds for 5964377 ok 19 - lucky count bounds for small numbers ok 20 - lucky count bounds for small samples ok 21 - lucky count bounds for 2^43-rd lucky number ok 22 - nth_lucky(0) returns undef ok 23 - lucky numbers under 1000 with nth_lucky ok 24 - 42975 is the 2^12th lucky number ok 25 - nth_lucky_lower(0) returns undef ok 26 - nth_lucky_upper(0) returns undef ok 27 - nth_lucky_approx(0) returns undef ok 28 - nth_lucky(86) bounds ok 29 - nth_lucky(123456) bounds ok 30 - nth_lucky(5286238) bounds ok 31 - nth_lucky(46697909) bounds ok 32 - nth_lucky(2^31) bounds ok 33 - nth_lucky(2^43) bounds ok 34 - nth_lucky(1..100) bounds ok 35 - nth_lucky bounds for small samples ok t/26-mex.t ................... 1..17 ok 1 - vecmex() = 0 ok 2 - vecmex(0) = 1 ok 3 - vecmex(1) = 0 ok 4 - vecmex(1,2,4) = 0 ok 5 - vecmex(0,1,2,4) = 3 ok 6 - vecmex(0,1,24,4) = 2 ok 7 - vecmex(4,2,1,0) = 3 ok 8 - vecmex(3,10^20,0,2) = 1 ok 9 - vecpmex() = 1 ok 10 - vecpmex(1) = 2 ok 11 - vecpmex(2) = 1 ok 12 - vecpmex(2,3,5) = 1 ok 13 - vecpmex(1,2,3,5) = 4 ok 14 - vecpmex(1,2,24,5) = 3 ok 15 - vecpmex(5,3,2,1) = 4 ok 16 - vecpmex(4,10^20,1,3) = 2 ok 17 - sigmaxmex(1..10) ok t/26-modops.t ................ 1..70 ok 1 - negmod(0,0) = undef ok 2 - negmod(1,0) = undef ok 3 - negmod(0,1) = 0 ok 4 - negmod(100,1) = 0 ok 5 - negmod(100, 123) = 23 ok 6 - negmod(100,-123) = 23 ok 7 - negmod(-100, 123) = 100 ok 8 - negmod(10000, 123) = 86 ok 9 - negmod(10000,-123) = 86 ok 10 - negmod(-10000, 123) = 37 ok 11 - invmod(undef,11) ok 12 - invmod(11,undef) ok 13 - invmod('nan',11) ok 14 - invmod(0,0) = ok 15 - invmod(1,0) = ok 16 - invmod(0,1) = 0 ok 17 - invmod(0,2) = ok 18 - invmod(1,1) = 0 ok 19 - invmod(45,59) = 21 ok 20 - invmod(42,2017) = 1969 ok 21 - invmod(42,-2017) = 1969 ok 22 - invmod(-42,2017) = 48 ok 23 - invmod(-42,-2017) = 48 ok 24 - invmod(14,28474) = ok 25 - invmod(13,9223372036854775808) = 5675921253449092805 ok 26 - invmod(14,18446744073709551615) = 17129119497016012214 ok 27 - invmod(0,1) = 0 ok 28 - invmod(0,-1) = 0 ok 29 - addmod(..,0) ok 30 - submod(..,0) ok 31 - mulmod(..,0) ok 32 - divmod(..,0) ok 33 - powmod(..,0) ok 34 - addmod(..,1) ok 35 - submod(..,1) ok 36 - mulmod(..,1) ok 37 - divmod(..,1) ok 38 - powmod(..,1) ok 39 - addmod on 30 random inputs ok 40 - submod on 30 random inputs ok 41 - addmod with negative second input on 30 random inputs ok 42 - mulmod on 30 random inputs ok 43 - mulmod with negative second input on 30 random inputs ok 44 - divmod(0,14,53) = mulmod(0,invmod(14,53),53) = mulmod(0,19,53) = 0 ok 45 - divmod on 30 random inputs ok 46 - divmod with negative second input on 30 random inputs ok 47 - powmod on 30 random inputs ok 48 - powmod with negative exponent on 30 random inputs ok 49 - addmod with large negative arg ok 50 - submod with large negative arg ok 51 - mulmod with large negative arg ok 52 - divmod with large negative arg ok 53 - powmod with large negative arg ok 54 - powmod with large negative arg ok 55 - muladdmod on 30 random inputs ok 56 - mulsubmod on 30 random inputs ok 57 - muladdmod with medium size inputs ok 58 - mulsubmod with medium size inputs ok 59 - muladdmod with 128-bit inputs mod a 126-bit prime ok 60 - mulsubmod with 128-bit inputs mod a 126-bit prime # Subtest: big raw negative mod ok 1 ok 2 ok 3 1..3 ok 61 - big raw negative mod ok 62 - addmod(a, negmod(a,m), m) == 0 ok 63 - mulmod(a, invmod(a,m), m) == 1 ok 64 - invmod returns undef when no inverse exists ok 65 - mulmod(divmod(a,b,m), b, m) == a mod m ok 66 - divmod returns undef when gcd(b,m) > 1 ok 67 - addmod and mulmod are commutative ok 68 - powmod: Fermat's little theorem a^(p-1) == 1 mod p ok 69 - modular operations with modulus 2 (parity) ok 70 - negative modulus: results match positive |m| ok t/26-perfectpowers.t ......... 1..29 ok 1 - is_perfect_power(0 .. 10) ok 2 - is_perfect_power(-100 .. 100) ok 3 - is_perfect_power(18446744065119617025) ok 4 - is_perfect_power(18446744073709551616) ok 5 - next perfect power with small inputs ok 6 - prev perfect power with small inputs ok 7 - next perfect power with small inputs around zero ok 8 - prev perfect power with small inputs around zero ok 9 - next_perfect_power on perfect powers -100 to 100 ok 10 - prev_perfect_power on perfect powers -100 to 100 ok 11 - prev_perfect_power on numbers crossing 32-bit/64-bit boundaries ok 12 - next_perfect_power on numbers crossing 32-bit/64-bit boundaries ok 13 - perfect_power_count(0) = 0 ok 14 - perfect_power_count(1) = 1 ok 15 - perfect_power_count(n) for 1..41 ok 16 - perfect_power_count(10^n) for 0..10 ok 17 - perfect_power_count(12345678) = 3762 ok 18 - perfect_power_count(123456,133332) = 17 ok 19 - perfect_power_count(8..10,16) = 3,2,1 ok 20 - nth perfect_powers creates A001597 ok 21 - nth perfect powers with results around 2^32 ok 22 - nth perfect powers with results around 2^64 ok 23 - small perfect power limits ok 24 - perfect power limits for 1571 ok 25 - perfect power limits for 59643 ok 26 - perfect power limits for 15964377 ok 27 - perfect power approx for 1571 ok 28 - perfect power approx for 59643 ok 29 - perfect power approx for 15964377 ok t/26-pillai.t ................ 1..2 ok 1 - 1059511 is a Pillai prime ok 2 - is_pillai from -10 to 1000 ok t/26-pisano.t ................ 1..9 ok 1 - pisano_period(0..180) ok 2 - pisano_period(28657) = 92 ok 3 - pisano_period(64079) = 46 ok 4 - pisano_period(3590807) = 3264380 ok 5 - pisano_period(3628800) = 86400 ok 6 - pisano_period(2980232238769531250) = 17881393432617187500 ok 7 - pisano_period(14901161193847656250) = 89406967163085937500 ok 8 - pisano_period(74505805969238281250) = 447034835815429687500 ok 9 - pisano_period(30!) ok t/26-polygonal.t ............. 1..53 ok 1 - is_polygonal finds first 10 3-gonal numbers ok 2 - is_polygonal finds first 10 4-gonal numbers ok 3 - is_polygonal finds first 10 5-gonal numbers ok 4 - is_polygonal finds first 10 6-gonal numbers ok 5 - is_polygonal finds first 10 7-gonal numbers ok 6 - is_polygonal finds first 10 8-gonal numbers ok 7 - is_polygonal finds first 10 9-gonal numbers ok 8 - is_polygonal finds first 10 10-gonal numbers ok 9 - is_polygonal finds first 10 11-gonal numbers ok 10 - is_polygonal finds first 10 12-gonal numbers ok 11 - is_polygonal finds first 10 13-gonal numbers ok 12 - is_polygonal finds first 10 14-gonal numbers ok 13 - is_polygonal finds first 10 15-gonal numbers ok 14 - is_polygonal finds first 10 16-gonal numbers ok 15 - is_polygonal finds first 10 17-gonal numbers ok 16 - is_polygonal finds first 10 18-gonal numbers ok 17 - is_polygonal finds first 10 19-gonal numbers ok 18 - is_polygonal finds first 10 20-gonal numbers ok 19 - is_polygonal finds first 10 21-gonal numbers ok 20 - is_polygonal finds first 10 22-gonal numbers ok 21 - is_polygonal finds first 10 23-gonal numbers ok 22 - is_polygonal finds first 10 24-gonal numbers ok 23 - is_polygonal finds first 10 25-gonal numbers ok 24 - is_polygonal correct 3-gonal n ok 25 - is_polygonal correct 4-gonal n ok 26 - is_polygonal correct 5-gonal n ok 27 - is_polygonal correct 6-gonal n ok 28 - is_polygonal correct 7-gonal n ok 29 - is_polygonal correct 8-gonal n ok 30 - is_polygonal correct 9-gonal n ok 31 - is_polygonal correct 10-gonal n ok 32 - is_polygonal correct 11-gonal n ok 33 - is_polygonal correct 12-gonal n ok 34 - is_polygonal correct 13-gonal n ok 35 - is_polygonal correct 14-gonal n ok 36 - is_polygonal correct 15-gonal n ok 37 - is_polygonal correct 16-gonal n ok 38 - is_polygonal correct 17-gonal n ok 39 - is_polygonal correct 18-gonal n ok 40 - is_polygonal correct 19-gonal n ok 41 - is_polygonal correct 20-gonal n ok 42 - is_polygonal correct 21-gonal n ok 43 - is_polygonal correct 22-gonal n ok 44 - is_polygonal correct 23-gonal n ok 45 - is_polygonal correct 24-gonal n ok 46 - is_polygonal correct 25-gonal n ok 47 - 724424175519274711242 is not a triangular number ok 48 - 510622052816898545467859772308206986101878 is a triangular number ok 49 - 0 is a polygonal number ok 50 - is_polygonal with 0 sets r to 0 ok 51 - 1 is a polygonal number ok 52 - is_polygonal with 1 sets r to 1 ok 53 - -1 is not a polygonal number ok t/26-powerfree.t ............. 1..68 ok 1 - is_powerfree(n) matches is_square_free(n) ok 2 - is_powerfree(n) works for simple inputs ok 3 - is_powerfree(n,3) works for simple inputs ok 4 - powerfree_count(0..100, 0) ok 5 - powerfree_sum(0..100, 0) ok 6 - powerfree_count(0..100, 1) ok 7 - powerfree_sum(0..100, 1) ok 8 - powerfree_count(0..100, 2) ok 9 - powerfree_sum(0..100, 2) ok 10 - powerfree_count(0..100, 3) ok 11 - powerfree_sum(0..100, 3) ok 12 - powerfree_count(0..100, 4) ok 13 - powerfree_sum(0..100, 4) ok 14 - powerfree_count(0..100, 5) ok 15 - powerfree_sum(0..100, 5) ok 16 - powerfree_count(0..100, 6) ok 17 - powerfree_sum(0..100, 6) ok 18 - powerfree_count(0..100, 7) ok 19 - powerfree_sum(0..100, 7) ok 20 - powerfree_count(0..100, 8) ok 21 - powerfree_sum(0..100, 8) ok 22 - powerfree_count(0..100, 9) ok 23 - powerfree_sum(0..100, 9) ok 24 - powerfree_count(0..100, 10) ok 25 - powerfree_sum(0..100, 10) ok 26 - powerfree_count(12345,2) = 7503 ok 27 - powerfree_count(12345,3) = 10272 ok 28 - powerfree_count(12345,4) = 11408 ok 29 - powerfree_sum(12345,2) = 46286859 ok 30 - powerfree_sum(12345,3) = 63404053 ok 31 - powerfree_sum(12345,4) = 70415676 ok 32 - powerfree_count(123456,32) = 123456 ok 33 - powerfree_sum(123456,32) = 7620753696 ok 34 - nth_powerfree(7503) = 12345 ok 35 - nth_powerfree(10272,3) = 12345 ok 36 - nth_powerfree(11408,4) = 12345 ok 37 - nth_powerfree(915099,3) = 1099999 ok 38 - nth_powerfree(10^6,2) = 1644918 ok 39 - nth_powerfree(10^6,3) = 1202057 ok 40 - nth_powerfree(10^8,5) = 103692775 ok 41 - powerfree_part(0..30) ok 42 - powerfree_part(-4000) = -10 ok 43 - powerfree_part(n,0) = 0 ok 44 - powerfree_part(n,1) = 0 ok 45 - powerfree_part(n,2) = 1333310 ok 46 - powerfree_part(n,3) ok 47 - powerfree_part(n,4) ok 48 - powerfree_part(n,5) ok 49 - powerfree_part(n,6) ok 50 - powerfree_part(n,7) ok 51 - powerfree_part_sum(0..64, 0) ok 52 - powerfree_part_sum(54321,0) = 1 ok 53 - powerfree_part_sum(0..64, 1) ok 54 - powerfree_part_sum(54321,1) = 1 ok 55 - powerfree_part_sum(0..64, 2) ok 56 - powerfree_part_sum(54321,2) = 971014567 ok 57 - powerfree_part_sum(0..64, 3) ok 58 - powerfree_part_sum(54321,3) = 1248722293 ok 59 - powerfree_part_sum(0..64, 4) ok 60 - powerfree_part_sum(54321,4) = 1368821452 ok 61 - powerfree_part_sum(0..64, 5) ok 62 - powerfree_part_sum(54321,5) = 1424239488 ok 63 - powerfree_part_sum(0..64, 6) ok 64 - powerfree_part_sum(54321,6) = 1450660380 ok 65 - powerfree_part_sum(0..64, 7) ok 66 - powerfree_part_sum(54321,7) = 1463313419 ok 67 - powerfree_part ok 68 - squarefree_kernel ok t/26-powerful.t .............. 1..5 # Subtest: is_powerful ok 1 - is_powerful(0..258,2) ok 2 - is_powerful(0..258) ok 3 - is_powerful(-8,n) = 0 ok 4 - is_powerful(0,n) = 0 ok 5 - is_powerful(n,0) = 1 for positive n ok 6 - is_powerful(n,1) = 1 for positive n ok 7 - is_powerful(n,3) for 0..32 and 11 larger nums ok 8 - is_powerful(n,4) for 0..32 and 11 larger nums ok 9 - is_powerful(n,5) for 0..32 and 11 larger nums ok 10 - is_powerful(n,6) for 0..32 and 11 larger nums ok 11 - is_powerful(n,7) for 0..32 and 11 larger nums ok 12 - is_powerful(n,8) for 0..32 and 11 larger nums ok 13 - is_powerful(n,9) for 0..32 and 11 larger nums ok 14 - is_powerful(n,10) for 0..32 and 11 larger nums ok 15 - is_powerful(n,11) for 0..32 and 11 larger nums ok 16 - is_powerful(n,12) for 0..32 and 11 larger nums ok 17 - small is_powerful(n,2), n powerful ok 18 - small is_powerful(n,3), n powerful ok 19 - small is_powerful(n,2), n not powerful ok 20 - small is_powerful(n,3), n not powerful ok 21 - large easy non-powerful number ok 22 - large easy powerful number ok 23 - 256-bit semiprime is not 30-powerful, without factoring 1..23 ok 1 - is_powerful # Subtest: powerful_count ok 1 - powerful_count(-n)=0 ok 2 - powerful_count(n,0)=n ok 3 - powerful_count(n,1)=n ok 4 - powerful_count(+/- n, 0) ok 5 - powerful_count(+/- n, 1) ok 6 - powerful_count(+/- n, 2) ok 7 - powerful_count(0..20) ok 8 - powerful_count(0..20,3) ok 9 - powerful_count(x,1..15) = 14 ok 10 - powerful_count(x-1,1..15) = 13 1..10 ok 2 - powerful_count # Subtest: nth_powerful ok 1 - nth_powerful(0) returns undef ok 2 - 3136 is the 100th powerful number ok 3 - 43046721 is the 100th 6-powerful number ok 4 - 16777216 is the 12th 15-powerful number 1..4 ok 3 - nth_powerful # Subtest: sumpowerful ok 1 - sumpowerful(-n)=0 ok 2 - sumpowerful(n) for 0 <= n <= 48 ok 3 - sumpowerful(n,3) for 0 <= n <= 48 ok 4 - sumpowerful(17411,k) for 0 <= k <= 16 ok 5 - sumpowerful(1234567890123456,1) = (n*(n+1))/2 ok 6 # skip Skipping sumpowerful(1234567890,2) ok 7 # skip Skipping sumpowerful(1234567890123456,2) ok 8 - sumpowerful(2147516495,k) for 1 <= k <= 33 ok 9 - sumpowerful(1234567890123456,k) for 3 <= k <= 32 1..9 ok 4 - sumpowerful # Subtest: powerful_numbers ok 1 - powerful_numbers(40,180,3) ok 2 - powerful_numbers(9,20,0) = 9..20 ok 3 - powerful_numbers(9,20,1) = 9..20 ok 4 - powerful_numbers(120) ok 5 - powerful_numbers(9,120) ok 6 - powerful_numbers(9,200,2) ok 7 - powerful_numbers(0,200,3) ok 8 - powerful_numbers(1,200,4) ok 9 - powerful_numbers(1,1000,5) ok 10 - powerful_numbers(1e12,1e12+1e10,5) 1..10 ok 5 - powerful_numbers ok t/26-powersum.t .............. 1..11 ok 1 - powersum(0,n) = 0 ok 2 - powersum(1,n) = 1 ok 3 - powersum(n,0) = 1 for n>0 ok 4 - powersum(10,0..5) ok 5 - powersum(16,0..15) ok 6 - powersum(1711,0..9) # Subtest: Tests used by Math::AnyNum ok 1 - powersum(97,20) ok 2 - powersum(1234,13) ok 3 - powersum(30,80) ok 4 - powersum(36893488147419103232,6) 1..4 ok 7 - Tests used by Math::AnyNum # Subtest: Window around 32-bit analytic boundaries ok 1 - powersum(1624,2) = 1429018500 ok 2 - powersum(67,4) = 280200834 ok 3 - powersum(44,5) = 1293405300 ok 4 - powersum(19,6) = 152455810 ok 5 - powersum(17,7) = 1091194929 ok 6 - powersum(9,8) = 67731333 1..6 ok 8 - Window around 32-bit analytic boundaries # Subtest: Window around 64-bit analytic boundaries ok 1 - powersum(2642245,2) = 6148911552167379095 ok 2 - powersum(5724,4) = 1229469567040762830 ok 3 - powersum(1824,5) = 6147687633902880000 ok 4 - powersum(482,6) = 869720925148346545 ok 5 - powersum(288,7) = 5998799932115786496 ok 6 - powersum(115,8) = 406347583132055642 1..6 ok 9 - Window around 64-bit analytic boundaries ok 10 - powersum({115,116,117},4) correct [test 32-bit overflow] ok 11 - powersum({9838,9839,9840},4) correct [test 64-bit overflow] ok t/26-practical.t ............. 1..3 ok 1 - is_practical(0 .. 252) ok 2 - is_practical(429606) = 1 ok 3 - is_practical(n) = 0 for almost practical numbers ok t/26-randperm.t .............. 1..6 # Subtest: randperm ok 1 - randperm(0) returns 0 elements ok 2 - randperm(1) returns 1 element ok 3 - randperm(4,0) returns 0 elements ok 4 - randperm(4,1) returns 1 element ok 5 - randperm(4,8) returns 4 elements ok 6 - randperm(100,4) returns 4 elements ok 7 - randperm(128) shuffles ok 8 - randperm(128) gives expected indices ok 9 - randperm(2,2) can return all permutations ok 10 - randperm(3,2) can return all permutations ok 11 - randperm(16) can return multiple permutations ok 12 - randperm(4,8) can return multiple permutations ok 13 - randperm(42,1) can return multiple permutations ok 14 - randperm(1024,2) can return multiple permutations ok 15 - randperm(75,6) can return multiple permutations ok 16 - randperm(30,12) can return multiple permutations ok 17 - randperm(54321,10) can return multiple permutations ok 18 - randperm(123456789,37) can return multiple permutations 1..18 ok 1 - randperm # Subtest: shuffle ok 1 - shuffle() = () ok 2 - shuffle(x) = (x) ok 3 - shuffle n items returns n items ok 4 - shuffled 128-element array isn't identical ok 5 - outputs are the same elements as input ok 6 - shuffle(a,b,c) selected each permutation at least once (10 tries) 1..6 ok 2 - shuffle # Subtest: vecsample ok 1 - vecsample(k) = () ok 2 - vecsample(k,()) = () ok 3 - vecsample(k,[]) = () ok 4 - vecsample(1,(n)) = (n) ok 5 - vecsample(1,(n)) = (n) ok 6 - returns k items with a large list ok 7 - returns all items with large k ok 8 - returns all items with exact k ok 9 - returns all items ok 10 - vecsample(1,L) returns something from L ok 11 - vecsample(2,a,b,c,d) selected each value at least once (3 tries) ok 12 - Input list is not modified ok 13 - Input aref is not modified 1..13 ok 3 - vecsample # Subtest: using csrand ok 1 - shuffles are repeatable with csrand 1..1 ok 4 - using csrand ok 5 - vecsample unselected items destroyed ok 6 - vecsample all items destroyed ok t/26-rationaltrees.t ......... 1..4 # Subtest: Calkin-Wilf tree ok 1 - next_calkin_wilf first 100 terms ok 2 - calkin_wilf_n first 100 terms ok 3 - nth_calkin_wilf first 100 terms ok 4 - calkin_wilf_n(4,11) = 36 ok 5 - nth_calkin_wilf(36) = (4,11) ok 6 - calkin_wilf_n(22,7) = 519 ok 7 - nth_calkin_wilf(519) = (22,7) ok 8 - calkin_wilf_n(37,53) = 1990 ok 9 - nth_calkin_wilf(1990) = (37,53) ok 10 - calkin_wilf_n(144,233) = 2730 ok 11 - nth_calkin_wilf(2730) = (144,233) ok 12 - calkin_wilf_n(83116,51639) = 123456789 ok 13 - nth_calkin_wilf(123456789) = (83116,51639) ok 14 - calkin_wilf_n(64,65) = 36893488147419103230 ok 15 - nth_calkin_wilf(36893488147419103230) = (64,65) ok 16 - calkin_wilf_n(66,65) = 36893488147419103233 ok 17 - nth_calkin_wilf(36893488147419103233) = (66,65) ok 18 - calkin_wilf_n(32,1) = 4294967295 ok 19 - nth_calkin_wilf(4294967295) = (32,1) ok 20 - calkin_wilf_n(64,1) = 18446744073709551615 ok 21 - nth_calkin_wilf(18446744073709551615) = (64,1) ok 22 - calkin_wilf_n(228909276746,645603216423) = 1054982144710410407556 ok 23 - nth_calkin_wilf(1054982144710410407556) = (228909276746,645603216423) 1..23 ok 1 - Calkin-Wilf tree # Subtest: Stern-Brocot tree ok 1 - next_stern_brocot first 100 terms ok 2 - stern_brocot_n first 100 terms ok 3 - nth_stern_brocot first 100 terms ok 4 - stern_brocot_n(4,11) = 36 ok 5 - nth_stern_brocot(36) = (4,11) ok 6 - stern_brocot_n(22,7) = 960 ok 7 - nth_stern_brocot(960) = (22,7) ok 8 - stern_brocot_n(37,53) = 1423 ok 9 - nth_stern_brocot(1423) = (37,53) ok 10 - stern_brocot_n(144,233) = 2730 ok 11 - nth_stern_brocot(2730) = (144,233) ok 12 - stern_brocot_n(83116,51639) = 111333227 ok 13 - nth_stern_brocot(111333227) = (83116,51639) ok 14 - stern_brocot_n(64,65) = 27670116110564327423 ok 15 - nth_stern_brocot(27670116110564327423) = (64,65) ok 16 - stern_brocot_n(66,65) = 55340232221128654848 ok 17 - nth_stern_brocot(55340232221128654848) = (66,65) ok 18 - stern_brocot_n(32,1) = 4294967295 ok 19 - nth_stern_brocot(4294967295) = (32,1) ok 20 - stern_brocot_n(64,1) = 18446744073709551615 ok 21 - nth_stern_brocot(18446744073709551615) = (64,1) ok 22 - stern_brocot_n(228909276746,645603216423) = 667408827216638861715 ok 23 - nth_stern_brocot(667408827216638861715) = (228909276746,645603216423) 1..23 ok 2 - Stern-Brocot tree # Subtest: Stern diatomic (fusc) ok 1 - A002487 first terms ok 2 - fusc(4691) = 257 ok 3 - fusc(87339) = 2312 ok 4 - fusc(1222997) = 13529 ok 5 - fusc(9786539) = 57317 ok 6 - fusc(76895573) = 238605 ok 7 - fusc(357214891) = 744095 ok 8 - fusc(1431655083) = 1948354 ok 9 - fusc(5726623019) = 5102687 ok 10 - fusc(22906492075) = 13354827 ok 11 - fusc(91625925291) = 34961522 ok 12 - fusc(0) = 0 ok 13 - fusc(1) = 1 ok 14 - fusc(2*1) = fusc(1) ok 15 - fusc(2*1+1) = fusc(1)+fusc(1+1) ok 16 - fusc(2*2) = fusc(2) ok 17 - fusc(2*2+1) = fusc(2)+fusc(2+1) ok 18 - fusc(2*3) = fusc(3) ok 19 - fusc(2*3+1) = fusc(3)+fusc(3+1) ok 20 - fusc(2*4) = fusc(4) ok 21 - fusc(2*4+1) = fusc(4)+fusc(4+1) ok 22 - fusc(2*5) = fusc(5) ok 23 - fusc(2*5+1) = fusc(5)+fusc(5+1) ok 24 - fusc(2*6) = fusc(6) ok 25 - fusc(2*6+1) = fusc(6)+fusc(6+1) ok 26 - fusc(2*7) = fusc(7) ok 27 - fusc(2*7+1) = fusc(7)+fusc(7+1) ok 28 - fusc(2*8) = fusc(8) ok 29 - fusc(2*8+1) = fusc(8)+fusc(8+1) ok 30 - fusc(2*9) = fusc(9) ok 31 - fusc(2*9+1) = fusc(9)+fusc(9+1) ok 32 - fusc(2*10) = fusc(10) ok 33 - fusc(2*10+1) = fusc(10)+fusc(10+1) ok 34 - fusc(2*11) = fusc(11) ok 35 - fusc(2*11+1) = fusc(11)+fusc(11+1) ok 36 - fusc(2*12) = fusc(12) ok 37 - fusc(2*12+1) = fusc(12)+fusc(12+1) ok 38 - fusc(2*13) = fusc(13) ok 39 - fusc(2*13+1) = fusc(13)+fusc(13+1) ok 40 - fusc(2*14) = fusc(14) ok 41 - fusc(2*14+1) = fusc(14)+fusc(14+1) ok 42 - fusc(2*15) = fusc(15) ok 43 - fusc(2*15+1) = fusc(15)+fusc(15+1) ok 44 - fusc(2*16) = fusc(16) ok 45 - fusc(2*16+1) = fusc(16)+fusc(16+1) ok 46 - fusc(2*17) = fusc(17) ok 47 - fusc(2*17+1) = fusc(17)+fusc(17+1) ok 48 - fusc(2*18) = fusc(18) ok 49 - fusc(2*18+1) = fusc(18)+fusc(18+1) ok 50 - fusc(2*19) = fusc(19) ok 51 - fusc(2*19+1) = fusc(19)+fusc(19+1) ok 52 - fusc(2*20) = fusc(20) ok 53 - fusc(2*20+1) = fusc(20)+fusc(20+1) ok 54 - fusc(2*21) = fusc(21) ok 55 - fusc(2*21+1) = fusc(21)+fusc(21+1) ok 56 - fusc(2*22) = fusc(22) ok 57 - fusc(2*22+1) = fusc(22)+fusc(22+1) ok 58 - fusc(2*23) = fusc(23) ok 59 - fusc(2*23+1) = fusc(23)+fusc(23+1) ok 60 - fusc(2*24) = fusc(24) ok 61 - fusc(2*24+1) = fusc(24)+fusc(24+1) ok 62 - fusc(2*25) = fusc(25) ok 63 - fusc(2*25+1) = fusc(25)+fusc(25+1) ok 64 - fusc(2*26) = fusc(26) ok 65 - fusc(2*26+1) = fusc(26)+fusc(26+1) ok 66 - fusc(2*27) = fusc(27) ok 67 - fusc(2*27+1) = fusc(27)+fusc(27+1) ok 68 - fusc(2*28) = fusc(28) ok 69 - fusc(2*28+1) = fusc(28)+fusc(28+1) ok 70 - fusc(2*29) = fusc(29) ok 71 - fusc(2*29+1) = fusc(29)+fusc(29+1) ok 72 - fusc(2*30) = fusc(30) ok 73 - fusc(2*30+1) = fusc(30)+fusc(30+1) ok 74 - fusc(2*31) = fusc(31) ok 75 - fusc(2*31+1) = fusc(31)+fusc(31+1) ok 76 - fusc(2*32) = fusc(32) ok 77 - fusc(2*32+1) = fusc(32)+fusc(32+1) ok 78 - fusc(2*33) = fusc(33) ok 79 - fusc(2*33+1) = fusc(33)+fusc(33+1) ok 80 - fusc(2*34) = fusc(34) ok 81 - fusc(2*34+1) = fusc(34)+fusc(34+1) ok 82 - fusc(2*35) = fusc(35) ok 83 - fusc(2*35+1) = fusc(35)+fusc(35+1) ok 84 - fusc(2*36) = fusc(36) ok 85 - fusc(2*36+1) = fusc(36)+fusc(36+1) ok 86 - fusc(2*37) = fusc(37) ok 87 - fusc(2*37+1) = fusc(37)+fusc(37+1) ok 88 - fusc(2*38) = fusc(38) ok 89 - fusc(2*38+1) = fusc(38)+fusc(38+1) ok 90 - fusc(2*39) = fusc(39) ok 91 - fusc(2*39+1) = fusc(39)+fusc(39+1) ok 92 - fusc(2*40) = fusc(40) ok 93 - fusc(2*40+1) = fusc(40)+fusc(40+1) ok 94 - fusc(2*41) = fusc(41) ok 95 - fusc(2*41+1) = fusc(41)+fusc(41+1) ok 96 - fusc(2*42) = fusc(42) ok 97 - fusc(2*42+1) = fusc(42)+fusc(42+1) ok 98 - fusc(2*43) = fusc(43) ok 99 - fusc(2*43+1) = fusc(43)+fusc(43+1) ok 100 - fusc(2*44) = fusc(44) ok 101 - fusc(2*44+1) = fusc(44)+fusc(44+1) ok 102 - fusc(2*45) = fusc(45) ok 103 - fusc(2*45+1) = fusc(45)+fusc(45+1) 1..103 ok 3 - Stern diatomic (fusc) # Subtest: Farey sequences ok 1 - scalar farey(1) = 2 ok 2 - farey(1) ok 3 - farey(1,k) for k=0.. ok 4 - next_farey(1,...) iteration ok 5 - farey_rank(1,...) ok 6 - scalar farey(2) = 3 ok 7 - farey(2) ok 8 - farey(2,k) for k=0.. ok 9 - next_farey(2,...) iteration ok 10 - farey_rank(2,...) ok 11 - scalar farey(3) = 5 ok 12 - farey(3) ok 13 - farey(3,k) for k=0.. ok 14 - next_farey(3,...) iteration ok 15 - farey_rank(3,...) ok 16 - scalar farey(4) = 7 ok 17 - farey(4) ok 18 - farey(4,k) for k=0.. ok 19 - next_farey(4,...) iteration ok 20 - farey_rank(4,...) ok 21 - scalar farey(5) = 11 ok 22 - farey(5) ok 23 - farey(5,k) for k=0.. ok 24 - next_farey(5,...) iteration ok 25 - farey_rank(5,...) ok 26 - scalar farey(6) = 13 ok 27 - farey(6) ok 28 - farey(6,k) for k=0.. ok 29 - next_farey(6,...) iteration ok 30 - farey_rank(6,...) ok 31 - scalar farey(7) = 19 ok 32 - farey(7) ok 33 - farey(7,k) for k=0.. ok 34 - next_farey(7,...) iteration ok 35 - farey_rank(7,...) ok 36 - scalar farey(8) = 23 ok 37 - farey(8) ok 38 - farey(8,k) for k=0.. ok 39 - next_farey(8,...) iteration ok 40 - farey_rank(8,...) ok 41 - scalar farey(9) = 29 ok 42 - farey(9) ok 43 - farey(9,k) for k=0.. ok 44 - next_farey(9,...) iteration ok 45 - farey_rank(9,...) ok 46 - farey(24,16) = 2/21 ok 47 - farey_rank(24,[2/21]) = 16 ok 48 - farey(507,427) = 3/505 ok 49 - farey_rank(507,[3/505]) = 427 ok 50 - farey(1) ok 51 - farey_rank(5,[0,1]) = 0 ok 52 - farey_rank(5,[1,1]) = last ok 53 - next_farey(5,[1,1]) = undef 1..53 ok 4 - Farey sequences ok t/26-rootmod.t ............... 1..182 ok 1 - sqrtmod(0,0) = ok 2 - allsqrtmod(0,0) = () ok 3 - sqrtmod(1,0) = ok 4 - allsqrtmod(1,0) = () ok 5 - sqrtmod(0,1) = 0 ok 6 - allsqrtmod(0,1) = (0) ok 7 - sqrtmod(1,1) = 0 ok 8 - allsqrtmod(1,1) = (0) ok 9 - sqrtmod(-1,17) = 4 ok 10 - allsqrtmod(-1,17) = (4 13) ok 11 - sqrtmod(58,101) = 19 ok 12 - allsqrtmod(58,101) = (19 82) ok 13 - sqrtmod(111,113) = 26 ok 14 - allsqrtmod(111,113) = (26 87) ok 15 - sqrtmod(160,461) = ok 16 - allsqrtmod(160,461) = () ok 17 - sqrtmod(37,999221) = 9946 ok 18 - allsqrtmod(37,999221) = (9946 989275) ok 19 - sqrtmod(30,1000969) = 89676 ok 20 - allsqrtmod(30,1000969) = (89676 911293) ok 21 - sqrtmod(2,72388801) = 20312446 ok 22 - allsqrtmod(2,72388801) = (20312446 52076355) ok 23 - sqrtmod(9223372036854775808,5675921253449092823) = 22172359690642254 ok 24 - allsqrtmod(9223372036854775808,5675921253449092823) = (22172359690642254 5653748893758450569) ok 25 - sqrtmod(18446744073709551625,1093717762081589963407) = 419016687038042104847 ok 26 - allsqrtmod(18446744073709551625,1093717762081589963407) = (419016687038042104847 674701075043547858560) ok 27 - sqrtmod(30,74) = 20, roots [20 54] ok 28 - allsqrtmod(30,74) = (20 54) ok 29 - sqrtmod(56,1018) = 458, roots [458 560] ok 30 - allsqrtmod(56,1018) = (458 560) ok 31 - sqrtmod(42,979986) = 356034, roots [356034 623952] ok 32 - allsqrtmod(42,979986) = (356034 623952) ok 33 - sqrtmod(5,301) = ok 34 - allsqrtmod(5,301) = () ok 35 - sqrtmod(5,302) = 55, roots [55 247] ok 36 - allsqrtmod(5,302) = (55 247) ok 37 - sqrtmod(5,404) = 45, roots [45 157 247 359] ok 38 - allsqrtmod(5,404) = (45 157 247 359) ok 39 - sqrtmod(5,400) = ok 40 - allsqrtmod(5,400) = () ok 41 - sqrtmod(9,400) = 3, roots [3 53 147 197 203 253 347 397] ok 42 - allsqrtmod(9,400) = (3 53 147 197 203 253 347 397) ok 43 - sqrtmod(15,402) = 45, roots [45 357] ok 44 - allsqrtmod(15,402) = (45 357) ok 45 - sqrtmod(1242,1849) = 851, roots [851 998] ok 46 - allsqrtmod(1242,1849) = (851 998) ok 47 - sqrtmod(0,4) = 0, roots [0 2] ok 48 - allsqrtmod(0,4) = (0 2) ok 49 - sqrtmod(1,4) = 1, roots [1 3] ok 50 - allsqrtmod(1,4) = (1 3) ok 51 - sqrtmod(4,8) = 2, roots [2 6] ok 52 - allsqrtmod(4,8) = (2 6) ok 53 - sqrtmod(4,16) = 2, roots [2 6 10 14] ok 54 - allsqrtmod(4,16) = (2 6 10 14) ok 55 - sqrtmod(0,9) = 0, roots [0 3 6] ok 56 - allsqrtmod(0,9) = (0 3 6) ok 57 - sqrtmod(3,9) = ok 58 - allsqrtmod(3,9) = () ok 59 - sqrtmod(0,27) = 0, roots [0 9 18] ok 60 - allsqrtmod(0,27) = (0 9 18) ok 61 - sqrtmod(9,27) = 3, roots [3 6 12 15 21 24] ok 62 - allsqrtmod(9,27) = (3 6 12 15 21 24) ok 63 - sqrtmod(0,36) = 0, roots [0 6 12 18 24 30] ok 64 - allsqrtmod(0,36) = (0 6 12 18 24 30) ok 65 - sqrtmod(4,36) = 2, roots [2 16 20 34] ok 66 - allsqrtmod(4,36) = (2 16 20 34) ok 67 - sqrtmod(13556,26076) = ok 68 - allsqrtmod(13556,26076) = () ok 69 - sqrtmod(15347,38565) = ok 70 - allsqrtmod(15347,38565) = () ok 71 - sqrtmod(588,2912) = ok 72 - allsqrtmod(588,2912) = () ok 73 - sqrtmod(24684,69944) = 17126, roots [2138 17126 17846 32834 37110 52098 52818 67806] ok 74 - allsqrtmod(24684,69944) = (2138 17126 17846 32834 37110 52098 52818 67806) ok 75 - rootmod(a,k,0) should be undef ok 76 - rootmod(a,k,1) should be 0 ok 77 - rootmod(a,0,17) should be 1 or undef ok 78 - rootmod(a,1,17) should be a mod 17 ok 79 - rootmod(a,2,17) should be sqrtmod(a,17) ok 80 - rootmod(14,-3,101) = 17 ok 81 - allrootmod(14,-3,101) = (17) ok 82 - rootmod(13,6,107) = 83, roots [24 83] ok 83 - allrootmod(13,6,107) = (24 83) ok 84 - rootmod(13,-6,107) = 49, roots [49 58] ok 85 - allrootmod(13,-6,107) = (49 58) ok 86 - rootmod(64,6,101) = 2, roots [2 99] ok 87 - allrootmod(64,6,101) = (2 99) ok 88 - rootmod(9,-2,101) = 34, roots [34 67] ok 89 - allrootmod(9,-2,101) = (34 67) ok 90 - rootmod(2,3,3) = 2 ok 91 - allrootmod(2,3,3) = (2) ok 92 - rootmod(2,3,7) = ok 93 - allrootmod(2,3,7) = () ok 94 - rootmod(17,29,19) = 6 ok 95 - allrootmod(17,29,19) = (6) ok 96 - rootmod(5,3,13) = 8, roots [7 8 11] ok 97 - allrootmod(5,3,13) = (7 8 11) ok 98 - rootmod(53,3,151) = 27, roots [15 27 109] ok 99 - allrootmod(53,3,151) = (15 27 109) ok 100 - rootmod(3,3,73) = 25, roots [25 54 67] ok 101 - allrootmod(3,3,73) = (25 54 67) ok 102 - rootmod(7,3,73) = 31, roots [13 29 31] ok 103 - allrootmod(7,3,73) = (13 29 31) ok 104 - rootmod(49,3,73) = 23, roots [12 23 38] ok 105 - allrootmod(49,3,73) = (12 23 38) ok 106 - rootmod(44082,4,100003) = 2003, roots [2003 98000] ok 107 - allrootmod(44082,4,100003) = (2003 98000) ok 108 - rootmod(90594,6,100019) = 62948, roots [37071 62948] ok 109 - allrootmod(90594,6,100019) = (37071 62948) ok 110 - rootmod(6,5,31) = 26, roots [11 13 21 22 26] ok 111 - allrootmod(6,5,31) = (11 13 21 22 26) ok 112 - rootmod(0,2,2) = 0 ok 113 - allrootmod(0,2,2) = (0) ok 114 - rootmod(2,4,5) = ok 115 - allrootmod(2,4,5) = () ok 116 - rootmod(51,12,10009) = 9945, roots [64 1203 3183 3247 3999 4807 5202 6010 6762 6826 8806 9945] ok 117 - allrootmod(51,12,10009) = (64 1203 3183 3247 3999 4807 5202 6010 6762 6826 8806 9945) ok 118 - rootmod(15,3,1000000000000000000117) = 565745383315014620936, roots [72574612502199260377 361680004182786118804 565745383315014620936] ok 119 - allrootmod(15,3,1000000000000000000117) = (72574612502199260377 361680004182786118804 565745383315014620936) ok 120 - rootmod(1,0,13) = 1, roots [0 1 2 3 4 5 6 7 8 9 10 11 12] ok 121 - allrootmod(1,0,13) = (0 1 2 3 4 5 6 7 8 9 10 11 12) ok 122 - rootmod(2,0,13) = ok 123 - allrootmod(2,0,13) = () ok 124 - rootmod(0,5,0) = ok 125 - allrootmod(0,5,0) = () ok 126 - rootmod(0,-1,3) = ok 127 - allrootmod(0,-1,3) = () ok 128 - rootmod(4,2,10) = 2, roots [2 8] ok 129 - allrootmod(4,2,10) = (2 8) ok 130 - rootmod(4,2,18) = 2, roots [2 16] ok 131 - allrootmod(4,2,18) = (2 16) ok 132 - rootmod(2,3,21) = ok 133 - allrootmod(2,3,21) = () ok 134 - rootmod(8,3,27) = 2, roots [2 11 20] ok 135 - allrootmod(8,3,27) = (2 11 20) ok 136 - rootmod(22,3,1505) = 813, roots [148 578 673 793 813 1103 1243 1318 1458] ok 137 - allrootmod(22,3,1505) = (148 578 673 793 813 1103 1243 1318 1458) ok 138 - rootmod(58787,3,100035) = 26183, roots [3773 8633 10793 13763 19163 24293 26183 26588 31313 37118 41978 44138 47108 52508 57638 59528 59933 64658 70463 75323 77483 80453 85853 90983 92873 93278 98003] ok 139 - allrootmod(58787,3,100035) = (3773 8633 10793 13763 19163 24293 26183 26588 31313 37118 41978 44138 47108 52508 57638 59528 59933 64658 70463 75323 77483 80453 85853 90983 92873 93278 98003) ok 140 - rootmod(3748,2,4992) = 2182, roots [154 262 314 518 730 934 986 1094 1402 1510 1562 1766 1978 2182 2234 2342 2650 2758 2810 3014 3226 3430 3482 3590 3898 4006 4058 4262 4474 4678 4730 4838] ok 141 - allrootmod(3748,2,4992) = (154 262 314 518 730 934 986 1094 1402 1510 1562 1766 1978 2182 2234 2342 2650 2758 2810 3014 3226 3430 3482 3590 3898 4006 4058 4262 4474 4678 4730 4838) ok 142 - rootmod(68,2,2048) = 46, roots [46 466 558 978 1070 1490 1582 2002] ok 143 - allrootmod(68,2,2048) = (46 466 558 978 1070 1490 1582 2002) ok 144 - rootmod(96,5,128) = 6, roots [6 14 22 30 38 46 54 62 70 78 86 94 102 110 118 126] ok 145 - allrootmod(96,5,128) = (6 14 22 30 38 46 54 62 70 78 86 94 102 110 118 126) ok 146 - rootmod(2912,5,4992) = 2054, roots [182 494 806 1118 1430 1742 2054 2366 2678 2990 3302 3614 3926 4238 4550 4862] ok 147 - allrootmod(2912,5,4992) = (182 494 806 1118 1430 1742 2054 2366 2678 2990 3302 3614 3926 4238 4550 4862) ok 148 - rootmod(2,3,4) = ok 149 - allrootmod(2,3,4) = () ok 150 - rootmod(3,2,4) = ok 151 - allrootmod(3,2,4) = () ok 152 - rootmod(3,4,19) = ok 153 - allrootmod(3,4,19) = () ok 154 - rootmod(1,4,20) = 1, roots [1 3 7 9 11 13 17 19] ok 155 - allrootmod(1,4,20) = (1 3 7 9 11 13 17 19) ok 156 - rootmod(9,2,24) = 3, roots [3 9 15 21] ok 157 - allrootmod(9,2,24) = (3 9 15 21) ok 158 - rootmod(6,6,35) = ok 159 - allrootmod(6,6,35) = () ok 160 - rootmod(36,2,40) = 6, roots [6 14 26 34] ok 161 - allrootmod(36,2,40) = (6 14 26 34) ok 162 - rootmod(16,12,48) = 16, roots [2 4 8 10 14 16 20 22 26 28 32 34 38 40 44 46] ok 163 - allrootmod(16,12,48) = (2 4 8 10 14 16 20 22 26 28 32 34 38 40 44 46) ok 164 - rootmod(13,6,112) = ok 165 - allrootmod(13,6,112) = () ok 166 - rootmod(52,6,117) = ok 167 - allrootmod(52,6,117) = () ok 168 - rootmod(48,3,128) = ok 169 - allrootmod(48,3,128) = () ok 170 - rootmod(382,3,1000) = ok 171 - allrootmod(382,3,1000) = () ok 172 - rootmod(10,3,81) = 13, roots [13 40 67] ok 173 - allrootmod(10,3,81) = (13 40 67) ok 174 - rootmod(26,5,625) = 81, roots [81 206 331 456 581] ok 175 - allrootmod(26,5,625) = (81 206 331 456 581) ok 176 - rootmod(51,5,625) = 61, roots [61 186 311 436 561] ok 177 - allrootmod(51,5,625) = (61 186 311 436 561) ok 178 - rootmod(9833625071,3,10000000071) = 9999999521, roots [3333332807 6666666164 9999999521] ok 179 - allrootmod(9833625071,3,10000000071) = (3333332807 6666666164 9999999521) ok 180 - rootmod(198,-1,519) = ok 181 - allrootmod(198,-1,519) = () ok 182 - 41st root of 12 mod 1147 is correct ok t/26-setbinop.t .............. 1..9 ok 1 - setbinop with an empty set ok 2 - setbinop A+A ok 3 - setbinop A+B ok 4 - setbinop A-B ok 5 - setbinop B-A ok 6 - setbinop A+2B ok 7 - setbinop A+A mod 4 ok 8 - setbinop A^B ok 9 - [124]{2} has 3^2 elements, A-A has 7^2 elements ok t/26-setops.t ................ 1..22 ok 1 - setunion signed properly sorted ok 2 - setdelta with unsorted and dups works # Subtest: toset ok 1 - toset: empty list ok 2 - toset: one value ok 3 - toset: simple ok 4 - toset: 32-bit mix of sign and unsigned ok 5 - toset: 64-bit mix of sign and unsigned ok 6 - toset: 63-bit values should be sorted correctly ok 7 - toset: 129-bit unsigned inputs 1..7 ok 3 - toset # Subtest: union ok 1 - simple unsigned ok 2 - simple unsigned ok 3 - empty first list ok 4 - empty second list ok 5 - empty lists ok 6 - signed overlap ok 7 - range bigger than IV or UV ok 8 - sign overlap ok 9 - vec simple unsigned unsorted with dups ok 10 - vec too big for IV ok 11 - vec range bigger than IV or UV ok 12 - vec bigints ok 13 - vec mix 64-bit and 65-bit as strings 1..13 ok 4 - union # Subtest: intersect ok 1 - simple unsigned ok 2 - simple unsigned ok 3 - empty first list ok 4 - empty second list ok 5 - empty lists ok 6 - signed overlap ok 7 - range bigger than IV or UV ok 8 - sign overlap ok 9 - vec simple unsigned unsorted with dups ok 10 - vec too big for IV ok 11 - vec range bigger than IV or UV ok 12 - vec bigints ok 13 - vec mix 64-bit and 65-bit as strings 1..13 ok 5 - intersect # Subtest: minus (difference) ok 1 - simple unsigned ok 2 - simple unsigned ok 3 - empty first list ok 4 - empty second list ok 5 - empty lists ok 6 - signed overlap ok 7 - range bigger than IV or UV ok 8 - sign overlap ok 9 - vec simple unsigned unsorted with dups ok 10 - vec too big for IV ok 11 - vec range bigger than IV or UV ok 12 - vec bigints ok 13 - vec mix 64-bit and 65-bit as strings 1..13 ok 6 - minus (difference) # Subtest: delta (symmetric difference) ok 1 - simple unsigned ok 2 - simple unsigned ok 3 - empty first list ok 4 - empty second list ok 5 - empty lists ok 6 - signed overlap ok 7 - range bigger than IV or UV ok 8 - sign overlap ok 9 - vec simple unsigned unsorted with dups ok 10 - vec too big for IV ok 11 - vec range bigger than IV or UV ok 12 - vec bigints ok 13 - vec mix 64-bit and 65-bit as strings 1..13 ok 7 - delta (symmetric difference) # Subtest: is_sidon_set ok 1 - Sidon sets ok 2 - non-Sidon sets 1..2 ok 8 - is_sidon_set # Subtest: is_sumfree_set ok 1 - sumfree sets ok 2 - non-sumfree sets 1..2 ok 9 - is_sumfree_set # Subtest: setcontains ok 1 - empty set contains empty set ok 2 - regular set contains empty set ok 3 - empty set does not contain regular set ok 4 - setcontains basic true ok 5 - setcontains basic false ok 6 - setcontains with bigger subset ok 7 - setcontains with smaller subset ok 8 - setcontains with smaller subset ok 9 - setcontains with small bottom overlap ok 10 - setcontains with small top overlap ok 11 - setcontains both signs subset true ok 12 - setcontains both signs subset false ok 13 - setcontains neg true ok 14 - setcontains neg false ok 15 - setcontains ivneg 1 ok 16 - setcontains ivneg 2 ok 17 - setcontains ivneg 3 ok 18 - setcontains ivneg 4 ok 19 - setcontains ivneg 5 ok 20 - setcontains ivneg 6 ok 21 - setcontains ivneg 1 ok 22 - setcontains ivneg 2 ok 23 - setcontains ivneg 3 ok 24 - setcontains ivneg 4 ok 25 - setcontains ivneg 5 ok 26 - setcontains ivneg 6 ok 27 - setcontains uvneg 1 ok 28 - setcontains uvneg 2 ok 29 - setcontains uvneg 3 ok 30 - setcontains uvneg 4 ok 31 - setcontains uvneg 5 ok 32 - setcontains uvneg 6 ok 33 - setcontains uvneg 7 ok 34 - setcontains bigint false ok 35 - setcontains bigint false ok 36 - setcontains bigint true ok 37 - setcontains bigint empty set ok 38 - setcontains bigint false ok 39 - setcontains bigint false ok 40 - setcontains bigint true ok 41 - setcontains with list ok 42 - odds < 600 does not contain an even set ok 43 - odds < 600 contains an odd set 1..43 ok 10 - setcontains # Subtest: setcontainsany ok 1 - empty set has no elements of empty set ok 2 - regular set has no elements of empty set ok 3 - empty set has no elements of other set ok 4 - setcontainsany scalar true ok 5 - setcontainsany scalar false ok 6 - setcontainsany basic true ok 7 - setcontainsany basic false ok 8 - setcontainsany neg true ok 9 - setcontainsany neg false 1..9 ok 11 - setcontainsany # Subtest: setinsert ok 1 - insert a set: insert nothing into nothing ok 2 - insert a set: insert nothing ok 3 - insert a set: single element list middle ok 4 - insert a set: two element list ok 5 - insert a set: list on all sides ok 6 - insert a set: list on front ok 7 - insert a set: list on back ok 8 - insert a set: inserts into middle ok 9 - insert a set: inserts into front, middle, back ok 10 - insert a set: negative set, add small pos ok 11 - insert a set: negative set, add big pos ok 12 - insert a set: insert overlapping edges ok 13 - insert a list: insert nothing into nothing ok 14 - insert a list: insert nothing ok 15 - insert a list: insert at start ok 16 - insert a list: insert at end ok 17 - insert a list: insert in middle ok 18 - insert a list: insert in middle ok 19 - insert a list: duplicate ok 20 - insert a list: duplicate ok 21 - insert a list: negative entries ok ok 22 - insert a list: negative entries ok ok 23 - insert a list: insert negative 64-bit int ok 24 - insert a list: insert positive 64-bit int ok 25 - insert a list: list with duplicates ok 26 - insert many integers at once 1..26 ok 12 - setinsert # Subtest: set_is_subset ok 1 - Basic subset tests ok 2 - Every list is a subset of itself ok 3 - Test some subsets ok 4 - Test some non-subsets 1..4 ok 13 - set_is_subset # Subtest: set_is_equal ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset 1..10 ok 14 - set_is_equal # Subtest: set_is_disjoint ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset 1..10 ok 15 - set_is_disjoint # Subtest: set_is_subset ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset 1..10 ok 16 - set_is_subset # Subtest: set_is_superset ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset 1..10 ok 17 - set_is_superset # Subtest: set_is_proper_subset ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset 1..10 ok 18 - set_is_proper_subset # Subtest: set_is_proper_superset ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset 1..10 ok 19 - set_is_proper_superset # Subtest: set_is_proper_intersection ok 1 - empty sets ok 2 - set and empty set ok 3 - empty set and set ok 4 - proper subset ok 5 - equal set ok 6 - overlapping set ok 7 - disjoint set ok 8 - big neg int ok 9 - big pos int ok 10 - big pos int subset ok 11 - [1,2] and [1,3] 1..11 ok 20 - set_is_proper_intersection # Subtest: setremove ok 1 - empty sets ok 2 - remove empty set ok 3 - remove middle element ok 4 - remove non element ok 5 - remove first element ok 6 - remove all elements ok 7 - remove mix ok 8 - remove single aref to empty ok 9 - empty sets ok 10 - remove all elements ok 11 - list with duplicates ok 12 - remove single scalar to empty 1..12 ok 21 - setremove # Subtest: setinvert ok 1 - two empty sets ok 2 - invert with an empty set ok 3 - invert with a small set ok 4 - invert with duplicate set ok 5 - mixed set inversions ok 6 - empty set and empty list ok 7 - invert with an empty list ok 8 - invert with single middle element ok 9 - invert with single non element ok 10 - invert with a list of all elements ok 11 - list with duplicates ok 12 - mixed list inversions 1..12 ok 22 - setinvert ok t/26-smooth.t ................ 1..25 ok 1 - is_smooth(n,k) for small inputs ok 2 - is_smooth(-n,k) for small inputs ok 3 - is_rough(n,k) for small inputs ok 4 - is_rough(-n,k) for small inputs ok 5 - 1000000 is 10000-smooth ok 6 - 1000127 is not 10000-smooth ok 7 - 1000127 is not 3000-rough ok 8 - 1000157 is not 3000-rough ok 9 - 137438953481 is 3000-rough ok 10 - 137438953493 is not 3000-rough ok 11 - 137438953529 is 3000-rough ok 12 - large 97-smooth number ok 13 - large 97-smooth number ok 14 - large 97-smooth number ok 15 - large 97-smooth number ok 16 - large 4073-smooth, 2081-rough number ok 17 - large 4073-smooth, 2081-rough number ok 18 - large 4073-smooth, 2081-rough number ok 19 - large 4073-smooth, 2081-rough number ok 20 - smooth_count(0..5, 0..5) ok 21 - smooth_count(100,17) ok 22 - smooth_count(1980627498,9) ok 23 - smooth_count(10000000,400) ok 24 - rough_count(0..5, 0..5) ok 25 - rough_count(3700621409,15) ok t/26-stirling.t .............. 1..4 # Subtest: input validations ok 1 - Expected fail: stirling type 4 1..1 ok 1 - input validations # Subtest: stirling numbers of the first kind ok 1 - Stirling 1: s(0,0..1) ok 2 - Stirling 1: s(1,0..2) ok 3 - Stirling 1: s(2,0..3) ok 4 - Stirling 1: s(3,0..4) ok 5 - Stirling 1: s(4,0..5) ok 6 - Stirling 1: s(5,0..6) ok 7 - Stirling 1: s(6,0..7) ok 8 - Stirling 1: s(7,0..8) ok 9 - Stirling 1: s(8,0..9) ok 10 - Stirling 1: s(9,0..10) ok 11 - Stirling 1: s(10,0..11) ok 12 - Stirling 1: s(11,0..12) ok 13 - Stirling 1: s(12,0..13) ok 14 # skip stirling(132,67) only with EXTENDED_TESTING 1..14 ok 2 - stirling numbers of the first kind # Subtest: stirling numbers of the second kind ok 1 - Stirling 2: S(0,0..1) ok 2 - Stirling 2: S(1,0..2) ok 3 - Stirling 2: S(2,0..3) ok 4 - Stirling 2: S(3,0..4) ok 5 - Stirling 2: S(4,0..5) ok 6 - Stirling 2: S(5,0..6) ok 7 - Stirling 2: S(6,0..7) ok 8 - Stirling 2: S(7,0..8) ok 9 - Stirling 2: S(8,0..9) ok 10 - Stirling 2: S(9,0..10) ok 11 - Stirling 2: S(10,0..11) ok 12 - Stirling 2: S(11,0..12) ok 13 - Stirling 2: S(12,0..13) ok 14 # skip large stirling tests only with EXTENDED_TESTING 1..14 ok 3 - stirling numbers of the second kind # Subtest: stirling numbers of the third kind ok 1 - Stirling 3: L(0,0..1) ok 2 - Stirling 3: L(1,0..2) ok 3 - Stirling 3: L(2,0..3) ok 4 - Stirling 3: L(3,0..4) ok 5 - Stirling 3: L(4,0..5) ok 6 - Stirling 3: L(5,0..6) ok 7 - Stirling 3: L(6,0..7) ok 8 - Stirling 3: L(7,0..8) ok 9 - Stirling 3: L(8,0..9) ok 10 - Stirling 3: L(9,0..10) ok 11 - Stirling 3: L(10,0..11) ok 12 - Stirling 3: L(11,0..12) ok 13 - Stirling 3: L(12,0..13) ok 14 - Stirling 3: L(13,0..14) ok 15 - Stirling 3: L(14,0..15) ok 16 - Stirling 3: L(15,0..16) ok 17 - Stirling 3: L(16,0..17) ok 18 - Stirling 3: L(17,0..18) ok 19 - Stirling 3: L(18,0..19) ok 20 - Stirling 3: L(19,0..20) ok 21 - Stirling 3: L(20,0..21) 1..21 ok 4 - stirling numbers of the third kind ok t/26-sumset.t ................ 1..31 ok 1 - sumset of primes under 200 ok 2 - sumset([2,4,6,8],[3,5,7]) ok 3 - sumset([1,2,3]) ok 4 - sumset([1,2,3],[2,3,4]) ok 5 - sumset([1],[2]) ok 6 - sumset([1],[]) ok 7 - sumset([],[2]) ok 8 - sumset of evens 2-20 ok 9 - sumset of evens 2-20 makes only 19 entries ok 10 - sumset of 3x x=1..10 ok 11 - sumset of powers of 2 1..10 has 55 entries ok 12 - sumset of two sets ok 13 - [124]{2} has 3^2 elements, A+A has 6^2 elements ok 14 - sumset ANY ANY ok ok 15 - sumset ANY POS overflow ok 16 - sumset ANY POS ok ok 17 - sumset POS ANY overflow ok 18 - sumset POS ANY ok ok 19 - sumset POS POS overflow ok 20 - sumset NEG POS overflow ok 21 - sumset NEG POS with sumset ANY ok 22 - sumset NEG POS with sumset POS ok 23 - sumset NEG ANY overflow ok 24 - sumset NEG NEG overflow ok 25 - sumset NEG NEG ok ok 26 - sumset NEG NEG undeflow ok 27 - sumset NEG ANY with sumset ANY ok 28 - sumset NEG ANY with sumset NEG ok 29 - sumset NEG NEG with sumset NEG ok 30 - sumset NEG NEG with sumset NEG ok 31 - sumset with bigint element ok t/26-vec.t ................... 1..15 # Subtest: vecmin ok 1 - vecmin() = undef ok 2 - vecmin(1) = 1 ok 3 - vecmin(0) = 0 ok 4 - vecmin(-1) = -1 ok 5 - vecmin(1 2) = 1 ok 6 - vecmin(2 1) = 1 ok 7 - vecmin(2 1) = 1 ok 8 - vecmin(0 4 -5 6 -6 0) = -6 ok 9 - vecmin(0 4 -5 7 -6 0) = -6 ok 10 - vecmin(81033966278481626507 27944220269257565027) = 27944220269257565027 ok 11 - vecmin(18446744073704516093 18446744073706008451 18446744073706436837 18446744073707776433 18446744073702959347 18446744073702958477) = 18446744073702958477 ok 12 - vecmin(-9223372036852260673 -9223372036852260731 -9223372036850511139 -9223372036850207017 -9223372036852254557 -9223372036849473359) = -9223372036852260731 ok 13 - vecmin(9223372036852278343 -9223372036853497487 -9223372036844936897 -9223372036850971897 -9223372036853497843 9223372036848046999) = -9223372036853497843 1..13 ok 1 - vecmin # Subtest: vecmax ok 1 - vecmax() = undef ok 2 - vecmax(1) = 1 ok 3 - vecmax(0) = 0 ok 4 - vecmax(-1) = -1 ok 5 - vecmax(1 2) = 2 ok 6 - vecmax(2 1) = 2 ok 7 - vecmax(2 1) = 2 ok 8 - vecmax(0 4 -5 6 -6 0) = 6 ok 9 - vecmax(0 4 -5 7 -8 0) = 7 ok 10 - vecmax(27944220269257565027 81033966278481626507) = 81033966278481626507 ok 11 - vecmax(18446744070011576186 18446744070972009258 18446744071127815503 18446744072030630259 18446744072030628952 18446744071413452589) = 18446744072030630259 ok 12 - vecmax(18446744073702156661 18446744073707508539 18446744073700111529 18446744073707506771 18446744073707086091 18446744073704381821) = 18446744073707508539 ok 13 - vecmax(-9223372036853227739 -9223372036847631197 -9223372036851632173 -9223372036847631511 -9223372036852712261 -9223372036851707899) = -9223372036847631197 ok 14 - vecmax(-9223372036846673813 9223372036846154833 -9223372036851103423 9223372036846154461 -9223372036849190963 -9223372036847538803) = 9223372036846154833 1..14 ok 2 - vecmax # Subtest: vecsum ok 1 - vecsum() = 0 ok 2 - vecsum(-1) = -1 ok 3 - vecsum(1 -1) = 0 ok 4 - vecsum(-1 1) = 0 ok 5 - vecsum(-1 1) = 0 ok 6 - vecsum(-2147483648 2147483648) = 0 ok 7 - vecsum(-4294967296 4294967296) = 0 ok 8 - vecsum(-9223372036854775808 9223372036854775808) = 0 ok 9 - vecsum(18446744073709551615 -18446744073709551615 18446744073709551615) = 18446744073709551615 ok 10 - vecsum(18446744073709551616 18446744073709551616 18446744073709551616) = 55340232221128654848 ok 11 - vecsum(-9223372036854775807 -9223372036854775807 -1) = -18446744073709551615 ok 12 - vecsum(-9223372036854775807 -9223372036854775807 -2) = -18446744073709551616 ok 13 - vecsum(-9223372036854775807 -9223372036854775807 -3) = -18446744073709551617 ok 14 - vecsum(-9223372036854775808 -9223372036854775808) = -18446744073709551616 ok 15 - vecsum(-9223372036854775807 0) = -9223372036854775807 ok 16 - vecsum(-9223372036854775807 -1) = -9223372036854775808 ok 17 - vecsum(-9223372036854775807 -2) = -9223372036854775809 ok 18 - vecsum(0 -9223372036854775808 0) = -9223372036854775808 ok 19 - vecsum(18446744073709540400 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000) = 18446744073709620400 1..19 ok 3 - vecsum # Subtest: vecprod ok 1 - vecprod() = 1 ok 2 - vecprod(1) = 1 ok 3 - vecprod(-1) = -1 ok 4 - vecprod(-1 -2) = 2 ok 5 - vecprod(-1 -2) = 2 ok 6 - vecprod(32767 -65535) = -2147385345 ok 7 - vecprod(32767 -65535) = -2147385345 ok 8 - vecprod(32768 -65535) = -2147450880 ok 9 - vecprod(32768 -65536) = -2147483648 ok 10 - vecprod matches factorial for 0 .. 50 1..10 ok 4 - vecprod # Subtest: vecreduce ok 1 - vecreduce with empty list is undef ok 2 - vecreduce with (a) is a and does not call the sub ok 3 - vecreduce [xor] (4,2) => 6 ok 4 - vecreduce product of squares 1..4 ok 5 - vecreduce # Subtest: vecextract ok 1 - vecextract bits ok 2 - vecextract list 1..2 ok 6 - vecextract # Subtest: vecequal ok 1 - vecequal([],[]) = 1 ok 2 - vecequal([undef],[undef]) = 1 ok 3 - vecequal([0],[0]) = 1 ok 4 - vecequal([undef],[]) = 0 ok 5 - vecequal([undef],[0]) = 0 ok 6 - vecequal([0],[[]]) = 0 ok 7 - vecequal([],[[]]) = 0 ok 8 - vecequal([0],["a"]) = 0 ok 9 - vecequal([1,2,3],[1,2,3]) = 1 ok 10 - vecequal([1,2,3],[3,2,1]) = 0 ok 11 - vecequal([-1,2,3],[-1,2,3]) = 1 ok 12 - vecequal([undef,[1,2],"a"],[undef,[1,2],"a"] = 1 ok 13 - vecequal = 1 for vecsums ok 14 - vecequal = 0 for vecsums 1..14 ok 7 - vecequal # Subtest: vecany vecall vecnotall vecnone ok 1 - any true ok 2 - any false ok 3 - any empty list ok 4 - all true ok 5 - all false ok 6 - all empty list ok 7 - notall true ok 8 - notall false ok 9 - notall empty list ok 10 - none true ok 11 - none false ok 12 - none empty list 1..12 ok 8 - vecany vecall vecnotall vecnone # Subtest: vecfirst ok 1 - first success ok 2 - first failure ok 3 - first empty list ok 4 - first with reference args ok 5 - first returns in loop 1..5 ok 9 - vecfirst # Subtest: vecfirstidx ok 1 - first idx success ok 2 - first idx failure ok 3 - first idx empty list ok 4 - first idx with reference args ok 5 - first idx returns in loop 1..5 ok 10 - vecfirstidx # Subtest: vecuniq ok 1 - vecuniq simple 1..10 ok 2 - vecuniq scalar count correct ok 3 - vecuniq simple 5 to -5 ok 4 - vecuniq with empty input returns empty ok 5 - vecuniq with one input returns it ok 6 - vecuniq with 64-bit inputs ok 7 - vecuniq with signed 64-bit inputs 1..7 ok 11 - vecuniq # Subtest: vecsingleton ok 1 - vecsingleton simple ok 2 - vecsingleton scalar count correct ok 3 - vecsingleton with empty input returns empty ok 4 - vecsingleton with one input returns it ok 5 - vecsingleton with 64-bit inputs ok 6 - vecsingleton with signed 64-bit inputs ok 7 - vecsingleton with strings and one undef ok 8 - vecsingleton with strings and two undefs 1..8 ok 12 - vecsingleton # Subtest: vecfreq ok 1 - vecfreq on empty list ok 2 - vecfreq on empty list (scalar) ok 3 - vecfreq one integer ok 4 - vecfreq one integer (scalar) ok 5 - vecfreq two identical integers ok 6 - vecfreq two identical integers (scalar) ok 7 - vecfreq two integers ok 8 - vecfreq two integers (scalar) ok 9 - vecfreq many integers ok 10 - vecfreq many integers (scalar) ok 11 - vecfreq strings ok 12 - vecfreq strings (scalar) ok 13 - vecfreq mixed with undef ok 14 - vecfreq counts two undefs ok 15 - vecfreq doesn't confuse -1 and ~0 1..15 ok 13 - vecfreq # Subtest: vecsort ok 1 - vecsort list, ref, in-place [empty input] ok 2 - vecsort list, ref, in-place [single input] ok 3 - vecsort list, ref, in-place [two positive inputs] ok 4 - vecsort list, ref, in-place [-1 and maxuv] ok 5 - vecsort list, ref, in-place [two large negative inputs] ok 6 - vecsort list, ref, in-place [various 64-bit positive inputs] ok 7 - vecsort list, ref, in-place [large string inputs] ok 8 - vecsort list, ref, in-place [integers over 2^63 broken before 5.26.0] ok 9 - vecsort sorts without modifying input ok 10 - vecsort list of negative integers ok 11 - returning vecsort(@L) gives the number of items 1..11 ok 14 - vecsort # Subtest: vecslide ok 1 - vecslide with empty array returns empty ok 2 - vecslide with 1 element returns empty ok 3 - vecslide {$a+$b} 1..5 ok 4 - vecslide with array refs ok 5 - vecslide example from LMU 1..5 ok 15 - vecslide ok t/26-zeckendorf.t ............ 1..15 ok 1 - tozeckendorf for 0..20 ok 2 - tozeckendorf(24) ok 3 - tozeckendorf(27) ok 4 - tozeckendorf(568) ok 5 - tozeckendorf(4294967295) ok 6 - tozeckendorf(18446744073709551615) ok 7 - tozeckendorf(79228162514264337593543950335) ok 8 - fromzeckendorf(Z(0..20)) ok 9 - fromzeckendorf(1000100) ok 10 - fromzeckendorf(1001001) ok 11 - fromzeckendorf(1010010100000) ok 12 - fromzeckendorf(101000100001010100010100010000...) ok 13 - fromzeckendorf(101001010001000001010001000100...) ok 14 - fromzeckendorf(101010010101000101000100010010...) ok 15 - fromdigits(tozeckendorf(24),2) = 68 ok t/27-bernfrac.t .............. 1..3 # Subtest: bernfrac (Bernoulli numbers) ok 1 - bernfrac(1) = (1,2) ok 2 - bernfrac(3) = (0,1) ok 3 - bernfrac(2,4,6,...,40) ok 4 # skip bernfrac(60) only with EXTENDED_TESTING 1..4 ok 1 - bernfrac (Bernoulli numbers) # Subtest: harmfrac (Harmonic numbers) ok 1 - harmfrac(0) = (0,1) ok 2 - harmfrac(1..32) 1..2 ok 2 - harmfrac (Harmonic numbers) # Subtest: bernreal and harmreal ok 1 - bernreal(0..24) within tolerance ok 2 - harmreal(0..20) within tolerance ok 3 # skip bernreal(46) and harmreal(46) with EXTENDED_TESTING ok 4 # skip bernreal(46) and harmreal(46) with EXTENDED_TESTING 1..4 ok 3 - bernreal and harmreal ok t/28-pi.t .................... 1..15 ok 1 - Pi(0) gives floating point pi ok 2 - Pi(1) = 3 ok 3 - Pi(2 .. 50) ok 4 - Pi(760) ok 5 - Pi(761) ok 6 - Pi(762) ok 7 - Pi(763) ok 8 - Pi(764) ok 9 - Pi(765) ok 10 - Pi(766) ok 11 - Pi(767) ok 12 - Pi(768) ok 13 - Pi(769) ok 14 - Pi(770) ok 15 - XS _pidigits ok t/29-mersenne.t .............. 1..1 ok 1 - Find Mersenne primes from 0 to 127 ok t/30-relations.t ............. 1..75 ok 1 - Prime count and scalar primes agree for 1 ok 2 - scalar primes(0+1,1) = prime_count(1) - prime_count(0) ok 3 - Pi(pn)) = n for 1 ok 4 - p(Pi(n)+1) = next_prime(n) for 1 ok 5 - p(Pi(n)) = prev_prime(n) for 1 ok 6 - Prime count and scalar primes agree for 2 ok 7 - scalar primes(1+1,2) = prime_count(2) - prime_count(1) ok 8 - Pi(pn)) = n for 2 ok 9 - p(Pi(n)+1) = next_prime(n) for 2 ok 10 - p(Pi(n)) = prev_prime(n) for 2 ok 11 - Prime count and scalar primes agree for 3 ok 12 - scalar primes(2+1,3) = prime_count(3) - prime_count(2) ok 13 - Pi(pn)) = n for 3 ok 14 - p(Pi(n)+1) = next_prime(n) for 3 ok 15 - p(Pi(n)) = prev_prime(n) for 3 ok 16 - Prime count and scalar primes agree for 4 ok 17 - scalar primes(3+1,4) = prime_count(4) - prime_count(3) ok 18 - Pi(pn)) = n for 4 ok 19 - p(Pi(n)+1) = next_prime(n) for 4 ok 20 - p(Pi(n)) = prev_prime(n) for 4 ok 21 - Prime count and scalar primes agree for 5 ok 22 - scalar primes(4+1,5) = prime_count(5) - prime_count(4) ok 23 - Pi(pn)) = n for 5 ok 24 - p(Pi(n)+1) = next_prime(n) for 5 ok 25 - p(Pi(n)) = prev_prime(n) for 5 ok 26 - Prime count and scalar primes agree for 6 ok 27 - scalar primes(5+1,6) = prime_count(6) - prime_count(5) ok 28 - Pi(pn)) = n for 6 ok 29 - p(Pi(n)+1) = next_prime(n) for 6 ok 30 - p(Pi(n)) = prev_prime(n) for 6 ok 31 - Prime count and scalar primes agree for 7 ok 32 - scalar primes(6+1,7) = prime_count(7) - prime_count(6) ok 33 - Pi(pn)) = n for 7 ok 34 - p(Pi(n)+1) = next_prime(n) for 7 ok 35 - p(Pi(n)) = prev_prime(n) for 7 ok 36 - Prime count and scalar primes agree for 17 ok 37 - scalar primes(7+1,17) = prime_count(17) - prime_count(7) ok 38 - Pi(pn)) = n for 17 ok 39 - p(Pi(n)+1) = next_prime(n) for 17 ok 40 - p(Pi(n)) = prev_prime(n) for 17 ok 41 - Prime count and scalar primes agree for 57 ok 42 - scalar primes(17+1,57) = prime_count(57) - prime_count(17) ok 43 - Pi(pn)) = n for 57 ok 44 - p(Pi(n)+1) = next_prime(n) for 57 ok 45 - p(Pi(n)) = prev_prime(n) for 57 ok 46 - Prime count and scalar primes agree for 89 ok 47 - scalar primes(57+1,89) = prime_count(89) - prime_count(57) ok 48 - Pi(pn)) = n for 89 ok 49 - p(Pi(n)+1) = next_prime(n) for 89 ok 50 - p(Pi(n)) = prev_prime(n) for 89 ok 51 - Prime count and scalar primes agree for 102 ok 52 - scalar primes(89+1,102) = prime_count(102) - prime_count(89) ok 53 - Pi(pn)) = n for 102 ok 54 - p(Pi(n)+1) = next_prime(n) for 102 ok 55 - p(Pi(n)) = prev_prime(n) for 102 ok 56 - Prime count and scalar primes agree for 1337 ok 57 - scalar primes(102+1,1337) = prime_count(1337) - prime_count(102) ok 58 - Pi(pn)) = n for 1337 ok 59 - p(Pi(n)+1) = next_prime(n) for 1337 ok 60 - p(Pi(n)) = prev_prime(n) for 1337 ok 61 - Prime count and scalar primes agree for 8573 ok 62 - scalar primes(1337+1,8573) = prime_count(8573) - prime_count(1337) ok 63 - Pi(pn)) = n for 8573 ok 64 - p(Pi(n)+1) = next_prime(n) for 8573 ok 65 - p(Pi(n)) = prev_prime(n) for 8573 ok 66 - Prime count and scalar primes agree for 84763 ok 67 - scalar primes(8573+1,84763) = prime_count(84763) - prime_count(8573) ok 68 - Pi(pn)) = n for 84763 ok 69 - p(Pi(n)+1) = next_prime(n) for 84763 ok 70 - p(Pi(n)) = prev_prime(n) for 84763 ok 71 - Prime count and scalar primes agree for 784357 ok 72 - scalar primes(84763+1,784357) = prime_count(784357) - prime_count(84763) ok 73 - Pi(pn)) = n for 784357 ok 74 - p(Pi(n)+1) = next_prime(n) for 784357 ok 75 - p(Pi(n)) = prev_prime(n) for 784357 ok t/31-threading.t ............. skipped: only in release or extended testing t/32-iterators.t ............. 1..136 ok 1 - forprimes undef ok 2 - forprimes 2,undef ok 3 - forprimes 2,undef ok 4 - forprimes -2,3 ok 5 - forprimes 2,-3 ok 6 - forprimes abc ok 7 - forprimes 2, abc ok 8 - forprimes abc ok 9 - forprimes 0,0 ok 10 - forprimes 0,1 ok 11 - forprimes 1 ok 12 - forprimes 3 ok 13 - forprimes 3 ok 14 - forprimes 4 ok 15 - forprimes 5 ok 16 - forprimes 3,5 ok 17 - forprimes 3,6 ok 18 - forprimes 3,7 ok 19 - forprimes 5,7 ok 20 - forprimes 6,7 ok 21 - forprimes 5,11 ok 22 - forprimes 7,11 ok 23 - forprimes 50 ok 24 - forprimes 2,20 ok 25 - forprimes 20,30 ok 26 - forprimes 199,223 ok 27 - forprimes 31398,31468 (empty region) ok 28 - forprimes 2147483647,2147483659 ok 29 - forprimes 3842610774,3842611326 ok 30 - forcomposites 2147483647,2147483659 ok 31 - forcomposites 50 ok 32 - forcomposites 200,410 ok 33 - fordivisors: d|54321: a+=d+d^2 ok 34 - A027750 using fordivisors ok 35 - iterator -2 ok 36 - iterator abc ok 37 - iterator 4.5 ok 38 - iterator first 10 primes ok 39 - iterator 5 primes starting at 47 ok 40 - iterator 3 primes starting at 199 ok 41 - iterator 3 primes starting at 200 ok 42 - iterator 3 primes starting at 31397 ok 43 - iterator 3 primes starting at 31396 ok 44 - iterator 3 primes starting at 31398 ok 45 - forprimes handles $_ type changes ok 46 - triple nested forprimes ok 47 - triple nested iterator ok 48 - Nested call to large divisors inside forprimes ok 49 - forprimes with BigInt range ok 50 - forprimes with BigFloat range ok 51 - iterator 3 primes with BigInt start ok 52 - iterator -2 ok 53 - iterator abc ok 54 - iterator 4.5 ok 55 - iterator first 10 primes ok 56 - iterator 5 primes starting at 47 ok 57 - iterator 3 primes starting at 199 ok 58 - iterator 3 primes starting at 200 ok 59 - iterator 3 primes starting at 31397 ok 60 - iterator 3 primes starting at 31396 ok 61 - iterator 3 primes starting at 31398 ok 62 - iterator object moved forward 10 now returns 31 ok 63 - iterator object moved back now returns 29 ok 64 - iterator object peek shows 31 ok 65 - iterator object iterates to 29 ok 66 - iterator object iterates to 31 ok 67 - iterator object rewind and move returns 5 ok 68 - iterator object rewind(1) goes to 2 ok 69 - iterator object rewind(0) goes to 2 ok 70 - internal check, next_prime on big int works ok 71 - iterator object can rewind to 18446744073709551557 ok 72 - iterator object next is 18446744073709551629 ok 73 - iterator object rewound to ~0 is 18446744073709551629 ok 74 - iterator object prev goes back to 18446744073709551557 ok 75 - iterator object tell_i ok 76 - iterator object i_start = 1 ok 77 - iterator object description ok 78 - iterator object values_min = 2 ok 79 - iterator object values_max = undef ok 80 - iterator object oeis_anum = A000040 ok 81 - iterator object seek_to_i goes to nth prime ok 82 - iterator object seek_to_value goes to value ok 83 - iterator object ith returns nth prime ok 84 - iterator object pred returns true if is_prime ok 85 - iterator object value_to_i works ok 86 - iterator object value_to_i for non-prime returns undef ok 87 - iterator object value_to_i_floor ok 88 - iterator object value_to_i_ceil ok 89 - iterator object value_to_i_estimage is in range ok 90 - lastfor works in forprimes ok 91 - lastfor works in forcomposites ok 92 - lastfor works in foroddcomposites ok 93 - lastfor works in fordivisors ok 94 - lastfor works in forpart ok 95 - lastfor works in forcomp ok 96 - lastfor works in forcomb ok 97 - lastfor works in forperm ok 98 - lastfor works in forderange ok 99 - lastfor works in formultiperm ok 100 - nested lastfor semantics ok 101 - lastfor in forcomposites stops appropriately ok 102 - forfactored {} 0,0 ok 103 - forsquarefree {} 0,0 ok 104 - forsquarefreeint {} 0,0 ok 105 - forfactored {} 0,1 ok 106 - forsquarefree {} 0,1 ok 107 - forsquarefreeint {} 0,1 ok 108 - forfactored {} 1 ok 109 - forfactored {} 100 ok 110 - forsquarefree {} 100 ok 111 - forfactored {} 10^8,10^8+10 ok 112 - A053462 using forsquarefree ok 113 - forsquarefree {} 7193953,7195732 ok 114 - forsquarefreeint {} 7193953,7195732 ok 115 - forsemiprimes 1000 ok 116 - foralmostprimes 0,1000 is empty ok 117 - foralmostprimes 1,1000 ok 118 - foralmostprimes 2,1000 ok 119 - foralmostprimes 3,1000 ok 120 - foralmostprimes 4,1000 ok 121 - foralmostprimes 5,1000 ok 122 - foralmostprimes 6,1000 ok 123 - foralmostprimes 7,1000 ok 124 - foralmostprimes 8,1000 ok 125 - foralmostprimes 9,1000 ok 126 - foralmostprimes 10,1000 ok 127 - forsetproduct not array ref errors ok 128 - forsetproduct empty input -> empty output ok 129 - forsetproduct single list -> single list ok 130 - forsetproduct five 1-element lists -> single list ok 131 - forsetproduct any empty list -> empty output ok 132 - forsetproduct any empty list -> empty output ok 133 - forsetproduct simple test ok 134 - forsetproduct modify size of @_ in block ok 135 - forsetproduct replace @_ in sub # Subtest: for<...> with bigint ranges ok 1 - forprimes {} 2^66+166, 2^66+199 ok 2 - forsemiprimes {} 2^66+98, 2^66+99 ok 3 - foralmostprimes {} 3, 2^66+30, 2^66+32 ok 4 - forcomposites {} 2^66+1506, 2^66+1508 ok 5 - foroddcomposites {} 2^66+1506, 2^66+1511 ok 6 - forsquarefree {} 2^66+26, 2^66+29 ok 7 - forsquarefreeint {} 2^66+26, 2^66+29 ok 8 - forfactored {} 2^66+29, 2^66+30 ok 9 - fordivisors {} 2^66+18940 1..9 ok 136 - for<...> with bigint ranges ok t/33-examples.t .............. skipped: these tests are for release candidate testing # CORE::rand: drand48 (yech). Our PRNG: ChaCha20 t/34-random.t ................ 1..28 ok 1 - CSPRNG is being seeded properly ok 2 - irand values are 32-bit ok 3 - irand values are integers ok 4 - irand64 all bits on in 7 iterations ok 5 - irand64 all bits off in 7 iterations ok 6 - drand values between 0 and 1-eps ok 7 - drand supplies at least 21 bits (got 53) ok 8 - drand(10): all in range [0,10) ok 9 - drand(): all in range [0,1) ok 10 - drand(-10): all in range (-10,0] ok 11 - drand(0): all in range [0,1) ok 12 - drand(undef): all in range [0,1) ok 13 - random_bytes after srand ok 14 - random_bytes after manual seed ok 15 - irand after seed ok 16 - drand after seed 0.0459118340827543 ~ 0.0459118340827543 ok 17 - random_bytes(0) returns empty string ok 18 - urandomb(0) returns 0 ok 19 - urandomm(0) returns 0 ok 20 - urandomm(1) returns 0 ok 21 - urandomb returns native int within range for 1..64 ok 22 - urandomm returns native int within range for 1..50 ok 23 - urandomm(10) generated 10 distinct values ok 24 - urandomm(10) values between 0 and 9 (0 1 2 3 4 5 6 7 8 9) ok 25 - entropy_bytes gave us the right number of bytes ok 26 - entropy_bytes didn't return all zeros once ok 27 - entropy_bytes didn't return all zeros twice ok 28 - entropy_bytes returned two different binary strings ok t/35-cipher.t ................ 1..6 ok 1 - Ciphertext is probably ChaCha/20 expected result ok 2 - We at least vaguely changed the text ok 3 - Different key makes different ChaCha/20 result ok 4 - We can reproduce the cipher ok 5 - We can decode using the same key. ok 6 - Different nonce produces different data ok t/35-rand-tag.t .............. 1..6 ok 1 - srand returns result ok 2 - ChaCha20 irand ok 3 - ChaCha20 irand ok 4 - ChaCha20 drand ok 5 - Replicates after srand ok 6 - ChaCha20 irand64 ok t/50-factoring.t ............. 1..319 ok 1 - scalar factors(n) for 0 1 2 3 4 5 6 30107 115553 123456 456789 174636000 ok 2 - factors(n) for 0 1 2 3 4 5 6 30107 115553 123456 456789 174636000 ok 3 - scalar factor_exp(n) for 0 1 2 3 4 5 6 30107 115553 123456 456789 174636000 ok 4 - factor_exp(n) for 0 1 2 3 4 5 6 30107 115553 123456 456789 174636000 ok 5 - factor(7): 7 = 7, all sorted primes ok 6 - factor_exp(7) ok 7 - factor(8): 8 = 2 * 2 * 2, all sorted primes ok 8 - factor_exp(8) ok 9 - factor(16): 16 = 2 * 2 * 2 * 2, all sorted primes ok 10 - factor_exp(16) ok 11 - factor(57): 57 = 3 * 19, all sorted primes ok 12 - factor_exp(57) ok 13 - factor(64): 64 = 2 * 2 * 2 * 2 * 2 * 2, all sorted primes ok 14 - factor_exp(64) ok 15 - factor(377): 377 = 13 * 29, all sorted primes ok 16 - factor_exp(377) ok 17 - factor(9592): 9592 = 2 * 2 * 2 * 11 * 109, all sorted primes ok 18 - factor_exp(9592) ok 19 - factor(78498): 78498 = 2 * 3 * 3 * 7 * 7 * 89, all sorted primes ok 20 - factor_exp(78498) ok 21 - factor(664579): 664579 = 664579, all sorted primes ok 22 - factor_exp(664579) ok 23 - factor(5761455): 5761455 = 3 * 5 * 7 * 37 * 1483, all sorted primes ok 24 - factor_exp(5761455) ok 25 - factor(114256942): 114256942 = 2 * 57128471, all sorted primes ok 26 - factor_exp(114256942) ok 27 - factor(2214143): 2214143 = 1487 * 1489, all sorted primes ok 28 - factor_exp(2214143) ok 29 - factor(999999929): 999999929 = 999999929, all sorted primes ok 30 - factor_exp(999999929) ok 31 - factor(50847534): 50847534 = 2 * 3 * 3 * 3 * 19 * 49559, all sorted primes ok 32 - factor_exp(50847534) ok 33 - factor(455052511): 455052511 = 97 * 331 * 14173, all sorted primes ok 34 - factor_exp(455052511) ok 35 - factor(2147483647): 2147483647 = 2147483647, all sorted primes ok 36 - factor_exp(2147483647) ok 37 - factor(4118054813): 4118054813 = 19 * 216739727, all sorted primes ok 38 - factor_exp(4118054813) ok 39 - factor(30): 30 = 2 * 3 * 5, all sorted primes ok 40 - factor_exp(30) ok 41 - factor(210): 210 = 2 * 3 * 5 * 7, all sorted primes ok 42 - factor_exp(210) ok 43 - factor(2310): 2310 = 2 * 3 * 5 * 7 * 11, all sorted primes ok 44 - factor_exp(2310) ok 45 - factor(30030): 30030 = 2 * 3 * 5 * 7 * 11 * 13, all sorted primes ok 46 - factor_exp(30030) ok 47 - factor(510510): 510510 = 2 * 3 * 5 * 7 * 11 * 13 * 17, all sorted primes ok 48 - factor_exp(510510) ok 49 - factor(9699690): 9699690 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19, all sorted primes ok 50 - factor_exp(9699690) ok 51 - factor(223092870): 223092870 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23, all sorted primes ok 52 - factor_exp(223092870) ok 53 - factor(1363): 1363 = 29 * 47, all sorted primes ok 54 - factor_exp(1363) ok 55 - factor(989): 989 = 23 * 43, all sorted primes ok 56 - factor_exp(989) ok 57 - factor(779): 779 = 19 * 41, all sorted primes ok 58 - factor_exp(779) ok 59 - factor(629): 629 = 17 * 37, all sorted primes ok 60 - factor_exp(629) ok 61 - factor(403): 403 = 13 * 31, all sorted primes ok 62 - factor_exp(403) ok 63 - factor(547308031): 547308031 = 547308031, all sorted primes ok 64 - factor_exp(547308031) ok 65 - factor(808): 808 = 2 * 2 * 2 * 101, all sorted primes ok 66 - factor_exp(808) ok 67 - factor(2727): 2727 = 3 * 3 * 3 * 101, all sorted primes ok 68 - factor_exp(2727) ok 69 - factor(12625): 12625 = 5 * 5 * 5 * 101, all sorted primes ok 70 - factor_exp(12625) ok 71 - factor(34643): 34643 = 7 * 7 * 7 * 101, all sorted primes ok 72 - factor_exp(34643) ok 73 - factor(134431): 134431 = 11 * 11 * 11 * 101, all sorted primes ok 74 - factor_exp(134431) ok 75 - factor(221897): 221897 = 13 * 13 * 13 * 101, all sorted primes ok 76 - factor_exp(221897) ok 77 - factor(496213): 496213 = 17 * 17 * 17 * 101, all sorted primes ok 78 - factor_exp(496213) ok 79 - factor(692759): 692759 = 19 * 19 * 19 * 101, all sorted primes ok 80 - factor_exp(692759) ok 81 - factor(1228867): 1228867 = 23 * 23 * 23 * 101, all sorted primes ok 82 - factor_exp(1228867) ok 83 - factor(2231139): 2231139 = 3 * 251 * 2963, all sorted primes ok 84 - factor_exp(2231139) ok 85 - factor(2463289): 2463289 = 29 * 29 * 29 * 101, all sorted primes ok 86 - factor_exp(2463289) ok 87 - factor(3008891): 3008891 = 31 * 31 * 31 * 101, all sorted primes ok 88 - factor_exp(3008891) ok 89 - factor(5115953): 5115953 = 37 * 37 * 37 * 101, all sorted primes ok 90 - factor_exp(5115953) ok 91 - factor(6961021): 6961021 = 41 * 41 * 41 * 101, all sorted primes ok 92 - factor_exp(6961021) ok 93 - factor(8030207): 8030207 = 43 * 43 * 43 * 101, all sorted primes ok 94 - factor_exp(8030207) ok 95 - factor(10486123): 10486123 = 47 * 47 * 47 * 101, all sorted primes ok 96 - factor_exp(10486123) ok 97 - factor(10893343): 10893343 = 1327 * 8209, all sorted primes ok 98 - factor_exp(10893343) ok 99 - factor(12327779): 12327779 = 1627 * 7577, all sorted primes ok 100 - factor_exp(12327779) ok 101 - factor(701737021): 701737021 = 25997 * 26993, all sorted primes ok 102 - factor_exp(701737021) ok 103 - factor(549900): 549900 = 2 * 2 * 3 * 3 * 5 * 5 * 13 * 47, all sorted primes ok 104 - factor_exp(549900) ok 105 - factor(10000142): 10000142 = 2 * 1429 * 3499, all sorted primes ok 106 - factor_exp(10000142) ok 107 - factor(392498): 392498 = 2 * 443 * 443, all sorted primes ok 108 - factor_exp(392498) ok 109 - factor(37607912018): 37607912018 = 2 * 18803956009, all sorted primes ok 110 - factor_exp(37607912018) ok 111 - factor(346065536839): 346065536839 = 11 * 11 * 163 * 373 * 47041, all sorted primes ok 112 - factor_exp(346065536839) ok 113 - factor(600851475143): 600851475143 = 71 * 839 * 1471 * 6857, all sorted primes ok 114 - factor_exp(600851475143) ok 115 - factor(3204941750802): 3204941750802 = 2 * 3 * 3 * 3 * 11 * 277 * 719 * 27091, all sorted primes ok 116 - factor_exp(3204941750802) ok 117 - factor(29844570422669): 29844570422669 = 19 * 19 * 27259 * 3032831, all sorted primes ok 118 - factor_exp(29844570422669) ok 119 - factor(279238341033925): 279238341033925 = 5 * 5 * 7 * 13 * 194899 * 629773, all sorted primes ok 120 - factor_exp(279238341033925) ok 121 - factor(2623557157654233): 2623557157654233 = 3 * 113 * 136841 * 56555467, all sorted primes ok 122 - factor_exp(2623557157654233) ok 123 - factor(24739954287740860): 24739954287740860 = 2 * 2 * 5 * 7 * 1123 * 157358823863, all sorted primes ok 124 - factor_exp(24739954287740860) ok 125 - factor(3369738766071892021): 3369738766071892021 = 204518747 * 16476429743, all sorted primes ok 126 - factor_exp(3369738766071892021) ok 127 - factor(10023859281455311421): 10023859281455311421 = 1308520867 * 7660450463, all sorted primes ok 128 - factor_exp(10023859281455311421) ok 129 - factor(9007199254740991): 9007199254740991 = 6361 * 69431 * 20394401, all sorted primes ok 130 - factor_exp(9007199254740991) ok 131 - factor(9007199254740992): 9007199254740992 = 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2, all sorted primes ok 132 - factor_exp(9007199254740992) ok 133 - factor(9007199254740993): 9007199254740993 = 3 * 107 * 28059810762433, all sorted primes ok 134 - factor_exp(9007199254740993) ok 135 - factor(6469693230): 6469693230 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23 * 29, all sorted primes ok 136 - factor_exp(6469693230) ok 137 - factor(200560490130): 200560490130 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23 * 29 * 31, all sorted primes ok 138 - factor_exp(200560490130) ok 139 - factor(7420738134810): 7420738134810 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23 * 29 * 31 * 37, all sorted primes ok 140 - factor_exp(7420738134810) ok 141 - factor(304250263527210): 304250263527210 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23 * 29 * 31 * 37 * 41, all sorted primes ok 142 - factor_exp(304250263527210) ok 143 - factor(13082761331670030): 13082761331670030 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23 * 29 * 31 * 37 * 41 * 43, all sorted primes ok 144 - factor_exp(13082761331670030) ok 145 - factor(614889782588491410): 614889782588491410 = 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23 * 29 * 31 * 37 * 41 * 43 * 47, all sorted primes ok 146 - factor_exp(614889782588491410) ok 147 - factor(440091295252541): 440091295252541 = 4623781 * 95179961, all sorted primes ok 148 - factor_exp(440091295252541) ok 149 - factor(5333042142001571): 5333042142001571 = 59928917 * 88989463, all sorted primes ok 150 - factor_exp(5333042142001571) ok 151 - factor(79127989298): 79127989298 = 2 * 443 * 443 * 449 * 449, all sorted primes ok 152 - factor_exp(79127989298) ok 153 - factor(2339796554687): 2339796554687 = 1290167 * 1813561, all sorted primes ok 154 - factor_exp(2339796554687) ok 155 - factor(124838608575421729): 124838608575421729 = 237659159 * 525284231, all sorted primes ok 156 - factor_exp(124838608575421729) ok 157 - factor(1434569741817480287): 1434569741817480287 = 898027043 * 1597468309, all sorted primes ok 158 - factor_exp(1434569741817480287) ok 159 - factor(1256490565186616147): 1256490565186616147 = 647310553 * 1941093899, all sorted primes ok 160 - factor_exp(1256490565186616147) ok 161 - factor(13356777177440210791): 13356777177440210791 = 3289045043 * 4060989437, all sorted primes ok 162 - factor_exp(13356777177440210791) ok 163 - divisors(0) ok 164 - divisor_sum(0) ok 165 - divisors(1) ok 166 - divisor_sum(1) ok 167 - divisors(2) ok 168 - divisor_sum(2) ok 169 - divisors(3) ok 170 - divisor_sum(3) ok 171 - divisors(4) ok 172 - divisor_sum(4) ok 173 - divisors(5) ok 174 - divisor_sum(5) ok 175 - divisors(6) ok 176 - divisor_sum(6) ok 177 - divisors(7) ok 178 - divisor_sum(7) ok 179 - divisors(8) ok 180 - divisor_sum(8) ok 181 - divisors(9) ok 182 - divisor_sum(9) ok 183 - divisors(10) ok 184 - divisor_sum(10) ok 185 - divisors(12) ok 186 - divisor_sum(12) ok 187 - divisors(16) ok 188 - divisor_sum(16) ok 189 - divisors(42) ok 190 - divisor_sum(42) ok 191 - divisors(30107) ok 192 - divisor_sum(30107) ok 193 - divisors(115553) ok 194 - divisor_sum(115553) ok 195 - divisors(123456) ok 196 - divisor_sum(123456) ok 197 - divisors(456789) ok 198 - divisor_sum(456789) ok 199 - divisors(4567890) ok 200 - divisor_sum(4567890) ok 201 - divisors(1032924637) ok 202 - divisor_sum(1032924637) ok 203 - divisors(1234567890) ok 204 - divisor_sum(1234567890) ok 205 - divisors(5040, 120) ok 206 - divisors(2^80-1, 128) ok 207 - divisors for n 0,1,12 and k 0,1,x ok 208 - trial_factor(1) ok 209 - trial_factor(4) ok 210 - trial_factor(9) ok 211 - trial_factor(11) ok 212 - trial_factor(25) ok 213 - trial_factor(30) ok 214 - trial_factor(210) ok 215 - trial_factor(175) ok 216 - trial_factor(403) ok 217 - trial_factor(549900) ok 218 - fermat_factor(1) ok 219 - fermat_factor(4) ok 220 - fermat_factor(9) ok 221 - fermat_factor(11) ok 222 - fermat_factor(25) ok 223 - fermat_factor(30) ok 224 - fermat_factor(210) ok 225 - fermat_factor(175) ok 226 - fermat_factor(403) ok 227 - fermat_factor(549900) ok 228 - holf_factor(1) ok 229 - holf_factor(4) ok 230 - holf_factor(9) ok 231 - holf_factor(11) ok 232 - holf_factor(25) ok 233 - holf_factor(30) ok 234 - holf_factor(210) ok 235 - holf_factor(175) ok 236 - holf_factor(403) ok 237 - holf_factor(549900) ok 238 - squfof_factor(1) ok 239 - squfof_factor(4) ok 240 - squfof_factor(9) ok 241 - squfof_factor(11) ok 242 - squfof_factor(25) ok 243 - squfof_factor(30) ok 244 - squfof_factor(210) ok 245 - squfof_factor(175) ok 246 - squfof_factor(403) ok 247 - squfof_factor(549900) ok 248 - pbrent_factor(1) ok 249 - pbrent_factor(4) ok 250 - pbrent_factor(9) ok 251 - pbrent_factor(11) ok 252 - pbrent_factor(25) ok 253 - pbrent_factor(30) ok 254 - pbrent_factor(210) ok 255 - pbrent_factor(175) ok 256 - pbrent_factor(403) ok 257 - pbrent_factor(549900) ok 258 - prho_factor(1) ok 259 - prho_factor(4) ok 260 - prho_factor(9) ok 261 - prho_factor(11) ok 262 - prho_factor(25) ok 263 - prho_factor(30) ok 264 - prho_factor(210) ok 265 - prho_factor(175) ok 266 - prho_factor(403) ok 267 - prho_factor(549900) ok 268 - pminus1_factor(1) ok 269 - pminus1_factor(4) ok 270 - pminus1_factor(9) ok 271 - pminus1_factor(11) ok 272 - pminus1_factor(25) ok 273 - pminus1_factor(30) ok 274 - pminus1_factor(210) ok 275 - pminus1_factor(175) ok 276 - pminus1_factor(403) ok 277 - pminus1_factor(549900) ok 278 - pplus1_factor(1) ok 279 - pplus1_factor(4) ok 280 - pplus1_factor(9) ok 281 - pplus1_factor(11) ok 282 - pplus1_factor(25) ok 283 - pplus1_factor(30) ok 284 - pplus1_factor(210) ok 285 - pplus1_factor(175) ok 286 - pplus1_factor(403) ok 287 - pplus1_factor(549900) ok 288 - cheb_factor(1) ok 289 - cheb_factor(4) ok 290 - cheb_factor(9) ok 291 - cheb_factor(11) ok 292 - cheb_factor(25) ok 293 - cheb_factor(30) ok 294 - cheb_factor(210) ok 295 - cheb_factor(175) ok 296 - cheb_factor(403) ok 297 - cheb_factor(549900) ok 298 - lehman_factor(1) ok 299 - lehman_factor(4) ok 300 - lehman_factor(9) ok 301 - lehman_factor(11) ok 302 - lehman_factor(25) ok 303 - lehman_factor(30) ok 304 - lehman_factor(210) ok 305 - lehman_factor(175) ok 306 - lehman_factor(403) ok 307 - lehman_factor(549900) ok 308 - trial factor 2203 * 2503 ok 309 - trial_factor(1819015037140) fully factors ok 310 - holf factor 1935281 * 1936559 ok 311 - p-1 factor 347 * 479 ok 312 - p-1 factor 29 * 31 with tiny B1 ok 313 - p-1 factor 23 * 29 with small B1 ok 314 - p-1 factor 23099 * 24407 using stage 2 ok 315 - cheb factor 1552318819 * 1588978007 ok 316 - prime_omega(n) ok 317 - prime_bigomega(n) ok 318 - prime_omega(-n) ok 319 - prime_bigomega(-n) ok t/51-randfactor.t ............ 1..4 ok 1 - random_factored_integer did not return 0 ok 2 - random_factored_integer in requested range ok 3 - factors match factor routine ok 4 - product of factors = n ok t/51-znlog.t ................. 1..22 ok 1 - znlog(5,2,1019) = 10 ok 2 - znlog(2,4,17) = ok 3 - znlog(7,3,8) = ok 4 - znlog(7,17,36) = ok 5 - znlog(1,8,9) = 0 [0 2 4 6 8] ok 6 - znlog(3,3,8) = 1 [1 3 5 7] ok 7 - znlog(10,2,101) = 25 ok 8 - znlog(2,55,101) = 73 ok 9 - znlog(5,2,401) = 48 [48 248] ok 10 - znlog(228,2,383) = 110 [110 301] ok 11 - znlog(3061666278,499998,3332205179) = 22 ok 12 - znlog(5678,5,10007) = 8620 ok 13 - znlog(7531,6,8101) = 6689 ok 14 - znlog(0,30,100) = 2 ok 15 - znlog(1,1,101) = 0 ok 16 - znlog(8,2,102) = 3 ok 17 - znlog(18,18,102) = 1 ok 18 - znlog(5675,5,10000019) = 2003974 [2003974 7003983] ok 19 - znlog(18478760,5,314138927) = 34034873 ok 20 - znlog(553521,459996,557057) = 15471 [15471 48239 81007 113775 146543 179311 212079 244847 277615 310383 343151 375919 408687 441455 474223 506991 539759] ok 21 - znlog(7443282,4,13524947) = 6762454 [6762454 13524927] ok 22 - znlog(32712908945642193,5,71245073933756341) = 5945146967010377 ok t/52-primearray.t ............ 1..21 ok 1 - primes 0 .. 499 can be randomly selected ok 2 - primes 0 .. 499 in forward order ok 3 - primes 0 .. 499 in reverse order ok 4 - 51 primes using array slice ok 5 - random array slice of small primes ok 6 - primes[377] == 2593 ok 7 - primes[4500] == 43063 ok 8 - primes[123456] == 1632913 ok 9 - primes[15678] == 172157 ok 10 - primes[4999] == 48611 ok 11 - primes[30107] == 351707 ok 12 - primes[1999] == 17389 ok 13 - primes[78901] == 1005413 ok 14 - shift 2 ok 15 - shift 3 ok 16 - shift 5 ok 17 - shift 7 ok 18 - shift 11 ok 19 - 13 after shifts ok 20 - 11 after unshift ok 21 - 3 after unshift 3 ok t/53-realfunctions.t ......... 1..63 ok 1 - li(-1) is invalid ok 2 - R(0) is invalid ok 3 - R(-1) is invalid ok 4 - Ei(0) is -infinity ok 5 - Ei(-inf) is 0 ok 6 - Ei(inf) is infinity ok 7 - li(0) is 0 ok 8 - li(1) is -infinity ok 9 - li(inf) is infinity ok 10 - Ei(2.2) ok 11 - Ei(0.693147180559945) ~= 1.04516378011749 ok 12 - Ei(10) ~= 2492.22897624188 ok 13 - Ei(-1e-08) ~= -17.8434650890508 ok 14 - Ei(-1e-05) ~= -10.9357198000437 ok 15 - Ei(12) ~= 14959.5326663975 ok 16 - Ei(5) ~= 40.1852753558032 ok 17 - Ei(-0.1) ~= -1.82292395841939 ok 18 - Ei(1) ~= 1.89511781635594 ok 19 - Ei(41) ~= 1.6006649143245e+16 ok 20 - Ei(-0.001) ~= -6.33153936413615 ok 21 - Ei(40) ~= 6039718263611242 ok 22 - Ei(-0.5) ~= -0.55977359477616 ok 23 - Ei(-10) ~= -4.15696892968532e-06 ok 24 - Ei(2) ~= 4.95423435600189 ok 25 - Ei(79) ~= 2.61362206325046e+32 ok 26 - Ei(20) ~= 25615652.6640566 ok 27 - Ei(1.5) ~= 3.3012854491298 ok 28 - li(10) ~= 6.1655995047873 ok 29 - li(100000000) ~= 5762209.37544803 ok 30 - li(100000) ~= 9629.8090010508 ok 31 - li(1000) ~= 177.609657990152 ok 32 - li(2) ~= 1.04516378011749 ok 33 - li(10000000000) ~= 455055614.586623 ok 34 - li(1.01) ~= -4.02295867392994 ok 35 - li(100000000000) ~= 4118066400.62161 ok 36 - li(24) ~= 11.2003157952327 ok 37 - li(4294967295) ~= 203284081.954542 ok 38 - li(0) ~= 0 ok 39 - R(18446744073709551615) ~= 4.25656284014012e+17 ok 40 - R(2) ~= 1.54100901618713 ok 41 - R(1000) ~= 168.359446281167 ok 42 - R(10) ~= 4.56458314100509 ok 43 - R(4294967295) ~= 203280697.513261 ok 44 - R(1.01) ~= 1.00606971806229 ok 45 - R(10000000) ~= 664667.447564748 ok 46 - R(1000000) ~= 78527.3994291277 ok 47 - R(10000000000) ~= 455050683.306847 ok 48 - Zeta(8.5) ~= 0.00285925088241563 ok 49 - Zeta(7) ~= 0.00834927738192283 ok 50 - Zeta(4.5) ~= 0.0547075107614543 ok 51 - Zeta(2.5) ~= 0.341487257250917 ok 52 - Zeta(2) ~= 0.644934066848226 ok 53 - Zeta(20.6) ~= 6.29339157357821e-07 ok 54 - LambertW(10) ~= 1.7455280027407 ok 55 - LambertW(-0.367879441171442) ~= -0.99999995824889 ok 56 - LambertW(10000) ~= 7.23184603809337 ok 57 - LambertW(0.367879441171442) ~= 0.278464542761074 ok 58 - LambertW(18446744073709551615) ~= 40.6562665724989 ok 59 - LambertW(100000000000) ~= 22.2271227349611 ok 60 - LambertW(-0.1) ~= -0.111832559158963 ok 61 - LambertW(1) ~= 0.567143290409784 ok 62 - LambertW(0) ~= 0 ok 63 - Ei(170) ~= 4.00120321792255e+71 ok t/70-rt-bignum.t ............. skipped: these tests are for author testing t/80-pp.t .................... 1..36 ok 1 - require Math::Prime::Util::PP; ok 2 - require Math::Prime::Util::PrimalityProving; # Subtest: arithmetic ops ok 1 - addint ok 2 - subint ok 3 - add1int ok 4 - sub1int ok 5 - mulint ok 6 - powint ok 7 - divint ok 8 - cdivint ok 9 - modint ok 10 - divrem ok 11 - fdivrem ok 12 - cdivrem ok 13 - tdivrem ok 14 - lshiftint ok 15 - rshiftint ok 16 - rashiftint ok 17 - absint ok 18 - negint ok 19 - cmpint ok 20 - signint ok 21 - sqrtint ok 22 - rootint ok 23 - logint ok 24 - negmod ok 25 - addmod ok 26 - submod ok 27 - mulmod ok 28 - muladdmod ok 29 - mulsubmod ok 30 - powmod ok 31 - divmod ok 32 - invmod(45,59) ok 33 - invmod(14,28474) ok 34 - invmod(42,-2017) ok 35 - sqrtmod(124,137) = undef ok 36 - sqrtmod(11,137) = 55 ok 37 - rootmod k=0 => undef ok 38 - rootmod a=0 => 0 ok 39 - rootmod(2,11,4725) = 3623 ok 40 - rootmod with neg k = invmod of pos k ok 41 - rootmod ok 42 - allsqrtmod ok 43 - allrootmod ok 44 - allsqrtmod highly composite mod ok 45 - allsqrtmod highly composite mod ok 46 - allrootmod with composite k and n 1..46 ok 3 - arithmetic ops # Subtest: primality ok 1 - is_prime 0 .. 1086 ok 2 - is_prime for selected numbers 1..2 ok 4 - primality ok 5 - Trial primes 2-80 # Subtest: primes ok 1 - Primes between 0 and 1069 ok 2 - Primes between 0 and 1070 ok 3 - Primes between 0 and 1086 ok 4 - primes(0) should return [] ok 5 - primes(1) should return [] ok 6 - primes(2) should return [2] ok 7 - primes(3) should return [2 3] ok 8 - primes(4) should return [2 3] ok 9 - primes(5) should return [2 3 5] ok 10 - primes(6) should return [2 3 5] ok 11 - primes(7) should return [2 3 5 7] ok 12 - primes(11) should return [2 3 5 7 11] ok 13 - primes(18) should return [2 3 5 7 11 13 17] ok 14 - primes(19) should return [2 3 5 7 11 13 17 19] ok 15 - primes(20) should return [2 3 5 7 11 13 17 19] ok 16 - primes(3,9) should return [3 5 7] ok 17 - primes(2,20) should return [2 3 5 7 11 13 17 19] ok 18 - primes(30,70) should return [31 37 41 43 47 53 59 61 67] ok 19 - primes(70,30) should return [] ok 20 - primes(20,2) should return [] ok 21 - primes(1,1) should return [] ok 22 - primes(2,2) should return [2] ok 23 - primes(3,3) should return [3] ok 24 - primes(2,3) should return [2 3] ok 25 - primes(2,5) should return [2 3 5] ok 26 - primes(3,6) should return [3 5] ok 27 - primes(3,7) should return [3 5 7] ok 28 - primes(4,8) should return [5 7] ok 29 - primes(2010733,2010881) should return [2010733 2010881] ok 30 - primes(2010734,2010880) should return [] ok 31 - primes(3088,3164) should return [3089 3109 3119 3121 3137 3163] ok 32 - primes(3089,3163) should return [3089 3109 3119 3121 3137 3163] ok 33 - primes(3090,3162) should return [3109 3119 3121 3137] ok 34 - primes(3842610773,3842611109) should return [3842610773 3842611109] ok 35 - primes(3842610774,3842611108) should return [] 1..35 ok 6 - primes # Subtest: sieve range ok 1 - sieve range depth 1 ok 2 - sieve range depth 2 ok 3 - sieve range depth 3 ok 4 - sieve range depth 5 1..4 ok 7 - sieve range # Subtest: next and prev prime ok 1 - next prime of 19609 is 19609+52 ok 2 - prev prime of 19609+52 is 19609 ok 3 - next prime of 360653 is 360653+96 ok 4 - prev prime of 360653+96 is 360653 ok 5 - next prime of 2010733 is 2010733+148 ok 6 - prev prime of 2010733+148 is 2010733 ok 7 - next prime of 19608 is 19609 ok 8 - next prime of 19610 is 19661 ok 9 - next prime of 19660 is 19661 ok 10 - prev prime of 19662 is 19661 ok 11 - prev prime of 19660 is 19609 ok 12 - prev prime of 19610 is 19609 ok 13 - Previous prime of 2 returns undef ok 14 - next_prime(~0-4) returns bigint result ok 15 - next_prime in primegap before 2010881 ok 16 - prev_prime in primegap after 2010733 ok 17 - next_prime(1234567890) == 1234567891) ok 18 - next_prime(18446744073709551515) = 18446744073709551521 1..18 ok 8 - next and prev prime # Subtest: prime_count ok 1 - prime_count(1) = 0 ok 2 - prime_count(10) = 4 ok 3 - prime_count(100) = 25 ok 4 - prime_count(1000) = 168 ok 5 - prime_count(10000) = 1229 ok 6 - prime_count(60067) = 6062 ok 7 - prime_count(65535) = 6542 ok 8 - prime_count(1e9 +2**14) = 785 ok 9 - prime_count(17 to 13) = 0 ok 10 - prime_count(3 to 17) = 6 ok 11 - prime_count(4 to 17) = 5 ok 12 - prime_count(4 to 16) = 4 ok 13 - prime_count(191912783 +248) = 2 ok 14 - prime_count(191912784 +247) = 1 ok 15 - prime_count(191912783 +247) = 1 ok 16 - prime_count(191912784 +246) = 0 ok 17 - prime_count_lower(450) ok 18 - prime_count_upper(450) ok 19 - prime_count_lower(1234567) in range ok 20 - prime_count_upper(1234567) in range ok 21 - prime_count_lower(412345678) in range ok 22 - prime_count_upper(412345678) in range ok 23 - prime_count_approx(128722248) in range 1..23 ok 9 - prime_count # Subtest: nth_prime ok 1 - nth_prime(0) returns undef ok 2 - nth_prime(1) = 2 ok 3 - nth_prime(4) = 7 ok 4 - nth_prime(25) = 97 ok 5 - nth_prime(168) = 997 ok 6 - nth_prime(1229) = 9973 ok 7 - nth_prime(6062) = 60041 ok 8 - nth_prime(6542) = 65521 ok 9 - nth_prime(1) = 2 ok 10 - nth_prime(10) = 29 ok 11 - nth_prime(100) = 541 ok 12 - nth_prime(1000) = 7919 ok 13 - nth_prime_approx(1287248) in range ok 14 - nth_prime_lower(998491) ok 15 - nth_prime_upper(998491) ok 16 - nth_prime_approx(998491) 1..16 ok 10 - nth_prime # Subtest: pseudoprime tests ok 1 - MR with 0 shortcut composite ok 2 - MR with 0 shortcut composite ok 3 - MR with 2 shortcut prime ok 4 - MR with 3 shortcut prime ok 5 - Small pseudoprimes ok 6 - Small strong pseudoprimes ok 7 - is_strong_pseudoprime(75792980677) ok 8 - Small Lucas pseudoprimes ok 9 - Small strong Lucas pseudoprimes ok 10 - Small extra strong Lucas pseudoprimes ok 11 - Small AES Lucas pseudoprimes ok 12 - Small AES-2 Lucas pseudoprimes ok 13 - Small pure BPSW test ok 14 - 168790877523676911809192454171451 (SPSP to 2..52) test base 47 ok 15 - 168790877523676911809192454171451 found composite with base 53 ok 16 - 153515674455111174527 is an ESLSP ok 17 - is_bpsw_prime(153515674455111174527) = 0 as expected ok 18 - 517697641 is a Perrin pseudoprime ok 19 - 102690901 is a Perrin pseudoprime (Grantham) ok 20 - 517697641 is not a Frobenius pseudoprime ok 21 - 517697659 is prime via Frobenius-Khashin test ok 22 - 517697659 is prime via Frobenius-Underwood test ok 23 - 703 is a base 3 Euler pseudoprime ok 24 - 3277 is a Euler-Plumb pseudoprime ok 25 - is_catalan_pseudoprime(17) true ok 26 - is_catalan_pseudoprime(15127) false ok 27 # skip Skipping PP Catalan pseudoprime test without EXTENDED_TESTING ok 28 - Miller-Rabin random 40 on composite 1..28 ok 11 - pseudoprime tests # Subtest: omega primes ok 1 - omega_primes(1,20) ok 2 - omega_primes(2,20) ok 3 - omega_primes(3,100) ok 4 - omega_primes(4,500) ok 5 - nth_omega_prime(k,6) ok 6 - omega_prime_count(k,n) ok 7 - is_omega_prime (true) ok 8 - is_omega_prime (false) ok 9 - prime_omega(n) 1..9 ok 12 - omega primes # Subtest: almost primes ok 1 - almost_primes(1,20) ok 2 - almost_primes(2,20) ok 3 - almost_primes(3,20) ok 4 - almost_primes(4,60) ok 5 - nth_almost_prime(k,12) ok 6 - almost_prime_count(k,n) ok 7 - is_almost_prime (true) ok 8 - is_almost_prime (false) ok 9 - prime_bigomega(n) ok 10 - almost_prime_count_approx(3,10000) in range ok 11 - almost_prime_count_approx(5,10000) in range ok 12 - almost_prime_count_approx(7,1000000000000) in range ok 13 - almost_prime_count(3,389954) = 98699 ok 14 - almost_prime_count_lower(3,389954) ok 15 - almost_prime_count_upper(3,389954) ok 16 - almost_prime_count_approx(3,389954) ok 17 - almost_prime_count(7,489954) = 16527 ok 18 - almost_prime_count_lower(7,489954) ok 19 - almost_prime_count_upper(7,489954) ok 20 - almost_prime_count_approx(7,489954) ok 21 - nth_almost_prime_approx(4,10000000) ok 22 - nth_almost_prime_lower(4,10000000) ok 23 - nth_almost_prime_upper(4,10000000) ok 24 - nth_almost_prime_approx inside lo/hi bounds 1..24 ok 13 - almost primes # Subtest: prime powers ok 1 - prime_powers(100500,101000) ok 2 - next_prime_power ok 3 - next_prime_power ok 4 - prev_prime_power ok 5 - prev_prime_power ok 6 - prime_power_count(389954) = 33234 ok 7 - prime_power_count_lower(389954) ok 8 - prime_power_count_upper(389954) ok 9 - prime_power_count_approx(389954) ok 10 - nth_prime_power(5123) = 49033 ok 11 - nth_prime_power_lower(999154) ok 12 - nth_prime_power_upper(999154) ok 13 - nth_prime_power_approx(999154) 1..13 ok 14 - prime powers # Subtest: Twin primes ok 1 - twin_primes(100500,101500) ok 2 - twin_prime_count(4321) ok 3 - twin_prime_count(5000,5500) ok 4 - twin_prime_count_approx(4123456784123) ok 5 - nth_twin_prime(249) ok 6 - nth_twin_prime_approx(1234567890) 1..6 ok 15 - Twin primes # Subtest: Semi primes ok 1 - semi_primes(101500,101600) ok 2 - semiprime_count(12000, 123456) ok 3 - semiprime_count_approx(100294967494) in range ok 4 - nth_semiprime(1400) = 5137 ok 5 - nth_emiprime_approx(14000000000) in range 1..5 ok 16 - Semi primes # Subtest: Clusters ok 1 - sieve_prime_cluster(0,50, 2) ok 2 - sieve_prime_cluster(0,50, 2,4) ok 3 - sieve_prime_cluster(0,50, 2,6) ok 4 - sieve_prime_cluster(0,50, 4,6) ok 5 - sieve_prime_cluster(100,1000, 2,6,8) 1..5 ok 17 - Clusters # Subtest: Ramanujan primes ok 1 - Ramanujan primes under 100 ok 2 - ramanujan_prime_count(8840) = 500 ok 3 - ramanujan_prime_count_lower(8840) ok 4 - ramanujan_prime_count_upper(8840) ok 5 - ramanujan_prime_count_approx(8840) ok 6 - nth_ramanujan_prime(28) = 311 ok 7 - nth_ramanujan_prime_lower(39999) ok 8 - nth_ramanujan_prime_upper(39999) ok 9 - nth_ramanujan_prime_approx(39999) 1..9 ok 18 - Ramanujan primes # Subtest: real (float) functions ok 1 - Ei(5) ~= 40.1852753558032 ok 2 - Ei(2) ~= 4.95423435600189 ok 3 - Ei(0.693147180559945) ~= 1.04516378011749 ok 4 - Ei(-0.5) ~= -0.55977359477616 ok 5 - Ei(20) ~= 25615652.6640566 ok 6 - Ei(-0.001) ~= -6.33153936413615 ok 7 - Ei(-10) ~= -4.15696892968532e-06 ok 8 - Ei(1) ~= 1.89511781635594 ok 9 - Ei(40) ~= 6039718263611242 ok 10 - Ei(-0.1) ~= -1.82292395841939 ok 11 - Ei(41) ~= 1.6006649143245e+16 ok 12 - Ei(1.5) ~= 3.3012854491298 ok 13 - Ei(-1e-08) ~= -17.8434650890508 ok 14 - Ei(10) ~= 2492.22897624188 ok 15 - Ei(-1e-05) ~= -10.9357198000437 ok 16 - Ei(12) ~= 14959.5326663975 ok 17 - li(1.01) ~= -4.02295867392994 ok 18 - li(4294967295) ~= 203284081.954542 ok 19 - li(100000) ~= 9629.8090010508 ok 20 - li(10) ~= 6.1655995047873 ok 21 - li(100000000000) ~= 4118066400.62161 ok 22 - li(2) ~= 1.04516378011749 ok 23 - li(100000000) ~= 5762209.37544803 ok 24 - li(24) ~= 11.2003157952327 ok 25 - li(10000000000) ~= 455055614.586623 ok 26 - li(0) ~= 0 ok 27 - li(1000) ~= 177.609657990152 ok 28 - R(18446744073709551615) ~= 4.25656284014012e+17 ok 29 - R(4294967295) ~= 203280697.513261 ok 30 - R(10000000) ~= 664667.447564748 ok 31 - R(1.01) ~= 1.00606971806229 ok 32 - R(10) ~= 4.56458314100509 ok 33 - R(2) ~= 1.54100901618713 ok 34 - R(10000000000) ~= 455050683.306847 ok 35 - R(1000000) ~= 78527.3994291277 ok 36 - R(1000) ~= 168.359446281167 ok 37 - Zeta(7) ~= 0.00834927738192283 ok 38 - Zeta(2.5) ~= 0.341487257250917 ok 39 - Zeta(4.5) ~= 0.0547075107614543 ok 40 - Zeta(8.5) ~= 0.00285925088241563 ok 41 - Zeta(80) ~= 8.27180612553034e-25 ok 42 - Zeta(180) ~= 6.52530446799852e-55 ok 43 - Zeta(2) ~= 0.644934066848226 ok 44 - Zeta(20.6) ~= 6.29339157357821e-07 ok 45 - LambertW(6588) 1..45 ok 19 - real (float) functions # Subtest: factoring ok 1 - test factoring for 34 primes ok 2 - test factoring for 73 composites ok 3 - factor_exp ok 4 - divisors ok 5 - divisor_sum(252) ok 6 - divisor_sum(1254, {0..7}) ok 7 - znlog(5678, 5, 10007) ok 8 - holf(403) ok 9 - fermat(403) ok 10 - prho(403) ok 11 - prho(4294968337) ok 12 - pbrent(403) ok 13 - pbrent(4294968971) ok 14 - pminus1(403) ok 15 - prho(851981) ok 16 - pbrent(851981) ok 17 - cheb(2424869) ok 18 - ecm(101303039) ok 19 - prho(55834573561) ok 20 - pbrent(55834573561) ok 21 - prho: 18686551294184381720251 => [1013 18446743627032953327] ok 22 - pbrent: 18686551294184381720251 => [1013 18446743627032953327] ok 23 - pminus1: 18686551294184381720251 => [1013 18446743627032953327] ok 24 - ecm: 18686551294184381720251 => [1013 18446743627032953327] ok 25 - pminus1: 73786976294838213647 => [8149 9054727732830803] ok 26 - pminus1: 73786976294838206467 => [1669 44210291368986343] ok 27 # skip Skipping expensive p-1 stage 2 test ok 28 - fermat: 73786976930493367637 => [8589934627 8589934631] ok 29 # skip Skipping HOLF big test without extended testing ok 30 - holf correctly factors 99999999999979999998975857 ok 31 # skip ecm stage 2 ok 32 # skip stage 2 factoring tests for extended testing ok 33 # skip stage 2 factoring tests for extended testing ok 34 # skip stage 2 factoring tests for extended testing 1..34 ok 20 - factoring # Subtest: AKS primality ok 1 - AKS: 1 is composite (less than 2) ok 2 - AKS: 2 is prime ok 3 - AKS: 3 is prime ok 4 - AKS: 4 is composite ok 5 - AKS: 64 is composite (perfect power) ok 6 - AKS: 65 is composite (caught in trial) ok 7 - AKS: 23 is prime (r >= n) ok 8 - AKS: 70747 is composite (n mod r) ok 9 # skip Skipping PP AKS test without EXTENDED_TESTING ok 10 # skip Skipping PP AKS test without EXTENDED_TESTING 1..10 ok 21 - AKS primality # Subtest: is_gaussian_prime ok 1 - 29 is not a Gaussian Prime ok 2 - 31 is a Gaussian Prime ok 3 - 0-29i is not a Gaussian Prime ok 4 - 0-31i is a Gaussian Prime ok 5 - 58924+132000511i is a Gaussian Prime ok 6 - 519880-2265929i is a Gaussian Prime ok 7 - 20571+150592260i is not a Gaussian Prime 1..7 ok 22 - is_gaussian_prime # Subtest: other is * prime ok 1 - 1110000001 is a semiprime ok 2 - 1110000201 is not a semiprime ok 3 - is_prime_power(7^19) = 19 ok 4 - is_prime_power(7^19,0,r) => r=7 ok 5 - 41 is a Ramanujan prime ok 6 - 43 is not a Ramanujan prime ok 7 - 294001 is a delicate prime ok 8 - 862789 is a delicate prime in base 16 ok 9 - is_chen_prime ok 10 - next_chen_prime ok 11 - 2^107-1 is a Mersenne prime ok 12 - 2^113-1 is not a Mersenne prime ok 13 - is_almost_prime ok 14 - is_prob_prime(p) ok 15 - is_prob_prime(c) 1..15 ok 23 - other is * prime # Subtest: primality proofs ok 1 - primality_proof_lucas(100003) ok 2 - primality_proof_bls75(1490266103) ok 3 - primality_proof_bls75(27141057803) 1..3 ok 24 - primality proofs # Subtest: misc number theory functions ok 1 - consecutive_integer_lcm(13) ok 2 - consecutive_integer_lcm(52) ok 3 - moebius(513,537) ok 4 - moebius(42199) ok 5 - liouville(444456) ok 6 - liouville(562894) ok 7 - mertens(219) ok 8 - mertens(24219) ok 9 - euler_phi(1513,1537) ok 10 - euler_phi(324234) ok 11 - jordan_totient(4, 899) ok 12 - carmichael_lambda(324234) ok 13 - exp_mangoldt of power of 2 = 2 ok 14 - exp_mangoldt of even = 1 ok 15 - exp_mangoldt of 21 = 1 ok 16 - exp_mangoldt of 23 = 23 ok 17 - exp_mangoldt of 27 (3^3) = 3 ok 18 - znprimroot ok 19 - znorder(2,35) = 12 ok 20 - znorder(7,35) = undef ok 21 - znorder(67,999999749) = 30612237 ok 22 - znorder(2,1180591620717411303462) = 92595421232738141424 ok 23 - binomial(35,16) ok 24 - binomial(228,12) ok 25 - binomial(-23,-26) should be -2300 ok 26 - S(12,4) ok 27 - s(12,4) ok 28 - fubini(n) for n in {0..6,18} ok 29 - numtoperm ok 30 - permtonum ok 31 - randperm(50,4) generates different permutations ok 32 - randperm(8,6) generates different permutations ok 33 - bernfrac ok 34 - bernreal ok 35 - harmfrac ok 36 - harmreal ok 37 - gcdext(23948236,3498248) ok 38 - valuation(1879048192,2) ok 39 - valuation(96552,6) ok 40 - chebyshev_theta(7001) =~ 6929.2748 ok 41 - chebyshev_psi(6588) =~ 6597.07453 ok 42 - inverse totient 42 count ok 43 - inverse totient 42 list ok 44 - primorial(24) ok 45 - primorial(118) ok 46 - pn_primorial(7) ok 47 - partitions(74) ok 48 - legendre_phi(54321,5) = 11287 ok 49 - inverse_li ok 50 - inverse_li_nv ok 51 - forprimes 2387234,2387303 ok 52 - forcomposites 15202630,15202641 ok 53 - foroddcomposites 15202630,15202641 ok 54 - forsemiprimes 152026,152060 ok 55 - fordivisors: d|92834: k+=d+int(sqrt(d)) ok 56 - forfactored ok 57 - forcomb(3,2) ok 58 - forperm(3) ok 59 - forpart(4) ok 60 - forcomp(7,{amin=>2,nmin=>3}) ok 61 - forderange(4) ok 62 - forsetproduct([1,2],[qw/a b c/]) ok 63 - Pi(82) ok 64 - gcd(-30,-90,90) = 30 ok 65 - lcm(11926,78001,2211) = 2790719778 ok 66 - sum_primes(14400) ok 67 - mertens(5443) ok 68 - sumtotient(5443) ok 69 - sumliouville(5443) ok 70 - powersum ok 71 - sumdigits with binary string ok 72 - sumdigits with integer ok 73 - sumdigits with hex ok 74 - sumdigits with base 36 ok 75 - hammingweight ok 76 - kronecker ok 77 - cornacchia ok 78 - hclassno ok 79 - ramanujan_tau ok 80 - lucasu ok 81 - lucasv ok 82 - lucasumod ok 83 - lucasvmod ok 84 - lucasuvmod ok 85 - pisano_period 1..85 ok 25 - misc number theory functions # Subtest: more misc ntheory functions ok 1 - 381554124 is a totient ok 2 - 1073024875 is not a totient ok 3 - 5049 is not a Carmichael number ok 4 - 2792834247 is not a Carmichael number ok 5 - 2399550475 is not a Carmichael number ok 6 - 219389 is not a Carmichael number ok 7 - 1125038377 is a Carmichael number ok 8 - 1517 is quasi-Carmichael ok 9 - 10001 is quasi-Carmichael ok 10 - 10373 is quasi-Carmichael ok 11 - 1521 is not cyclic ok 12 - 10001 is cyclic ok 13 - 26657 is Pillai ok 14 - 1701 is not practical ok 15 - 1710 is practical ok 16 - -168 is fundamental ok 17 - 172 is fundamental ok 18 - congruent numbers: [34 41 206 207 692] ok 19 - non-congruent numbers: [17 19 26 33 35 42 51 130 170 986 1819] ok 20 - 536 is a happy number ok 21 - 571 is a happy number in base 7 ok 22 - 347 is a happy number in base 6 ok 23 - 514 is a happy number in base 16 with exponent 3 ok 24 - ramanujan_sum(12,36) = 4 ok 25 - is_power(6^17) = 17 ok 26 - is_power(6^17,0,r) => r=6 ok 27 - 603729 is a square ok 28 - is_sum_of_squares (k=2) for -10 .. 10, 437 ok 29 - 6 is a 3-polygonal number ok 30 - 9 is a 4-polygonal number ok 31 - is_odd(576) ok 32 - is_odd(577) ok 33 - is_even(576) ok 34 - is_even(577) ok 35 - is_divisible(30,7) ok 36 - is_divisible(30,5) ok 37 - is_congruent(100007,176,177) ok 38 - is_congruent(100007,2,177) ok 39 - is_square_free(331483) ok 40 - is_square_free(370481) ok 41 - is_primitive_root(3,1777) ok 42 - is_primitive_root(5,1777) ok 43 - is_perfect_number(2048) ok 44 - is_perfect_number(8128) ok 45 - fromdigits binary ok 46 - fromdigits base 16 ok 47 - todigits 77 ok 48 - todigits 77 base 2 ok 49 - todigitstring base 16 ok 50 - tozeckendorf ok 51 - fromzeckendorf ok 52 - 177 is not a quadratic residue mod 10256 ok 53 - 180 is a quadratic residue mod 10256 ok 54 - qnr(10271) = 7 ok 55 - chinese ok 56 - chinese2 ok 57 - frobenius_number ok 58 - factorial(53) ok 59 - factorialmod(53,177) ok 60 - subfactorial(15) ok 61 - binomialmod ok 62 - falling_factorial ok 63 - rising_factorial ok 64 - is_rough(31*n,31) = 1 ok 65 - is_rough(31*n,32) = 0 ok 66 - is_smooth(1291677,50) = 1 ok 67 - is_smooth(1291677,43) = 1 ok 68 - is_smooth(1291677,42) = 0 ok 69 - smooth_count ok 70 - rough_count 1..70 ok 26 - more misc ntheory functions # Subtest: Lucky numbers ok 1 - 1772 is not a lucky number ok 2 - 1771 is a lucky number ok 3 - lucky numbers between 600 and 700 ok 4 - lucky_count(8840) = 1004 ok 5 - lucky_count_lower(8840) ok 6 - lucky_count_upper(8840) ok 7 - lucky_count_approx(8840) ok 8 - nth_lucky(28) = 129 ok 9 - nth_lucky_lower(1088761) 18512710 <= 18605821 ok 10 - nth_lucky_upper(1088761) 18648397 >= 18605821 ok 11 - nth_lucky_approx(1088761) 18587059 =~ 18605821 1..11 ok 27 - Lucky numbers # Subtest: perfect powers ok 1 - 19487172 is not a perfect power ok 2 - 19487171 is a perfect power ok 3 - next_perfect_power(5^7) = 402^2 ok 4 - prev_perfect_power(5^7) = 401^2 ok 5 - perfect_power_count(123456) = 404 ok 6 - perfect_power_count(123456,234567) = 148 ok 7 - perfect_power_count_lower ok 8 - perfect_power_count_upper ok 9 - perfect_power_count_approx ok 10 - nth_perfect_power ok 11 - nth_perfect_power_lower ok 12 - nth_perfect_power_lower ok 13 - nth_perfect_power_approx 1..13 ok 28 - perfect powers # Subtest: powerful ok 1 - 260 is not a powerful number ok 2 - 243 is a powerful number ok 3 - 157^3 * 151^4 is a 3-powerful number ok 4 - powerful_numbers(10500,11000) ok 5 - powerful_count(1234567) ok 6 - powerful_count(1234567,3) ok 7 - nth_powerful ok 8 - sumpowerful 1..8 ok 29 - powerful # Subtest: powerfree ok 1 - 1000 is not powerfree ok 2 - 1001 is powerfree ok 3 - powerfree_count ok 4 - nth_powerfree ok 5 - powerfree_part(100040) = 25010 ok 6 - powerfree_part(100040,3) = 12505 ok 7 - squarefree_kernel(100040) = 25010 ok 8 - powerfree_part(10040) = 2501 ok 9 - squarefree_kernel(10004) = 5002 ok 10 - powerfree_sum ok 11 - powerfree_part_sum(100040) ok 12 - powerfree_part_sum(100040,3) ok 13 - powerfree_part_sum(100040,4) ok 14 - powerfree_count(27000000,3) ok 15 - powerfree_count(400040001,2) ok 16 - powerfree_count(10000000000,6) ok 17 - powerfree_count(10^20,15) 1..17 ok 30 - powerfree # Subtest: set functions ok 1 - toset ok 2 - setinsert one element already in set ok 3 - setinsert one element not in set ok 4 - setinsert 4 elements, one in set ok 5 - setremove 1 element not in set ok 6 - setremove 1 element in set ok 7 - setremove 2 elements in set ok 8 - setinvert ok 9 - setinvert ok 10 - setinvert ok 11 - setcontains one not found ok 12 - setcontains one found ok 13 - setcontains subset not found ok 14 - setcontains subset found ok 15 - setcontainsany not found ok 16 - setcontainsany found ok 17 - setcontains with primes ok 18 - setcontains with more primes ok 19 - setinsert at the front ok 20 - setinsert many values, to front, middle, and back ok 21 - setbinop ok 22 - sumset ok 23 - setunion ok 24 - setintersect ok 25 - setminus ok 26 - setminus ok 27 - setdelta ok 28 - is_sidon_set (false) ok 29 - is_sidon_set (true) ok 30 - is_sidon_set (true) ok 31 - is_sumfree_set (false) ok 32 - is_sumfree_set (true) ok 33 - set_is_disjoint ok 34 - set_is_disjoint ok 35 - set_is_equal ok 36 - set_is_equal ok 37 - set_is_subset ok 38 - set_is_subset ok 39 - set_is_proper_subset ok 40 - set_is_proper_subset ok 41 - set_is_superset ok 42 - set_is_superset ok 43 - set_is_proper_superset ok 44 - set_is_superset ok 45 - set_is_proper_superset ok 46 - set_is_proper_intersection ok 47 - set_is_proper_intersection 1..47 ok 31 - set functions # Subtest: vector (list) functions ok 1 - vecsum(15,30,45) ok 2 - vecsum(2^32-1000,2^32-2000,2^32-3000) ok 3 - vecprod(15,30,45) ok 4 - vecprod(2^32-1000,2^32-2000,2^32-3000) ok 5 - vecmin(2^32-1000,2^32-2000,2^32-3000) ok 6 - vecmax(2^32-1000,2^32-2000,2^32-3000) ok 7 - vecmin ok 8 - vecmax ok 9 - vecsum ok 10 - vecprod ok 11 - vecreduce ok 12 - vecextract ok 13 - vecequal([1,2,3],[1,2,3]) = 1 ok 14 - vecequal([1,2,3],[3,2,1]) = 0 ok 15 - vecany true ok 16 - vecall false ok 17 - vecnotall true ok 18 - vecnone true ok 19 - vecsort ok 20 - vecsorti ok 21 - vecfirst ok 22 - vecfirstidx ok 23 - vecuniq ok 24 - vecsingleton ok 25 - vecfreq ok 26 - vecmex(0,1,2,4) = 3 ok 27 - vecpmex(1,2,24,5) = 3 ok 28 - shuffle n items returns n items ok 29 - shuffled 128-element array isn't identical ok 30 - shuffled outputs are the same elements as input ok 31 - vecsample returns all items with exact k ok 32 - vecslide {$a+$b} 1..5 1..32 ok 32 - vector (list) functions # Subtest: rationals ok 1 - contfrac ok 2 - from_contfrac ok 3 - calkin_wilf_n(1249,9469) = 10000000 ok 4 - nth_calkin_wilf(10000000) ok 5 - next_calkin_wilf ok 6 - calkin_wilf_n(25999,17791) ok 7 - nth_calkin_wilf(834529325481721) ok 8 - stern_brocot_n(1249,9469) = 8434828 ok 9 - nth_stern_brocot(1249,9469) ok 10 - next_stern_brocot ok 11 - stern_brocot_n(1409,10682) ok 12 - nth_stern_diatomic ok 13 - farey(6) ok 14 - farey(144,146) ok 15 - scalar farey(1445) = 635141 ok 16 - next_farey ok 17 - farey_rank 1..17 ok 33 - rationals # Subtest: Goldbach ok 1 - minimal_goldbach_pair ok 2 - goldbach_pair_count ok 3 - goldbach_pairs ok 4 - goldbach_pairs for odd n where n-2 is prime ok 5 - goldbach_pairs for odd n where n-2 is not prime ok 6 - scalar goldbach_pairs returns count 1..6 ok 34 - Goldbach # Subtest: config ok 1 - default PP precalc = 5003 ok 2 - after prime_precalc(7003) = 7003 ok 3 - after memfree = 5003 ok 4 - default is not assume Riemann hypothesis ok 5 - We are now assuming it 1..5 ok 35 - config ok 36 - Nobody clobbered $_ ok # BigInt 0.67/2.003002/2.003002, lib: Calc. MPU::GMP 0.53 t/81-bigint.t ................ 1..24 # Subtest: arithmetic ops ok 1 - negint(n) ok 2 - negint(negint(n)) ok 3 - absint(negint(n)) ok 4 - signint(n) ok 5 - signint(negint(n)) ok 6 - cmpint(n,n) = 0 ok 7 - cmpint(n,-n) = 1 ok 8 - cmpint(-n,n) = -1 ok 9 - addint(n,n) = 2n ok 10 - addint(2*n,n) = 3n ok 11 - addint(-n,n) = 0 ok 12 - subint(3n,2n) = n ok 13 - subint(n,-n) = 2n ok 14 - add1int(n) = n+1 ok 15 - sub1int(n) = n-1 ok 16 - mulint(2,n) = 2n ok 17 - mulint(n,3) = 3n ok 18 - mulint(n,-3) = -3n ok 19 - mulint(n,n) = n^2 ok 20 - powint(n,0) = 1 ok 21 - powint(n,1) = n ok 22 - powint(n,2) = n^2 ok 23 - powint(n,3) = n^3 ok 24 - powint(-n,0) = 1 ok 25 - powint(-n,1) = -n ok 26 - powint(-n,2) = n^2 ok 27 - powint(-n,3) = -n^3 ok 28 - lshiftint(n) = 2n ok 29 - lshiftint(3n,14) = 3n * 2^14 ok 30 - rshiftint(2n) = n ok 31 - rshiftint(n,7) = n / 2^7 ok 32 - rshiftint(-n,7) = -(n >> 7) ok 33 - rashiftint(-n,7) = (fdivrem(n,2**7))[0] [Python right shift] ok 34 - divint(2n,2) = n ok 35 - divint(-3n,3) = -n ok 36 - mod(3n,n) = 0 ok 37 - mod(n,1) = 0 ok 38 - mod(n,29) ok 39 - mod(-n,37) ok 40 - divint(-n,511) ok 41 - cdivint(-n,511) ok 42 - divrem(-m,d) ok 43 - fdivrem(-m,d) ok 44 - cdivrem(-m,d) ok 45 - tdivrem(-m,d) ok 46 - sqrtint(n^2) = n ok 47 - sqrtint(n^3) = n^(3/2) ok 48 - rootint(n^3,7,\$r) ok 49 - logint(n,18,\$r) 1..49 ok 1 - arithmetic ops # Subtest: basic mod ops ok 1 - negmod ok 2 - addmod ok 3 - submod ok 4 - mulmod ok 5 - muladdmod ok 6 - mulsubmod ok 7 - divmod ok 8 - powmod ok 9 - invmod ok 10 - sqrtmod [prime modulus] ok 11 - sqrtmod [composite modulus] ok 12 # skip another sqrtmod skipped without EXTENDED_TESTING ok 13 - rootmod(C,5,D) [prime modulus] ok 14 - rootmod(C,35,Da) [composite modulus] ok 15 - allsqrtmod ok 16 - allrootmod 1..16 ok 2 - basic mod ops # Subtest: other mod ops ok 1 - is_congruent ok 2 - is_congruent ok 3 - is_qr ok 4 - is_qr ok 5 - qnr ok 6 - qnr ok 7 - is_primitive_root ok 8 - is_primitive_root ok 9 - factorialmod ok 10 - factorialmod ok 11 - binomialmod ok 12 - lucasumod with Q=1 ok 13 - lucasvmod with Q=1 1..13 ok 3 - other mod ops # Subtest: gcd and lcm ok 1 - gcd(a,b,c) ok 2 - gcd(a,b) ok 3 - gcd of two primes = 1 ok 4 - lcm(p1,p2) ok 5 - lcm(p1,p1) ok 6 - lcm(a,b,c,d,e) 1..6 ok 4 - gcd and lcm # Subtest: gcdext and chinese ok 1 - gcdext(a,b) ok 2 - chinese([26,17179869209],[17,34359738421] = 103079215280 1..2 ok 5 - gcdext and chinese # Subtest: primality ok 1 - 100000982717289000001 is prime ok 2 - 100000982717289000001 is probably prime ok 3 - 36893488147419103233 is not probably prime ok 4 - 36893488147419103249 is not probably prime ok 5 - 36893488147419103261 is not probably prime ok 6 - 36893488147419103253 is not probably prime ok 7 - 21652684502221 is not probably prime ok 8 - 1195068768795265792518361315725116351898245581 is not probably prime 1..8 ok 6 - primality # Subtest: range primes ok 1 - primes( 2^66, 2^66 + 100 ) ok 2 - twin_primes(18446744073760736000,+1000) 1..2 ok 7 - range primes # Subtest: next and prev ok 1 - next_prime(777777777777777777777777) ok 2 - prev_prime(777777777777777777777777) 1..2 ok 8 - next and prev # Subtest: prime iterator ok 1 - iterator 3 primes starting at 10^24+910 1..1 ok 9 - prime iterator # Subtest: prime counts ok 1 - prime_count(87..7252, 87..7352) ok 2 - PC approx(31415926535897932384) ok 3 - prime count bounds for 31415926535897932384 are in the right order ok 4 - PC lower with RH ok 5 - PC upper with RH ok 6 - PC lower ok 7 - PC upper 1..7 ok 10 - prime counts # Subtest: factoring ok 1 - factor(1234567890) ok 2 - factor_exp(1234567890) ok 3 - factor(3493005066479) ok 4 - factor_exp(3493005066479) ok 5 - factor_exp(23489223467134234890234680) ok 6 - divisors(23489223467134234890234680) 1..6 ok 11 - factoring # Subtest: znorder znprimroot znlog ok 1 - znorder(8267,927208363107752634625925) ok 2 - znorder(902,827208363107752634625947 ok 3 - znprimroot(2985417419712080156311) ok 4 - znlog(b,g,p): find k where b^k = g mod p 1..4 ok 12 - znorder znprimroot znlog # Subtest: divisor sum ok 1 - Divisor sum of 50! ok 2 - Divisor count(103\#) ok 3 - Divisor sum(103\#) ok 4 - sigma_2(103\#) 1..4 ok 13 - divisor sum ok 14 - moebius(618970019642690137449562110) ok 15 - euler_phi(618970019642690137449562110) ok 16 - carmichael_lambda(618970019642690137449562110) ok 17 - kronecker(..., ...) ok 18 - valuation(6^625,5) = 5 # Subtest: jordan totient ok 1 - jordan_totient(3,438200690176361625211) ok 2 - jordan totient using divisor_sum and moebius 1..2 ok 19 - jordan totient # Subtest: liouville ok 1 - liouville(a x b x c) = -1 ok 2 - liouville(a x b x c x d) = 1 1..2 ok 20 - liouville # Subtest: is_power ok 1 - ispower(18475335773296164196) == 0 ok 2 - ispower(150607571^14) == 14 ok 3 - is_power( -(7^i) ) for 0 .. 31 ok 4 - same result with is_power(n,0,\$r) ok 5 - correct roots in $r 1..5 ok 21 - is_power # Subtest: random primes ok 1 # skip Skipping random prime tests without EXTENDED_TESTING ok 2 # skip Skipping random prime tests without EXTENDED_TESTING ok 3 # skip Skipping random prime tests without EXTENDED_TESTING ok 4 # skip Skipping random prime tests without EXTENDED_TESTING ok 5 # skip Skipping random prime tests without EXTENDED_TESTING ok 6 # skip Skipping random prime tests without EXTENDED_TESTING ok 7 # skip Skipping random prime tests without EXTENDED_TESTING ok 8 # skip Skipping random prime tests without EXTENDED_TESTING ok 9 # skip Skipping random prime tests without EXTENDED_TESTING ok 10 # skip Skipping random prime tests without EXTENDED_TESTING ok 11 # skip Skipping random prime tests without EXTENDED_TESTING ok 12 # skip Skipping random prime tests without EXTENDED_TESTING ok 13 # skip Skipping random prime tests without EXTENDED_TESTING ok 14 # skip Skipping random prime tests without EXTENDED_TESTING ok 15 # skip Skipping random prime tests without EXTENDED_TESTING ok 16 # skip Skipping random prime tests without EXTENDED_TESTING ok 17 # skip Skipping random prime tests without EXTENDED_TESTING ok 18 # skip Skipping random prime tests without EXTENDED_TESTING ok 19 # skip Skipping random prime tests without EXTENDED_TESTING ok 20 # skip Skipping random prime tests without EXTENDED_TESTING ok 21 # skip Skipping random prime tests without EXTENDED_TESTING ok 22 # skip Skipping random prime tests without EXTENDED_TESTING ok 23 # skip Skipping random prime tests without EXTENDED_TESTING ok 24 # skip Skipping random prime tests without EXTENDED_TESTING ok 25 # skip Skipping random prime tests without EXTENDED_TESTING ok 26 # skip Skipping random prime tests without EXTENDED_TESTING 1..26 ok 22 - random primes # Subtest: vecequal ok 1 - vecequal with Math::BigInt ok 2 - vecequal with Math::BigInt and scalar ok 3 - vecequal with equal Math::BigInt ok 4 - vecequal with unequal Math::BigInt ok 5 - vecequal with hash should error 1..5 ok 23 - vecequal ok 24 - Nobody clobbered $_ ok t/90-release-perlcritic.t .... skipped: these tests are for release candidate testing t/91-release-pod-syntax.t .... skipped: these tests are for release candidate testing t/92-release-pod-coverage.t .. skipped: these tests are for release candidate testing t/93-release-spelling.t ...... skipped: these tests are for release candidate testing t/94-weaken.t ................ skipped: these tests are for release candidate testing t/97-synopsis.t .............. skipped: these tests are for release candidate testing All tests successful. Files=129, Tests=4217, 14 wallclock secs ( 0.48 usr 0.17 sys + 11.67 cusr 2.00 csys = 14.32 CPU) Result: PASS make[1]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' create-stamp debian/debhelper-build-stamp dh_prep debian/rules override_dh_auto_install make[1]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_auto_install make -j2 install DESTDIR=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl AM_UPDATE_INFO_DIR=no PREFIX=/usr make[2]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' "/usr/bin/perl" -MExtUtils::Command::MM -e 'cp_nonempty' -- Util.bs blib/arch/auto/Math/Prime/Util/Util.bs 644 Manifying 14 pod documents Files found in blib/arch: installing files in blib/lib into architecture dependent library tree Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/auto/Math/Prime/Util/Util.so Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/ntheory.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PrimalityProving.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ZetaBigFloat.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/MemFree.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PPFE.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ECProjectivePoint.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ChaCha.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PP.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PrimeIterator.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/RandomPrimes.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/Entropy.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PrimeArray.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ECAffinePoint.pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::Entropy.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::ECProjectivePoint.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::PrimeArray.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::PPFE.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/ntheory.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::RandomPrimes.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::ECAffinePoint.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::ChaCha.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::PP.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::ZetaBigFloat.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::MemFree.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::PrimalityProving.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man3/Math::Prime::Util::PrimeIterator.3pm Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin/factor.pl Installing /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin/primes.pl make[2]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' mv /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin/primes.pl /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin/primes mkdir -p /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man1 PERL5LIB=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl//usr/lib/x86_64-linux-gnu/perl5/5.40 help2man -n 'Display all primes' --no-info --no-discard-stderr /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin/primes | gzip -9 > /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man1/primes.1.gz PERL5LIB=/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl//usr/lib/x86_64-linux-gnu/perl5/5.40 help2man -n 'Print prime factors' --no-info --no-discard-stderr /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin/factor.pl | gzip -9 > /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/man/man1/factor.pl.1.gz find /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/bin -type f -print0 | \ xargs -r0 sed -i -e '1s|^#!/usr/bin/env perl|#!/usr/bin/perl|' make[1]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_installdocs dh_installchangelogs debian/rules override_dh_installexamples make[1]: Entering directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_installexamples find /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74/debian/libmath-prime-util-perl/usr/share/doc/libmath-prime-util-perl/examples -type f -name "*.pl" -print0 | \ xargs -r0 sed -i -e '1s|^#!/usr/bin/env perl|#!/usr/bin/perl|' make[1]: Leaving directory '/build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74' dh_installman dh_lintian dh_perl dh_link dh_strip_nondeterminism dh_compress dh_fixperms dh_missing dh_dwz -a dh_strip -a dh_makeshlibs -a dh_shlibdeps -a dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 from: /lib64/ld-linux-x86-64.so.2 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 to: /lib64/ld-linux-x86-64.so.2.usr-is-merged dh_installdeb dh_gencontrol dh_md5sums dh_builddeb dpkg-deb: building package 'libmath-prime-util-perl-dbgsym' in '../libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb'. dpkg-deb: building package 'libmath-prime-util-perl' in '../libmath-prime-util-perl_0.74-1_amd64.deb'. dpkg-genbuildinfo -O../libmath-prime-util-perl_0.74-1_amd64.buildinfo dpkg-genchanges -O../libmath-prime-util-perl_0.74-1_amd64.changes dpkg-genchanges: info: including full source code in upload dpkg-source -Zxz --after-build . dpkg-buildpackage: info: full upload (original source is included) -------------------------------------------------------------------------------- Build finished at 2026-03-28T05:02:37Z Finished -------- I: Built successfully +------------------------------------------------------------------------------+ | Changes Sat, 28 Mar 2026 05:02:37 +0000 | +------------------------------------------------------------------------------+ libmath-prime-util-perl_0.74-1_amd64.changes: --------------------------------------------- Format: 1.8 Date: Fri, 27 Mar 2026 23:37:41 +0100 Source: libmath-prime-util-perl Binary: libmath-prime-util-perl libmath-prime-util-perl-dbgsym Architecture: source amd64 Version: 0.74-1 Distribution: sid Urgency: medium Maintainer: Debian Perl Group Changed-By: gregor herrmann Description: libmath-prime-util-perl - utilities related to prime numbers, including fast sieves and fac Changes: libmath-prime-util-perl (0.74-1) unstable; urgency=medium . * Import upstream version 0.74. * Update years of upstream and packaging copyright. * Add API changes to debian/NEWS. * Declare compliance with Debian Policy 4.7.3. * Remove «Rules-Requires-Root: no», which is the current default. * Remove «Priority: optional», which is the current default. * Refresh lintian override. Checksums-Sha1: 565ae41f5641e3979e5831db09bc6e13cf16eae9 1469 libmath-prime-util-perl_0.74-1.dsc e3d296e660a6d990c77380af3d1b2d8abc8651a7 1006501 libmath-prime-util-perl_0.74.orig.tar.gz f300f873643ef5a12dc73f6261d778b4a08f4b29 7232 libmath-prime-util-perl_0.74-1.debian.tar.xz e8ccf80bd168cf663f0541faed2a8933712f52fe 883204 libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb cfb81fd2e40d3d10261b70d09ac6fb1fba4a2f40 5786 libmath-prime-util-perl_0.74-1_amd64.buildinfo e305210ed0cd7c7d47148e93b9857c298fb871f7 670020 libmath-prime-util-perl_0.74-1_amd64.deb Checksums-Sha256: e5b64113a2696270593e810cffef0354d29b7b6f1ecc1abf9fd48d9c18322ae4 1469 libmath-prime-util-perl_0.74-1.dsc 58a966ac5deecef92407e31d2c19411ee462f48e8443211d865ff2e6c83cc140 1006501 libmath-prime-util-perl_0.74.orig.tar.gz 539cc8249afab2529b064ec303a49ec7c0a92d0ba489fd10bb3eb4161067268e 7232 libmath-prime-util-perl_0.74-1.debian.tar.xz bc5342fa8631e1d19bd2addf898486ac44b46b359ebe0be30a45a8cc76a5ad35 883204 libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb f58fa7e17df4f40d4f786d2d73c641597970b1ed778903648716d93fd30c9909 5786 libmath-prime-util-perl_0.74-1_amd64.buildinfo c008f0031add6638072eb1eaf005f618c115feb5cc53f79b68c766e9ca1797ed 670020 libmath-prime-util-perl_0.74-1_amd64.deb Files: 1194209d8ca83396a56b5b1ff93295d6 1469 perl optional libmath-prime-util-perl_0.74-1.dsc 17a6a9210f15efe55de147465936f37a 1006501 perl optional libmath-prime-util-perl_0.74.orig.tar.gz acd64b07b1507fbc572baffda6fe16fe 7232 perl optional libmath-prime-util-perl_0.74-1.debian.tar.xz d158cbedfa1c1b1f55f3273400031791 883204 debug optional libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb c596f48f9e3a840fb041418e6404b5a6 5786 perl optional libmath-prime-util-perl_0.74-1_amd64.buildinfo a8a23cc36229f448d0c53ab913b65ef9 670020 perl optional libmath-prime-util-perl_0.74-1_amd64.deb +------------------------------------------------------------------------------+ | Buildinfo Sat, 28 Mar 2026 05:02:37 +0000 | +------------------------------------------------------------------------------+ Format: 1.0 Source: libmath-prime-util-perl Binary: libmath-prime-util-perl libmath-prime-util-perl-dbgsym Architecture: amd64 source Version: 0.74-1 Checksums-Md5: 1194209d8ca83396a56b5b1ff93295d6 1469 libmath-prime-util-perl_0.74-1.dsc d158cbedfa1c1b1f55f3273400031791 883204 libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb a8a23cc36229f448d0c53ab913b65ef9 670020 libmath-prime-util-perl_0.74-1_amd64.deb Checksums-Sha1: 565ae41f5641e3979e5831db09bc6e13cf16eae9 1469 libmath-prime-util-perl_0.74-1.dsc e8ccf80bd168cf663f0541faed2a8933712f52fe 883204 libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb e305210ed0cd7c7d47148e93b9857c298fb871f7 670020 libmath-prime-util-perl_0.74-1_amd64.deb Checksums-Sha256: e5b64113a2696270593e810cffef0354d29b7b6f1ecc1abf9fd48d9c18322ae4 1469 libmath-prime-util-perl_0.74-1.dsc bc5342fa8631e1d19bd2addf898486ac44b46b359ebe0be30a45a8cc76a5ad35 883204 libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb c008f0031add6638072eb1eaf005f618c115feb5cc53f79b68c766e9ca1797ed 670020 libmath-prime-util-perl_0.74-1_amd64.deb Build-Origin: Debian Build-Architecture: amd64 Build-Date: Sat, 28 Mar 2026 05:02:36 +0000 Build-Path: /build/libmath-prime-util-perl-EGLJtV/libmath-prime-util-perl-0.74 Build-Tainted-By: usr-local-has-programs Installed-Build-Depends: autoconf (= 2.72-6), automake (= 1:1.18.1-4), autopoint (= 0.23.2-2), autotools-dev (= 20240727.1), base-files (= 14), base-passwd (= 3.6.8), bash (= 5.3-2), binutils (= 2.46-3), binutils-common (= 2.46-3), binutils-x86-64-linux-gnu (= 2.46-3), bsdextrautils (= 2.41.3-4), build-essential (= 12.12), bzip2 (= 1.0.8-6+b1), coreutils (= 9.10-1), cpp (= 4:15.2.0-5), cpp-13 (= 13.4.0-10), cpp-13-x86-64-linux-gnu (= 13.4.0-10), cpp-15 (= 15.2.0-16), cpp-15-x86-64-linux-gnu (= 15.2.0-16), cpp-x86-64-linux-gnu (= 4:15.2.0-5), dash (= 0.5.12-12), debconf (= 1.5.92), debhelper (= 13.31), debianutils (= 5.23.2), dh-autoreconf (= 22), dh-strip-nondeterminism (= 1.15.0-1), diffutils (= 1:3.12-1), dpkg (= 1.23.7), dpkg-dev (= 1.23.7), dwz (= 0.16-4), file (= 1:5.46-5+b1), findutils (= 4.10.0-3), g++ (= 4:15.2.0-5), g++-15 (= 15.2.0-16), g++-15-x86-64-linux-gnu (= 15.2.0-16), g++-x86-64-linux-gnu (= 4:15.2.0-5), gcc (= 4:15.2.0-5), gcc-13 (= 13.4.0-10), gcc-13-base (= 13.4.0-10), gcc-13-x86-64-linux-gnu (= 13.4.0-10), gcc-15 (= 15.2.0-16), gcc-15-base (= 15.2.0-16), gcc-15-x86-64-linux-gnu (= 15.2.0-16), gcc-16-base (= 16-20260322-1), gcc-x86-64-linux-gnu (= 4:15.2.0-5), gettext (= 0.23.2-2), gettext-base (= 0.23.2-2), grep (= 3.12-1), groff-base (= 1.23.0-10), gzip (= 1.13-1), help2man (= 1.49.3), hostname (= 3.25), init-system-helpers (= 1.69), intltool-debian (= 0.35.0+20060710.6), libacl1 (= 2.3.2-3), libarchive-zip-perl (= 1.68-1), libasan8 (= 16-20260322-1), libatomic1 (= 16-20260322-1), libattr1 (= 1:2.5.2-4), libaudit-common (= 1:4.1.2-1), libaudit1 (= 1:4.1.2-1+b1), libbinutils (= 2.46-3), libblkid1 (= 2.41.3-4), libbz2-1.0 (= 1.0.8-6+b1), libc-bin (= 2.42-14), libc-dev-bin (= 2.42-14), libc-gconv-modules-extra (= 2.42-14), libc6 (= 2.42-14), libc6-dev (= 2.42-14), libcap-ng0 (= 0.9.1-1), libcc1-0 (= 16-20260322-1), libcrypt-dev (= 1:4.5.1-1), libcrypt1 (= 1:4.5.1-1), libctf-nobfd0 (= 2.46-3), libctf0 (= 2.46-3), libdb5.3t64 (= 5.3.28+dfsg2-11), libdebconfclient0 (= 0.282+b2), libdebhelper-perl (= 13.31), libdevel-checklib-perl (= 1.16-1), libdpkg-perl (= 1.23.7), libelf1t64 (= 0.194-4), libfile-stripnondeterminism-perl (= 1.15.0-1), libgcc-13-dev (= 13.4.0-10), libgcc-15-dev (= 15.2.0-16), libgcc-s1 (= 16-20260322-1), libgdbm-compat4t64 (= 1.26-1+b1), libgdbm6t64 (= 1.26-1+b1), libgmp10 (= 2:6.3.0+dfsg-5+b1), libgomp1 (= 16-20260322-1), libgprofng0 (= 2.46-3), libhwasan0 (= 16-20260322-1), libisl23 (= 0.27-2), libitm1 (= 16-20260322-1), libjansson4 (= 2.14-2+b4), liblocale-gettext-perl (= 1.07-8), liblsan0 (= 16-20260322-1), liblzma5 (= 5.8.2-2), libmagic-mgc (= 1:5.46-5+b1), libmagic1t64 (= 1:5.46-5+b1), libmath-prime-util-gmp-perl (= 0.53-1), libmd0 (= 1.1.0-2+b2), libmount1 (= 2.41.3-4), libmpc3 (= 1.3.1-3), libmpfr6 (= 4.2.2-3), libpam-modules (= 1.7.0-5+b1), libpam-modules-bin (= 1.7.0-5+b1), libpam-runtime (= 1.7.0-5), libpam0g (= 1.7.0-5+b1), libpcre2-8-0 (= 10.46-1+b1), libperl-dev (= 5.40.1-7), libperl5.40 (= 5.40.1-7), libpipeline1 (= 1.5.8-2), libquadmath0 (= 16-20260322-1), libseccomp2 (= 2.6.0-2+b1), libselinux1 (= 3.9-4+b1), libsframe3 (= 2.46-3), libsmartcols1 (= 2.41.3-4), libssl3t64 (= 3.6.1-3), libstdc++-15-dev (= 15.2.0-16), libstdc++6 (= 16-20260322-1), libsub-uplevel-perl (= 0.2800-3), libsystemd0 (= 260.1-1), libtest-warn-perl (= 0.37-2), libtinfo6 (= 6.6+20251231-1), libtool (= 2.5.4-9), libtsan2 (= 16-20260322-1), libubsan1 (= 16-20260322-1), libuchardet0 (= 0.0.8-2+b1), libudev1 (= 260.1-1), libunistring5 (= 1.4.2-1), libuuid1 (= 2.41.3-4), libxml2-16 (= 2.15.2+dfsg-0.1), libzstd1 (= 1.5.7+dfsg-3+b1), linux-libc-dev (= 6.19.8-1), m4 (= 1.4.21-1), make (= 4.4.1-3), man-db (= 2.13.1-1), mawk (= 1.3.4.20260302-1), ncurses-base (= 6.6+20251231-1), ncurses-bin (= 6.6+20251231-1), openssl-provider-legacy (= 3.6.1-3), patch (= 2.8-2), perl (= 5.40.1-7), perl-base (= 5.40.1-7), perl-modules-5.40 (= 5.40.1-7), po-debconf (= 1.0.22), rpcsvc-proto (= 1.4.3-1), sed (= 4.9-2), sensible-utils (= 0.0.26), sysvinit-utils (= 3.15-6), tar (= 1.35+dfsg-4), util-linux (= 2.41.3-4), xz-utils (= 5.8.2-2), zlib1g (= 1:1.3.dfsg+really1.3.2-1) Environment: DEB_BUILD_OPTIONS="parallel=2" LANG="C.UTF-8" LANGUAGE="en_GB:en" LC_COLLATE="C.UTF-8" LC_CTYPE="C.UTF-8" LD_LIBRARY_PATH="/usr/lib/libeatmydata" LD_PRELOAD="libeatmydata.so" SOURCE_DATE_EPOCH="1774651061" +------------------------------------------------------------------------------+ | Package contents Sat, 28 Mar 2026 05:02:37 +0000 | +------------------------------------------------------------------------------+ libmath-prime-util-perl-dbgsym_0.74-1_amd64.deb ----------------------------------------------- new Debian package, version 2.0. size 883204 bytes: control archive=544 bytes. 424 bytes, 12 lines control 106 bytes, 1 lines md5sums Package: libmath-prime-util-perl-dbgsym Source: libmath-prime-util-perl Version: 0.74-1 Auto-Built-Package: debug-symbols Architecture: amd64 Maintainer: Debian Perl Group Installed-Size: 906 Depends: libmath-prime-util-perl (= 0.74-1) Section: debug Priority: optional Description: debug symbols for libmath-prime-util-perl Build-Ids: bbc80b79572ec19753ece2527dfdb57a67bd7d52 drwxr-xr-x root/root 0 2026-03-27 22:37 ./ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/debug/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/debug/.build-id/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/debug/.build-id/bb/ -rw-r--r-- root/root 917120 2026-03-27 22:37 ./usr/lib/debug/.build-id/bb/c80b79572ec19753ece2527dfdb57a67bd7d52.debug drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/doc/ lrwxrwxrwx root/root 0 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl-dbgsym -> libmath-prime-util-perl libmath-prime-util-perl_0.74-1_amd64.deb ---------------------------------------- new Debian package, version 2.0. size 670020 bytes: control archive=3148 bytes. 1627 bytes, 30 lines control 7008 bytes, 75 lines md5sums Package: libmath-prime-util-perl Version: 0.74-1 Architecture: amd64 Maintainer: Debian Perl Group Installed-Size: 1909 Depends: perl (>= 5.40.1-7), perlapi-5.40.1, libc6 (>= 2.29), libmath-prime-util-gmp-perl Recommends: libdigest-sha-perl, libmath-bigint-gmp-perl Section: perl Priority: optional Homepage: https://metacpan.org/release/Math-Prime-Util Description: utilities related to prime numbers, including fast sieves and factoring Math::Prime::Util is a set of perl utilities related to prime numbers. These include multiple sieving methods, is_prime, prime_count, nth_prime, approximations and bounds for the prime_count and nth prime, next_prime and prev_prime, factoring utilities, and more. . The default sieving and factoring are intended to be (and currently are) the fastest on CPAN, including Math::Prime::XS, Math::Prime::FastSieve, Math::Factor::XS, Math::Prime::TiedArray, Math::Big::Factors, Math::Factoring, and Math::Primality (when the GMP module is available). For numbers in the 10-20 digit range, it is often orders of magnitude faster. Typically it is faster than Math::Pari for 64-bit operations. . All operations support both Perl UV's (32-bit or 64-bit) and bignums. It requires no external software for big number support, as there are Perl implementations included that solely use Math::BigInt and Math::BigFloat. However, performance will be improved for most big number functions by installing Math::Prime::Util::GMP, and is definitely recommended if you do many bignum operations. Also look into Math::Pari as an alternative. drwxr-xr-x root/root 0 2026-03-27 22:37 ./ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/bin/ -rwxr-xr-x root/root 3243 2026-03-27 22:37 ./usr/bin/factor.pl -rwxr-xr-x root/root 20542 2026-03-27 22:37 ./usr/bin/primes drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/ -rw-r--r-- root/root 302875 2026-03-09 14:19 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util.pm drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ -rw-r--r-- root/root 13547 2026-03-01 17:29 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ChaCha.pm -rw-r--r-- root/root 6298 2026-03-06 07:55 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ECAffinePoint.pm -rw-r--r-- root/root 6559 2026-03-06 07:55 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ECProjectivePoint.pm -rw-r--r-- root/root 5291 2026-03-01 17:28 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/Entropy.pm -rw-r--r-- root/root 2125 2026-03-01 17:28 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/MemFree.pm -rw-r--r-- root/root 380123 2026-03-09 05:03 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PP.pm -rw-r--r-- root/root 33194 2026-03-05 14:04 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PPFE.pm -rw-r--r-- root/root 31919 2026-03-06 07:56 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PrimalityProving.pm -rw-r--r-- root/root 12739 2026-03-01 17:29 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PrimeArray.pm -rw-r--r-- root/root 6855 2026-03-01 17:29 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/PrimeIterator.pm -rw-r--r-- root/root 42036 2026-03-06 07:56 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/RandomPrimes.pm -rw-r--r-- root/root 27519 2026-03-06 07:56 ./usr/lib/x86_64-linux-gnu/perl5/5.40/Math/Prime/Util/ZetaBigFloat.pm drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/auto/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/auto/Math/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/auto/Math/Prime/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/auto/Math/Prime/Util/ -rw-r--r-- root/root 698288 2026-03-27 22:37 ./usr/lib/x86_64-linux-gnu/perl5/5.40/auto/Math/Prime/Util/Util.so -rw-r--r-- root/root 29207 2026-03-09 01:45 ./usr/lib/x86_64-linux-gnu/perl5/5.40/ntheory.pm drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/doc/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/ -rw-r--r-- root/root 696 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/NEWS.Debian.gz -rw-r--r-- root/root 10570 2026-03-13 04:49 ./usr/share/doc/libmath-prime-util-perl/TODO.gz -rw-r--r-- root/root 1059 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/changelog.Debian.gz -rw-r--r-- root/root 29095 2026-03-13 04:50 ./usr/share/doc/libmath-prime-util-perl/changelog.gz -rw-r--r-- root/root 1543 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/copyright drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/ -rw-r--r-- root/root 2151 2016-12-18 07:49 ./usr/share/doc/libmath-prime-util-perl/examples/README -rwxr-xr-x root/root 1098 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/abundant.pl -rw-r--r-- root/root 3665 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/csrand-gmp.pl -rw-r--r-- root/root 3721 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/csrand.pl -rwxr-xr-x root/root 2691 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/fibprime-mce.pl -rwxr-xr-x root/root 1221 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/fibprime-serial.pl -rwxr-xr-x root/root 3309 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/fibprime-threads.pl -rwxr-xr-x root/root 1976 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/find_mr_bases.pl -rw-r--r-- root/root 2589 2026-02-19 12:16 ./usr/share/doc/libmath-prime-util-perl/examples/findomegaseq.c -rw-r--r-- root/root 3227 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/inverse_totient.pl -rwxr-xr-x root/root 2280 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/ktuplet-threads.pl -rw-r--r-- root/root 3102 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/ktuplet.pl -rwxr-xr-x root/root 17075 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/numseqs.pl -rwxr-xr-x root/root 3281 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/porter.pl -rw-r--r-- root/root 140 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_010.pl -rw-r--r-- root/root 221 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_021.pl -rw-r--r-- root/root 434 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_037.pl -rw-r--r-- root/root 339 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_047.pl -rw-r--r-- root/root 531 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_049.pl -rw-r--r-- root/root 394 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_069.pl -rw-r--r-- root/root 472 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_070.pl -rw-r--r-- root/root 146 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_072.pl -rw-r--r-- root/root 1189 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_095.pl -rw-r--r-- root/root 394 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_131.pl -rw-r--r-- root/root 1320 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_142.pl -rw-r--r-- root/root 1762 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_193.pl -rw-r--r-- root/root 369 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_211.pl -rw-r--r-- root/root 366 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_214.pl -rw-r--r-- root/root 2764 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_342.pl -rw-r--r-- root/root 1111 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/project_euler_357.pl -rwxr-xr-x root/root 2800 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/sophie_germain.pl -rwxr-xr-x root/root 3024 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/twin_primes.pl -rwxr-xr-x root/root 18586 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/verify-cert.pl -rwxr-xr-x root/root 1879 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/verify-gmp-ecpp-cert.pl -rwxr-xr-x root/root 4526 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/verify-primegaps.pl -rwxr-xr-x root/root 1691 2026-03-27 22:37 ./usr/share/doc/libmath-prime-util-perl/examples/verify-sage-ecpp-cert.pl drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/lintian/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/lintian/overrides/ -rw-r--r-- root/root 186 2026-03-27 22:37 ./usr/share/lintian/overrides/libmath-prime-util-perl drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/man/ drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/man/man1/ -rw-r--r-- root/root 610 2026-03-27 22:37 ./usr/share/man/man1/factor.pl.1.gz -rw-r--r-- root/root 1238 2026-03-27 22:37 ./usr/share/man/man1/primes.1.gz drwxr-xr-x root/root 0 2026-03-27 22:37 ./usr/share/man/man3/ -rw-r--r-- root/root 91667 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util.3pm.gz -rw-r--r-- root/root 1667 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::ChaCha.3pm.gz -rw-r--r-- root/root 1602 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::ECAffinePoint.3pm.gz -rw-r--r-- root/root 1737 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::ECProjectivePoint.3pm.gz -rw-r--r-- root/root 1313 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::Entropy.3pm.gz -rw-r--r-- root/root 1549 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::MemFree.3pm.gz -rw-r--r-- root/root 2153 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::PP.3pm.gz -rw-r--r-- root/root 1157 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::PPFE.3pm.gz -rw-r--r-- root/root 2008 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::PrimalityProving.3pm.gz -rw-r--r-- root/root 3846 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::PrimeArray.3pm.gz -rw-r--r-- root/root 2388 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::PrimeIterator.3pm.gz -rw-r--r-- root/root 1535 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::RandomPrimes.3pm.gz -rw-r--r-- root/root 2019 2026-03-27 22:37 ./usr/share/man/man3/Math::Prime::Util::ZetaBigFloat.3pm.gz -rw-r--r-- root/root 8119 2026-03-27 22:37 ./usr/share/man/man3/ntheory.3pm.gz +------------------------------------------------------------------------------+ | Post Build Sat, 28 Mar 2026 05:02:37 +0000 | +------------------------------------------------------------------------------+ +------------------------------------------------------------------------------+ | Cleanup Sat, 28 Mar 2026 05:02:37 +0000 | +------------------------------------------------------------------------------+ Purging /build/libmath-prime-util-perl-EGLJtV Not cleaning session: cloned chroot in use +------------------------------------------------------------------------------+ | Summary Sat, 28 Mar 2026 05:02:38 +0000 | +------------------------------------------------------------------------------+ Build Architecture: amd64 Build Type: full Build-Space: 19800 Build-Time: 46 Distribution: sid Host Architecture: amd64 Install-Time: 5 Job: /srv/debomatic/incoming/libmath-prime-util-perl_0.74-1.dsc Machine Architecture: amd64 Package: libmath-prime-util-perl Package-Time: 57 Source-Version: 0.74-1 Space: 19800 Status: successful Version: 0.74-1 -------------------------------------------------------------------------------- Finished at 2026-03-28T05:02:37Z Build needed 00:00:57, 19800k disk space