{"id":50414988,"url":"https://github.com/mojotx/collatz-c","last_synced_at":"2026-05-31T05:04:40.461Z","repository":{"id":50487275,"uuid":"519231687","full_name":"mojotx/collatz-c","owner":"mojotx","description":"C code for playing with the mathematical problem, the Collatz Conjecture","archived":false,"fork":false,"pushed_at":"2022-07-29T15:04:18.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-18T04:12:22.635Z","etag":null,"topics":["c","collatz","collatz-algorithm","collatz-conjecture","collatz-problem","collatz-sequences"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mojotx.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-07-29T13:48:35.000Z","updated_at":"2024-04-18T04:12:22.636Z","dependencies_parsed_at":"2022-08-26T13:40:48.554Z","dependency_job_id":null,"html_url":"https://github.com/mojotx/collatz-c","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mojotx/collatz-c","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mojotx%2Fcollatz-c","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mojotx%2Fcollatz-c/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mojotx%2Fcollatz-c/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mojotx%2Fcollatz-c/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mojotx","download_url":"https://codeload.github.com/mojotx/collatz-c/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mojotx%2Fcollatz-c/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33719616,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-05-31T02:00:06.040Z","response_time":95,"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":["c","collatz","collatz-algorithm","collatz-conjecture","collatz-problem","collatz-sequences"],"created_at":"2026-05-31T05:04:40.324Z","updated_at":"2026-05-31T05:04:40.456Z","avatar_url":"https://github.com/mojotx.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Collatz Conjecture\n\n## Overview\n\nFrom Wikipedia: [Collatz Conjecture](https://en.wikipedia.org/wiki/Collatz_conjecture)\n\n\u003e The Collatz conjecture is a famous unsolved mathematical problem. Ihe conjecture\nasks whether repeating two simple arithmetic operations will eventually transform\nevery positive integer into 1. It concerns sequences of integers in which each\nterm is obtained from the previous term as follows: if the previous term is\neven, the next term is one half of the previous term. If the previous term is\nodd, the next term is 3 times the previous term plus 1. The conjecture is that\nthese sequences always reach 1, no matter which positive integer is chosen to\nstart the sequence.\n\u003e\n\u003e It is named after mathematician Lothar Collatz, who introduced the idea in 1937,\ntwo years after receiving his doctorate. It is also known as the 3n + 1 problem,\nthe 3n + 1 conjecture, the Ulam conjecture (after Stanisław Ulam), Kakutani's\nproblem (after Shizuo Kakutani), the Thwaites conjecture (after Sir Bryan\nThwaites), Hasse's algorithm (after Helmut Hasse), or the Syracuse problem.\nThe sequence of numbers involved is sometimes referred to as the hailstone\nsequence, hailstone numbers or hailstone numerals (because the values are\nusually subject to multiple descents and ascents like hailstones in a cloud),\nor as wondrous numbers.\n\nThis is my toy code for playing with the problem, written in C\n\n## Installation\n\nIn progress...\n\n## Example\n\nIn progress...\n\n## License\n\nLicensed under the [MIT License](https://opensource.org/licenses/MIT). If you\nfind this useful or interesting, great!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmojotx%2Fcollatz-c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmojotx%2Fcollatz-c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmojotx%2Fcollatz-c/lists"}