Data commit
This commit is contained in:
parent
7387c8f97b
commit
cb5bb5e222
199093 changed files with 3378972 additions and 0 deletions
19
Task/M-bius-function/Zkl/m-bius-function-1.zkl
Normal file
19
Task/M-bius-function/Zkl/m-bius-function-1.zkl
Normal file
|
|
@ -0,0 +1,19 @@
|
|||
fcn mobius(n){
|
||||
pf:=primeFactors(n);
|
||||
sq:=pf.filter1('wrap(f){ (n % (f*f))==0 }); // False if square free
|
||||
if(sq==False){ if(pf.len().isEven) 1 else -1 }
|
||||
else 0
|
||||
}
|
||||
fcn primeFactors(n){ // Return a list of prime factors of n
|
||||
acc:=fcn(n,k,acc,maxD){ // k is 2,3,5,7,9,... not optimum
|
||||
if(n==1 or k>maxD) acc.close();
|
||||
else{
|
||||
q,r:=n.divr(k); // divr-->(quotient,remainder)
|
||||
if(r==0) return(self.fcn(q,k,acc.write(k),q.toFloat().sqrt()));
|
||||
return(self.fcn(n,k+1+k.isOdd,acc,maxD)) # both are tail recursion
|
||||
}
|
||||
}(n,2,Sink(List),n.toFloat().sqrt());
|
||||
m:=acc.reduce('*,1); // mulitply factors
|
||||
if(n!=m) acc.append(n/m); // opps, missed last factor
|
||||
else acc;
|
||||
}
|
||||
3
Task/M-bius-function/Zkl/m-bius-function-2.zkl
Normal file
3
Task/M-bius-function/Zkl/m-bius-function-2.zkl
Normal file
|
|
@ -0,0 +1,3 @@
|
|||
[1..199].apply(mobius)
|
||||
.pump(Console.println, T(Void.Read,19,False),
|
||||
fcn{ vm.arglist.pump(String,"%3d".fmt) });
|
||||
Loading…
Add table
Add a link
Reference in a new issue