Jump to content

Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions

Sequence: smallest number greater than previous term with exactly n divisors (view source)

Revision as of 16:14, 16 July 2020

No change in size ,  3 years ago
m
→‎{{header|Haskell}}
Line 306:
countDivisors n = foldr f 0 [1..floor (sqrt $ realToFrac n)]
where
f dx r | n `mod` dx == 0 = let y = n `div` dx in if dx == y then r+1 else r+2
| otherwise = r
go t ((n,dc):xs) | dc == t = (t,n):go (succ t) xs
| otherwise = go t xs
 
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/289476"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information