Factors of an integer: Difference between revisions

m
→‎using Prime decomposition: correct Sum of Divs for 2^n, n>=30
m (→‎Raku: .. put back orig. title structure (was meant to be "fixed" in edit summary only, sorry))
m (→‎using Prime decomposition: correct Sum of Divs for 2^n, n>=30)
Line 4,494:
var
dgt:tDigits;
i,j,k,pr,fac,n,MaxP : NativeUIntUint64;
begin
n := pdfOfs;
Line 4,525:
pfpotMax[0] := j;
pfRemain := (n+i) shr j;
pfSumOfDivs := (Uint64(1) shl (j+1))-1;
pfDivCnt := j+1;
end;
Anonymous user