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 66ebfeb557ad942614e70bd86d9c87cb5b18f90b Author: Dana Jacobsen <d...@acm.org> Date: Wed Feb 19 11:42:30 2014 -0800 Spelling error: Dedekind --- lib/Math/Prime/Util.pm | 2 +- t/19-moebius.t | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm index 69fe772..e0b3bc7 100644 --- a/lib/Math/Prime/Util.pm +++ b/lib/Math/Prime/Util.pm @@ -1890,7 +1890,7 @@ is a generalization of Euler's totient, where This counts the number of k-tuples less than or equal to n that form a coprime tuple with n. As with C<euler_phi>, 0 is returned for all C<n E<lt> 1>. This function can be used to generate some other useful functions, such as -the Dedikind psi function, where C<psi(n) = J(2,n) / J(1,n)>. +the Dedekind psi function, where C<psi(n) = J(2,n) / J(1,n)>. =head2 exp_mangoldt diff --git a/t/19-moebius.t b/t/19-moebius.t index eaf8975..dc086e4 100644 --- a/t/19-moebius.t +++ b/t/19-moebius.t @@ -456,8 +456,8 @@ while (my($k, $tref) = each (%jordan_totients)) { push @psi_viaj, int(jordan_totient(2, $n) / jordan_totient(1, $n)); push @psi_viamobius, int($n * divisor_sum( $n, sub { moebius($_[0])**2 / $_[0] } ) + 0.5); } - is_deeply( \@psi_viaj, \@A001615, "Dedikind psi(n) = J_2(n)/J_1(n)" ); - is_deeply( \@psi_viamobius, \@A001615, "Dedikind psi(n) = divisor_sum(n, moebius(d)^2 / d)" ); + is_deeply( \@psi_viaj, \@A001615, "Dedekind psi(n) = J_2(n)/J_1(n)" ); + is_deeply( \@psi_viamobius, \@A001615, "Dedekind psi(n) = divisor_sum(n, moebius(d)^2 / d)" ); } { -- 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