{"id":23545555,"url":"https://github.com/bh2smith/numbertheorypython","last_synced_at":"2026-07-22T16:31:54.249Z","repository":{"id":93409688,"uuid":"47216287","full_name":"bh2smith/NumberTheoryPython","owner":"bh2smith","description":"Includes; Sieve of Eratosthenes, Euler-Phi, etc...","archived":false,"fork":false,"pushed_at":"2015-12-01T20:51:45.000Z","size":2,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-09-13T11:04:22.408Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Python","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/bh2smith.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}},"created_at":"2015-12-01T20:44:12.000Z","updated_at":"2017-08-29T08:12:03.000Z","dependencies_parsed_at":"2023-03-25T22:48:37.338Z","dependency_job_id":null,"html_url":"https://github.com/bh2smith/NumberTheoryPython","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bh2smith/NumberTheoryPython","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bh2smith%2FNumberTheoryPython","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bh2smith%2FNumberTheoryPython/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bh2smith%2FNumberTheoryPython/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bh2smith%2FNumberTheoryPython/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bh2smith","download_url":"https://codeload.github.com/bh2smith/NumberTheoryPython/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bh2smith%2FNumberTheoryPython/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35769872,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-07-20T02:08:10.276Z","status":"online","status_checked_at":"2026-07-22T02:00:06.236Z","response_time":124,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":[],"created_at":"2024-12-26T08:18:49.522Z","updated_at":"2026-07-22T16:31:54.227Z","avatar_url":"https://github.com/bh2smith.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Number Theory in Python!\n\n\nThis python file includes \n\nClasses:\n- Sieve of Eratosthenes (up to $10^6$)\n\nFunctions:\n- largestPrimeFactor\n- factors\n- numberOfFactors\n- properDivisors \n- sumDivisors\n- eulerPhi \n- order (of an integer modulo n)\n- inverse (modulo n)\n- lcm and gcd (lowest and greatest common divisors)\n- egcd (similar to gcd but actually perfroms the Euclidean algorithm and returns all information)\n- nCk (For binomial coefficients -- this is not an efficent algorithm)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbh2smith%2Fnumbertheorypython","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbh2smith%2Fnumbertheorypython","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbh2smith%2Fnumbertheorypython/lists"}