{"id":23661268,"url":"https://github.com/chrisdalvit/zeckendorf-theorem","last_synced_at":"2026-01-26T17:34:41.765Z","repository":{"id":171380100,"uuid":"635388392","full_name":"chrisdalvit/zeckendorf-theorem","owner":"chrisdalvit","description":"A formal proof of the Zeckendorf theorem in Isabelle/HOL","archived":false,"fork":false,"pushed_at":"2023-06-15T16:03:34.000Z","size":28692,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-07T13:19:24.276Z","etag":null,"topics":["fibonacci-numbers","fibonacci-sequence","formal-verification","isabelle","isabelle-hol","number-theory","theorem-proving","theoretical-computer-science"],"latest_commit_sha":null,"homepage":"https://www.isa-afp.org/entries/Zeckendorf.html","language":"TeX","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/chrisdalvit.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}},"created_at":"2023-05-02T15:31:40.000Z","updated_at":"2023-10-06T16:55:25.000Z","dependencies_parsed_at":null,"dependency_job_id":"d6bb1af5-9d50-43f6-b7d2-1445c355617f","html_url":"https://github.com/chrisdalvit/zeckendorf-theorem","commit_stats":null,"previous_names":["chrisdalvit/zeckendorf-theorem"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/chrisdalvit/zeckendorf-theorem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrisdalvit%2Fzeckendorf-theorem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrisdalvit%2Fzeckendorf-theorem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrisdalvit%2Fzeckendorf-theorem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrisdalvit%2Fzeckendorf-theorem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chrisdalvit","download_url":"https://codeload.github.com/chrisdalvit/zeckendorf-theorem/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrisdalvit%2Fzeckendorf-theorem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28782996,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-26T13:55:28.044Z","status":"ssl_error","status_checked_at":"2026-01-26T13:55:26.068Z","response_time":59,"last_error":"SSL_read: 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":["fibonacci-numbers","fibonacci-sequence","formal-verification","isabelle","isabelle-hol","number-theory","theorem-proving","theoretical-computer-science"],"created_at":"2024-12-29T04:56:44.643Z","updated_at":"2026-01-26T17:34:41.760Z","avatar_url":"https://github.com/chrisdalvit.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Zeckendorf's Theorem\n\nThis work formalizes Zeckendorf's theorem in Isabelle/HOL. The theorem states that every positive integer can be uniquely represented as a sum of one or more non-consecutive Fibonacci numbers. More precisely, if \n$N$ is a positive integer, there exist unique positive integers $c_i \\ge 2$ with $c_i + 1 \u003c c_{i+1}$, such that\n$$N = \\sum_{i=0}^{k} F_{c_i}$$\nwhere $F_n$ is the $n$-th Fibonacci number.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchrisdalvit%2Fzeckendorf-theorem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchrisdalvit%2Fzeckendorf-theorem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchrisdalvit%2Fzeckendorf-theorem/lists"}