{"action":"opened","issue":{"url":"https://api.github.com/repos/numworks/epsilon/issues/709","repository_url":"https://api.github.com/repos/numworks/epsilon","labels_url":"https://api.github.com/repos/numworks/epsilon/issues/709/labels{/name}","comments_url":"https://api.github.com/repos/numworks/epsilon/issues/709/comments","events_url":"https://api.github.com/repos/numworks/epsilon/issues/709/events","html_url":"https://github.com/numworks/epsilon/issues/709","id":367421041,"node_id":"MDU6SXNzdWUzNjc0MjEwNDE=","number":709,"title":"[Python] Request for an iterative version of factorial","user":{"login":"AlainBusser","id":3930757,"node_id":"MDQ6VXNlcjM5MzA3NTc=","avatar_url":"https://avatars0.githubusercontent.com/u/3930757?v=4","gravatar_id":"","url":"https://api.github.com/users/AlainBusser","html_url":"https://github.com/AlainBusser","followers_url":"https://api.github.com/users/AlainBusser/followers","following_url":"https://api.github.com/users/AlainBusser/following{/other_user}","gists_url":"https://api.github.com/users/AlainBusser/gists{/gist_id}","starred_url":"https://api.github.com/users/AlainBusser/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/AlainBusser/subscriptions","organizations_url":"https://api.github.com/users/AlainBusser/orgs","repos_url":"https://api.github.com/users/AlainBusser/repos","events_url":"https://api.github.com/users/AlainBusser/events{/privacy}","received_events_url":"https://api.github.com/users/AlainBusser/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-10-06T04:03:14Z","updated_at":"2018-10-06T04:03:14Z","closed_at":null,"author_association":"NONE","body":"Right now, trying to compute a factorial in Python yields an error when the number is more than 9. This is a good example of the limitations of the recursion but yield to comments like «the Numworks is not even able to compute factorial(10) like the other calculators». So why not propose instead an iterative version, which would works without showing the limitations of micropython? Something like\r\n\r\n     def factorial(n):\r\n\r\n        p = 1\r\n\r\n        for k in range(1,n+1):\r\n\r\n            p *= k\r\n\r\n        return p\r\n    "}}
{"actor":{"display_login":"AlainBusser"}}