{"id":26193382,"url":"https://github.com/samdney/primescalc","last_synced_at":"2025-10-09T12:38:23.946Z","repository":{"id":217024930,"uuid":"88573868","full_name":"Samdney/primescalc","owner":"Samdney","description":"Paper about prime numbers and how they can be calculated recursively.","archived":false,"fork":false,"pushed_at":"2020-02-22T13:47:39.000Z","size":3456,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-05-02T05:04:44.921Z","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":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Samdney.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2017-04-18T02:46:34.000Z","updated_at":"2022-08-10T08:35:18.000Z","dependencies_parsed_at":"2024-01-14T06:52:03.934Z","dependency_job_id":null,"html_url":"https://github.com/Samdney/primescalc","commit_stats":null,"previous_names":["samdney/primescalc"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samdney%2Fprimescalc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samdney%2Fprimescalc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samdney%2Fprimescalc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samdney%2Fprimescalc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Samdney","download_url":"https://codeload.github.com/Samdney/primescalc/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243141265,"owners_count":20242817,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":"2025-03-12T01:40:20.177Z","updated_at":"2025-10-09T12:38:18.895Z","avatar_url":"https://github.com/Samdney.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# primescalc\nPaper about prime numbers and how they can be calculated recursively.\n\n## About the paper\nThe content of this repository is a draft (working) paper about how prime numbers can be calculated recursively. It's an on-going documentation of my private research work, hence it can contain mistakes or switching of notations, etc..\n\nMain document: [https://github.com/Samdney/primescalc/blob/master/doc/primescalc.pdf](https://github.com/Samdney/primescalc/blob/master/doc/primescalc.pdf)  \nid: notes_0000\n\n## Summary\n### What are prime numbers?\n\u003e \"A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number.\" [Pri]\n\n[Pri] [https://en.wikipedia.org/wiki/Prime_number](https://en.wikipedia.org/wiki/Prime_number) \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamdney%2Fprimescalc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsamdney%2Fprimescalc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamdney%2Fprimescalc/lists"}