{"id":28042469,"url":"https://github.com/akin-mustapha/prime","last_synced_at":"2026-05-14T20:07:11.496Z","repository":{"id":288883081,"uuid":"314550802","full_name":"akin-mustapha/prime","owner":"akin-mustapha","description":"A prime number library","archived":false,"fork":false,"pushed_at":"2021-01-31T18:20:36.000Z","size":55,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-19T18:01:38.387Z","etag":null,"topics":["ess","haskell","haskell-exercises","haskell-learning","haskell-learning-journal","haskell-library","prime-numbers","programming-language","sieve-of-eratosthe-nes"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/akin-mustapha.png","metadata":{"files":{"readme":"README.md","changelog":"ChangeLog.md","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,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2020-11-20T12:42:14.000Z","updated_at":"2021-01-31T18:20:38.000Z","dependencies_parsed_at":"2025-04-20T07:45:00.456Z","dependency_job_id":"3ac6d74a-845b-428c-a9e1-c06ef63c7ad0","html_url":"https://github.com/akin-mustapha/prime","commit_stats":null,"previous_names":["akin-mustapha/prime"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/akin-mustapha/prime","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akin-mustapha%2Fprime","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akin-mustapha%2Fprime/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akin-mustapha%2Fprime/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akin-mustapha%2Fprime/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/akin-mustapha","download_url":"https://codeload.github.com/akin-mustapha/prime/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akin-mustapha%2Fprime/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33041267,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-13T13:14:54.681Z","status":"online","status_checked_at":"2026-05-14T02:00:06.663Z","response_time":57,"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":["ess","haskell","haskell-exercises","haskell-learning","haskell-learning-journal","haskell-library","prime-numbers","programming-language","sieve-of-eratosthe-nes"],"created_at":"2025-05-11T14:47:50.098Z","updated_at":"2026-05-14T20:07:11.474Z","avatar_url":"https://github.com/akin-mustapha.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# prime\n## Prime is a library that works with prime numbers\n- to check if a number is prime\n- to get the prime factor of a number\n\n### Essential problems\n- Listing out primes less than a specified number\n- Determining whether a given number is prime\n- Breaking a number into its prime factors\n\n### Issues\n- it works with integers within the bound of 10000\n\n### Description\nprime takes an optional command line parameter of \"-f\", which determines the operation type. If \"-f\" then, it prompts you for an input and returns\nit prime factor(s), for any other parameter aside from \"-f\" prime will perform a primality check on user input, returning \"It is prime!\" if test is passed, otherwise \"It is not a prime number\".\n\n### Credit to: Get Programming With Haskell (https://www.manning.com/books/get-programming-with-haskell) by Will Kurt\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakin-mustapha%2Fprime","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fakin-mustapha%2Fprime","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakin-mustapha%2Fprime/lists"}