Chowla numbers: Difference between revisions
Content added Content deleted
MaiconSoft (talk | contribs) (Added compatibility for Delphi) |
m (used a bigger font for the definitions.) |
||
| Line 29: | Line 29: | ||
;Definitions: |
;Definitions: |
||
Chowla numbers can also be expressed as: |
Chowla numbers can also be expressed as: |
||
<big> |
|||
chowla(<big>'''n'''</big>) = sum of divisors of <big>'''n'''</big> excluding unity and <big>'''n'''</big> |
chowla(<big>'''n'''</big>) = sum of divisors of <big>'''n'''</big> excluding unity and <big>'''n'''</big> |
||
chowla(<big>'''n'''</big>) = sum( divisors(<big>'''n'''</big>)) <big>'''- 1 - n''' </big> |
chowla(<big>'''n'''</big>) = sum( divisors(<big>'''n'''</big>)) <big>'''- 1 - n''' </big> |
||
| Line 40: | Line 41: | ||
if chowla(<big>'''n'''</big>) = <big>'''0'''</big>, and <big>'''n > 1'''</big>, then <big>'''n'''</big> is prime |
if chowla(<big>'''n'''</big>) = <big>'''0'''</big>, and <big>'''n > 1'''</big>, then <big>'''n'''</big> is prime |
||
if chowla(<big>'''n'''</big>) = <big>'''n - 1'''</big>, and <big>'''n > 1'''</big>, then <big>'''n'''</big> is a perfect number |
if chowla(<big>'''n'''</big>) = <big>'''n - 1'''</big>, and <big>'''n > 1'''</big>, then <big>'''n'''</big> is a perfect number |
||
</big> |
|||
;Task: |
;Task: |
||