{"id":15627847,"url":"https://github.com/perguth/project-euler","last_synced_at":"2026-02-13T00:36:34.524Z","repository":{"id":66834994,"uuid":"110390402","full_name":"perguth/project-euler","owner":"perguth","description":"W/\\w 🔥 Will run on your machine.","archived":false,"fork":false,"pushed_at":"2025-02-28T05:27:15.000Z","size":14,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-22T18:56:40.925Z","etag":null,"topics":["javascript","projecteuler"],"latest_commit_sha":null,"homepage":"https://projecteuler.net/problem=23","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/perguth.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2017-11-12T00:00:48.000Z","updated_at":"2025-02-28T05:27:18.000Z","dependencies_parsed_at":"2025-04-22T18:48:18.923Z","dependency_job_id":"1f2f693c-a67d-4329-b3df-cbc202e961ae","html_url":"https://github.com/perguth/project-euler","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/perguth/project-euler","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/perguth%2Fproject-euler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/perguth%2Fproject-euler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/perguth%2Fproject-euler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/perguth%2Fproject-euler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/perguth","download_url":"https://codeload.github.com/perguth/project-euler/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/perguth%2Fproject-euler/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29389172,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-13T00:02:39.825Z","status":"ssl_error","status_checked_at":"2026-02-13T00:00:20.807Z","response_time":55,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["javascript","projecteuler"],"created_at":"2024-10-03T10:19:49.181Z","updated_at":"2026-02-13T00:36:34.512Z","avatar_url":"https://github.com/perguth.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# project-euler\n\n```math\n\u003chtml\u003e\n\u003cp\u003eA 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.\u003c/p\u003e\n\u003cp\u003eA 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$.\u003c/p\u003e\n\n\u003cp\u003eAs $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.\u003c/p\u003e\n\u003cp\u003eFind the sum of all the positive integers which cannot be written as the sum of two abundant numbers.\u003c/p\u003e\n\u003chtml\u003e\n```\n\n\u003chtml\u003e\n\u003cp\u003eA 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.\u003c/p\u003e\n\u003cp\u003eA 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$.\u003c/p\u003e\n\n```math\n\u003chtml\u003e\n\u003cp\u003eA 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.\u003c/p\u003e\n\u003cp\u003eA 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$.\u003c/p\u003e\n\n\u003cp\u003eAs $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.\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eFind the sum of all the positive integers which cannot be written as the sum of two abundant numbers.\u003c/b\u003e\u003c/p\u003e\n\u003chtml\u003e\n```\n\n\u003cp\u003eAs $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.\u003c/p\u003e\n\n```math\n\u003chtml\u003e\n\u003cp\u003eA 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.\u003c/p\u003e\n\u003cp\u003eA 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$.\u003c/p\u003e\n\n\n\u003cp\u003eAs $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.\u003c/p\u003e\n\u003cp\u003eFind the sum of all the positive integers which cannot be written as the sum of two abundant numbers.\u003c/p\u003e\n\u003chtml\u003e\n```\n\n\u003cp\u003eFind the sum of all the positive integers which cannot be written as the sum of two abundant numbers.\u003c/p\u003e\n\u003chtml\u003e\n\n***\nCopyright of this README.md:\n`Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fperguth%2Fproject-euler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fperguth%2Fproject-euler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fperguth%2Fproject-euler/lists"}