{"id":16814667,"url":"https://github.com/findus23/mathe_python","last_synced_at":"2025-03-17T12:42:44.665Z","repository":{"id":19336867,"uuid":"22575748","full_name":"Findus23/mathe_python","owner":"Findus23","description":"verschiedene mathematische Berechnungen mit Python","archived":false,"fork":false,"pushed_at":"2014-08-09T12:32:55.000Z","size":168,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-23T22:24:54.007Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/Findus23.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-08-03T13:49:47.000Z","updated_at":"2014-08-03T13:52:27.000Z","dependencies_parsed_at":"2022-09-11T16:01:18.859Z","dependency_job_id":null,"html_url":"https://github.com/Findus23/mathe_python","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Findus23%2Fmathe_python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Findus23%2Fmathe_python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Findus23%2Fmathe_python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Findus23%2Fmathe_python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Findus23","download_url":"https://codeload.github.com/Findus23/mathe_python/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244036794,"owners_count":20387580,"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":[],"created_at":"2024-10-13T10:30:04.044Z","updated_at":"2025-03-17T12:42:44.644Z","avatar_url":"https://github.com/Findus23.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Mathematik mit Python\n============\n\nEinsen\n------------\n\nDieses Programm löst Aufgabe 17 aus dem [Google Lab Aptitute Test](http://googleblog.blogspot.co.at/2004/09/pencils-down-people.html): ([Link zum Bild](http://4.bp.blogspot.com/_Ap14FtNN91w/Rll5xV8Px1I/AAAAAAAAAHw/qSjyk8HXYsk/s1600/GLAT_4.jpg))\n\n\u003eConsider a function which, for a given whole number n, returns the number of ones required when writing out all numbers \u003ebetween 0 and n.  For example, f(13)=6.  Notice that f(1)=1.  What is the next largest n such that f(n)=n?\n\nDie richtige Lösung findet man auch in der *[On-Line Encyclopedia of Integer Sequences](https://oeis.org/A014778)*.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffindus23%2Fmathe_python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffindus23%2Fmathe_python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffindus23%2Fmathe_python/lists"}