Abundant odd numbers: Difference between revisions
Content added Content deleted
Alextretyak (talk | contribs) (Added 11l) |
|||
| Line 25: | Line 25: | ||
:* American Journal of Mathematics, Vol. 35, No. 4 (Oct., 1913), pp. 413-422 - Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors (LE Dickson) |
:* American Journal of Mathematics, Vol. 35, No. 4 (Oct., 1913), pp. 413-422 - Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors (LE Dickson) |
||
<br><br> |
<br><br> |
||
=={{header|11l}}== |
|||
{{trans|Python}} |
|||
<lang 11l>V oddNumber = 1 |
|||
V aCount = 0 |
|||
V dSum = 0 |
|||
F divisorSum(n) |
|||
V sum = 1 |
|||
V i = Int(sqrt(n) + 1) |
|||
L(d) 2 .< i |
|||
I n % d == 0 |
|||
sum += d |
|||
V otherD = n I/ d |
|||
I otherD != d |
|||
sum += otherD |
|||
R sum |
|||
print(‘The first 25 abundant odd numbers:’) |
|||
L aCount < 25 |
|||
dSum = divisorSum(oddNumber) |
|||
I dSum > oddNumber |
|||
aCount++ |
|||
print(‘#5 proper divisor sum: #.’.format(oddNumber, dSum)) |
|||
oddNumber += 2 |
|||
L aCount < 1000 |
|||
dSum = divisorSum(oddNumber) |
|||
I dSum > oddNumber |
|||
aCount++ |
|||
oddNumber += 2 |
|||
print("\n1000th abundant odd number:") |
|||
print(‘ ’(oddNumber - 2)‘ proper divisor sum: ’dSum) |
|||
oddNumber = 1000000001 |
|||
V found = 0B |
|||
L !found |
|||
dSum = divisorSum(oddNumber) |
|||
I dSum > oddNumber |
|||
found = 1B |
|||
print("\nFirst abundant odd number > 1 000 000 000:") |
|||
print(‘ ’oddNumber‘ proper divisor sum: ’dSum) |
|||
oddNumber += 2</lang> |
|||
{{out}} |
|||
<pre> |
|||
The first 25 abundant odd numbers: |
|||
945 proper divisor sum: 975 |
|||
1575 proper divisor sum: 1649 |
|||
2205 proper divisor sum: 2241 |
|||
2835 proper divisor sum: 2973 |
|||
3465 proper divisor sum: 4023 |
|||
4095 proper divisor sum: 4641 |
|||
4725 proper divisor sum: 5195 |
|||
5355 proper divisor sum: 5877 |
|||
5775 proper divisor sum: 6129 |
|||
5985 proper divisor sum: 6495 |
|||
6435 proper divisor sum: 6669 |
|||
6615 proper divisor sum: 7065 |
|||
6825 proper divisor sum: 7063 |
|||
7245 proper divisor sum: 7731 |
|||
7425 proper divisor sum: 7455 |
|||
7875 proper divisor sum: 8349 |
|||
8085 proper divisor sum: 8331 |
|||
8415 proper divisor sum: 8433 |
|||
8505 proper divisor sum: 8967 |
|||
8925 proper divisor sum: 8931 |
|||
9135 proper divisor sum: 9585 |
|||
9555 proper divisor sum: 9597 |
|||
9765 proper divisor sum: 10203 |
|||
10395 proper divisor sum: 12645 |
|||
11025 proper divisor sum: 11946 |
|||
1000th abundant odd number: |
|||
492975 proper divisor sum: 519361 |
|||
First abundant odd number > 1 000 000 000: |
|||
1000000575 proper divisor sum: 1083561009 |
|||
</pre> |
|||
=={{header|360 Assembly}}== |
=={{header|360 Assembly}}== |
||
| Line 142: | Line 223: | ||
0 - number= 1000000575 sigma= 1083561009 |
0 - number= 1000000575 sigma= 1083561009 |
||
</pre> |
</pre> |
||
=={{header|AArch64 Assembly}}== |
=={{header|AArch64 Assembly}}== |
||
{{works with|as|Raspberry Pi 3B version Buster 64 bits <br> or android 64 bits with application Termux }} |
{{works with|as|Raspberry Pi 3B version Buster 64 bits <br> or android 64 bits with application Termux }} |
||