{"id":21203019,"url":"https://github.com/jaaumg/piramidefibonnaci","last_synced_at":"2025-10-29T05:18:30.064Z","repository":{"id":109926274,"uuid":"460559677","full_name":"JaaumG/PiramideFibonnaci","owner":"JaaumG","description":"Algorithm problem presented by my professor","archived":false,"fork":false,"pushed_at":"2022-12-24T20:23:21.000Z","size":51,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-15T20:56:03.318Z","etag":null,"topics":["algorithm","c","fibonacci","fibonacci-numbers","fibonacci-sequence"],"latest_commit_sha":null,"homepage":"","language":"C","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/JaaumG.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":"2022-02-17T18:31:14.000Z","updated_at":"2023-08-29T18:01:00.000Z","dependencies_parsed_at":"2023-03-13T14:00:08.245Z","dependency_job_id":null,"html_url":"https://github.com/JaaumG/PiramideFibonnaci","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/JaaumG/PiramideFibonnaci","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JaaumG%2FPiramideFibonnaci","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JaaumG%2FPiramideFibonnaci/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JaaumG%2FPiramideFibonnaci/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JaaumG%2FPiramideFibonnaci/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JaaumG","download_url":"https://codeload.github.com/JaaumG/PiramideFibonnaci/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JaaumG%2FPiramideFibonnaci/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":281563814,"owners_count":26522710,"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","status":"online","status_checked_at":"2025-10-29T02:00:06.901Z","response_time":59,"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":["algorithm","c","fibonacci","fibonacci-numbers","fibonacci-sequence"],"created_at":"2024-11-20T20:20:06.165Z","updated_at":"2025-10-29T05:18:30.045Z","avatar_url":"https://github.com/JaaumG.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n# Piramide Fibonnaci\nIn college  my professor challenge the class to figure out how to print the following text in C:\n\n\u003e 1 \n\u003e\n\u003e 4 6\n\u003e\n\u003e 9 11 13 \n\u003e\n\u003e 17 19 21 23\n\nIt started when i friend of mine send a meme on the group chat: \n\n![thumb_how-are-your-days-going-take-a-break-enjoy-this-72517782](https://user-images.githubusercontent.com/87271192/190916256-3df6e4d6-e475-4de9-94f7-637deac57106.png)\n\n\nAfter this my professor assign the problem for us to resolve.\nAt first look it doenst seen to have a pattern, but i started looking for it anyway, its clear that which row has its relative numbers count,for example, the first row has only one number, the second row has two number, and so on.\nAnd the growth from the left to right its by adding two, four to six increased two, for example, so only its left to find its the pattern of growth from one line to another.\nsearching for it i first tough of Pascal Piramid, only because its shape.\nbut then I noticed the pattern, from one to four increase by **three**, from for four to nine increase by **five**, from nine to seventeen increase by **eight**.\nso its pattern was 3, 5, 8\nand the Fibonnaci sequence was exactly that:\n\n\u003e In mathematics, the  **Fibonacci numbers**, commonly denoted  _Fn_, form a  sequence, the  **Fibonacci sequence**, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2. Starting from 0 and 1, the next few values in the sequence are:\n\u003e \n\u003e0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...\n\nSo i started the code, but i decide to let the user determinate its origin number and quantity of rows.\n\n\n![image](https://user-images.githubusercontent.com/87271192/209450141-16dd771a-cd68-4b0a-a013-f803221b235d.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaaumg%2Fpiramidefibonnaci","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaaumg%2Fpiramidefibonnaci","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaaumg%2Fpiramidefibonnaci/lists"}