Rosetta Code

Amicable pairs: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Trizen (talk | contribs)
2,756 edits
m →‎{{header|Sidef}}: updated code for Sidef 3.70
Trizen (talk | contribs)
2,756 edits
→‎{{header|Sidef}}: simplification: use the sigma function
Line 3,800:
 
=={{header|Sidef}}==
<lang ruby>func propdivsum(xn) {▼
{{trans|Perl 6}}
n.sigma - n
▲<lang ruby>func propdivsum(x) {
gather {
for d in (2 .. x.isqrt) {
if (d.divides(x)) {
take(d, x/d)
}
}
}.uniq.sum + (x > 1 ? 1 : 0)
}
 
for i in (1..20000) {
var j = propdivsum(i)
say "#{i} #{j}" if (j>i && i==propdivsum(j))
Retrieved from "https://rosettacode.org/wiki/Amicable_pairs"