{"id":13296143,"url":"https://github.com/llee454/pigeons","last_synced_at":"2025-03-10T08:31:49.786Z","repository":{"id":90935935,"uuid":"145564311","full_name":"llee454/pigeons","owner":"llee454","description":"A proof of the Pigeonhole principle. The Pigeonhole principle is a fundamental theorem that is used widely in Computer Science and Combinatorics, it asserts that if you put n things into m containers, and n \u003e m, then at least one of the containers contains more than one thing.","archived":false,"fork":false,"pushed_at":"2019-02-13T15:26:22.000Z","size":40,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-07-29T17:45:01.633Z","etag":null,"topics":["coq","coq-formalization","mathematics","pigeonhole","proof","theorem-proving","theorems"],"latest_commit_sha":null,"homepage":"","language":"Makefile","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"lgpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/llee454.png","metadata":{"files":{"readme":"Readme.md","changelog":null,"contributing":null,"funding":null,"license":"COPYING.LESSER","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":"2018-08-21T12:57:53.000Z","updated_at":"2023-06-13T15:02:28.000Z","dependencies_parsed_at":"2024-04-28T23:32:10.902Z","dependency_job_id":null,"html_url":"https://github.com/llee454/pigeons","commit_stats":null,"previous_names":[],"tags_count":5,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/llee454%2Fpigeons","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/llee454%2Fpigeons/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/llee454%2Fpigeons/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/llee454%2Fpigeons/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/llee454","download_url":"https://codeload.github.com/llee454/pigeons/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242819242,"owners_count":20190400,"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":["coq","coq-formalization","mathematics","pigeonhole","proof","theorem-proving","theorems"],"created_at":"2024-07-29T17:18:33.513Z","updated_at":"2025-03-10T08:31:49.773Z","avatar_url":"https://github.com/llee454.png","language":"Makefile","readme":"Pigeons Readme\n==============\n\nA proof of the [Pigeonhole principle](https://en.wikipedia.org/wiki/Pigeonhole_principle). The Pigeonhole principle\nis a fundamental theorem that is used widely in Computer Science and\nCombinatorics, it asserts that if you put n things into m containers,\nand n \u003e m, then at least one of the containers contains more than\none thing.\n\nAuthors\n-------\n\nLarry Darryl Lee Jr. \u003cllee454@gmail.com\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fllee454%2Fpigeons","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fllee454%2Fpigeons","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fllee454%2Fpigeons/lists"}