Non--Abundant numbers
来源:互联网 发布:北京网络营销软件价格 编辑:程序博客网 时间:2024/05/16 02:24
问题描述:
A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
JS 实现:
(function(){var sumFactor = function(n){var s = 1;for(var i = 2;i < n;i++)if(n%i == 0) {s+=i;//console.log("f: " + i );}return s;};var findAbundant = function(n){var ret = new Array();for(var i = 2; i<=n ; i++){if(sumFactor(i) > i){ret.push(i);}}return ret;};var canBeAdded = function(n){var isPass = false;var nbrs = findAbundant(n);for(var i = 0;i < nbrs.length;i++){for(var j = 0;j < nbrs.length;j++){if(nbrs[i] + nbrs[j] == n) return {num:new Array(nbrs[i],nbrs[j]),ok:true};}}return {num:new Array(),ok:false};}for(var i = 10;i<1500;i++){var r = canBeAdded(i);if(!r.ok) {console.log(i);}else {console.log(i + ": " + r.num);}}})();
- Non--Abundant numbers
- Euler: Non-abundant sums
- Non-abundant sums
- Non-abundant sums
- PE 23 Non-abundant sums
- projecteuler---->problem=23----Non-abundant sums
- Project Euler:Problem 23 Non-abundant sums
- 23 Non-abundant sums - Project Euler
- project euler 23 Non-abundant sums
- 欧拉工程第23题:Non-abundant sums
- 欧拉项目 第23题 Non-abundant sums
- Problem 23 Non-abundant sums (盈数)
- BZOJ2986 Non-Squarefree Numbers
- Non-random numbers
- non-random numbers
- bzoj 2986: Non-Squarefree Numbers
- bzoj 2986 Non-Squarefree Numbers
- SPOJ 16637. Non-Square Free Numbers
- iOS7中的多任务I
- 来自苹果的编程语言——Swift简介
- android之电源锁
- andorid手机电脑操作
- Error Code: 2006 - MySQL 鏈嶅姟鍣ㄥ凡绂荤嚎
- Non--Abundant numbers
- php.ini中的request_order设置
- tolerant programming
- jmockit mock 方法内创建对象的方法调用
- webAPI 支持网页测试 必须是谷歌浏览器
- 对数据分布进行可视化的方法
- ASP之数据库连接
- webAPI 网页测试工具
- structs分页组件