modified: Math/partial_sums_of_powerfree_numbers.sf

trizen · trizen · commit 887fad091537 · 2021-08-21T12:01:45.000+03:00
diff --git a/Math/partial_sums_of_powerfree_numbers.sf b/Math/partial_sums_of_powerfree_numbers.sf
@@ -11,7 +11,7 @@
 
 func powerfree_sum(n, k=2) {
     var sum = 0
-    n.isqrt.each_squarefree {|v|
+    n.iroot(k).each_squarefree {|v|
         sum += (moebius(v) * v**k * faulhaber(idiv(n, v**k), 1))
     }
     return sum
diff --git a/Math/partial_sums_of_powerfree_part.sf b/Math/partial_sums_of_powerfree_part.sf
@@ -10,7 +10,6 @@
 #   https://oeis.org/A007913 -- Squarefree part of n: a(n) is the smallest positive number m such that n/m is a square.
 #   https://oeis.org/A050985 -- Cubefree part of n.
 #   https://oeis.org/A069891 -- a(n) = Sum_{k=1..n} A007913(k), the squarefree part of k.
-#
 
 func f(n, r) {
     n.factor_prod {|p|

Original file line number	Diff line number	Diff line change
`@@ -11,7 +11,7 @@`
`11`	`11`
`12`	`12`	`func powerfree_sum(n, k=2) {`
`13`	`13`	`var sum = 0`
`14`		`- n.isqrt.each_squarefree {\|v\|`
	`14`	`+ n.iroot(k).each_squarefree {\|v\|`
`15`	`15`	`sum += (moebius(v) * v*k faulhaber(idiv(n, v**k), 1))`
`16`	`16`	`}`
`17`	`17`	`return sum`