This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.38
in repository libmath-prime-util-perl.
commit a011aa1b4bd6e70e8b4bbd9115f4076d92282bc7
Author: Dana Jacobsen <d...@acm.org>
Date: Wed Jan 29 17:27:04 2014 -0800
Add todo about perfect power. Going to change name.
---
TODO | 4 ++++
lib/Math/Prime/Util.pm | 5 +++++
2 files changed, 9 insertions(+)
diff --git a/TODO b/TODO
index 904b6ca..31f4abc 100644
--- a/TODO
+++ b/TODO
@@ -74,3 +74,7 @@
- Ensure a fast path for Math::GMP from MPU -> MPU:GMP -> GMP, and back.
- znlog better implementation
+
+- consider following Pari and doing is_power($n) / is_power($n, $k) instead
+ of the three: is_perfect_power, is_perfect_square, is_perfect_cube.
+ Document power. Tests for power.
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index bd59e85..e994007 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -1761,6 +1761,11 @@ Brent, 2010: "AKS is not a practical algorithm. ECPP
is much faster."
We have ECPP, and indeed it is much faster.
+=head2 is_perfect_power
+
+Given a positive integer input n, returns 1 if C<n = p^k> for C<k E<gt> 1>.
+
+
=head2 lucas_sequence
my($U, $V, $Qk) = lucas_sequence($n, $P, $Q, $k)
--
Alioth's /usr/local/bin/git-commit-notice on
/srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git
_______________________________________________
Pkg-perl-cvs-commits mailing list
Pkg-perl-cvs-commits@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits
