Skip to content

perguth/project-euler

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
.gitignore
.gitignore
 
 
23.js
23.js
 
 
README.md
README.md
 
 

Repository files navigation

project-euler

$$<html> <p>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.</p> <p>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\$.</p> <p>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.</p> <p>Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.</p> <html>$$

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$.

$$<html> <p>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.</p> <p>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\$.</p> <p>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.</p> <p><b>Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.</b></p> <html>$$

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.

$$<html> <p>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.</p> <p>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\$.</p> <p>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.</p> <p>Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.</p> <html>$$

Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

Copyright of this README.md: Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)

About

W/\w 🔥 Will run on your machine.

projecteuler.net/problem=23

Topics

javascript projecteuler

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages