- The Modern C# Challenge
- Rod Stephens
- 52字
- 2021-08-13 15:23:54
18. Perfect numbers
A perfect number equals the sum of its divisors. Basically, a perfect number is amicable with itself. For example, the divisors of 6 are 1, 2, and 3, and 6 = 1 + 2 + 3.
Write a program that finds perfect numbers between 1 and a specified maximum.
推薦閱讀
- 數(shù)學(xué)不簡單：從《最強(qiáng)大腦》發(fā)現(xiàn)思維樂趣
- 數(shù)學(xué)女孩2：費(fèi)馬大定理
- 圖解博弈論
- 這才是好看的數(shù)學(xué)
- Blockchain Quick Reference
- 開悟：數(shù)學(xué)黑客的生活之旅
- 我的第一本趣味數(shù)學(xué)書2
- 走近費(fèi)曼叢書：費(fèi)曼講物理：相對論
- 文化偉人代表作圖釋書系：算術(shù)研究
- 數(shù)理邏輯
- MATLAB矩陣分析和計(jì)算
- 中國數(shù)學(xué)雙基教學(xué)的史與思
- Mastering Ethereum
- 2頁紙圖解數(shù)學(xué)：以極聰明的方式，讓你三步讀懂?dāng)?shù)學(xué)
- 基于變分法的細(xì)胞演化建模