{"id":24740381,"url":"https://github.com/derektypist/project-euler-026","last_synced_at":"2026-04-13T18:01:14.086Z","repository":{"id":38367538,"uuid":"506559551","full_name":"derektypist/project-euler-026","owner":"derektypist","description":"Find the value of d\u003cn, for which 1/d contains the longest recurring cycle in its decimal fraction part.","archived":false,"fork":false,"pushed_at":"2022-06-23T11:44:13.000Z","size":21,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-30T02:52:12.435Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://derektypist.github.io/project-euler-026","language":"HTML","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/derektypist.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}},"created_at":"2022-06-23T08:34:49.000Z","updated_at":"2022-06-23T11:44:17.000Z","dependencies_parsed_at":"2022-08-18T18:03:06.419Z","dependency_job_id":null,"html_url":"https://github.com/derektypist/project-euler-026","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/derektypist/project-euler-026","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/derektypist%2Fproject-euler-026","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/derektypist%2Fproject-euler-026/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/derektypist%2Fproject-euler-026/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/derektypist%2Fproject-euler-026/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/derektypist","download_url":"https://codeload.github.com/derektypist/project-euler-026/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/derektypist%2Fproject-euler-026/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31764317,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-13T15:25:13.801Z","status":"ssl_error","status_checked_at":"2026-04-13T15:25:09.162Z","response_time":93,"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":[],"created_at":"2025-01-27T23:23:09.583Z","updated_at":"2026-04-13T18:01:14.070Z","avatar_url":"https://github.com/derektypist.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Project Euler 026 - Reciprocal Cycles\n\nA unit fraction contains 1 in the numerator.  The decimal representation of the unit fractions with denominators 2 to 10 are given:\n\n    1/2  = 0.5\n\n    1/3  = 0.(3)\n\n    1/4  = 0.25\n\n    1/5  = 0.2\n\n    1/6  = 0.1(6)\n\n    1/7  = 0.(142857)\n\n    1/8  = 0.125\n\n    1/9  = 0.(1)\n\n    1/10 = 0.1\n\nWhere 0.1(6) means 0.16666..., and has a 1-digit recurring cycle.  It can be seen that 1/7 has a 6-digit recurring cycle.\n\nThe aim is to find the value of d less than n, for which 1/d contains the longest recurring cycle in its decimal fraction part.\n\nInformation at [Project Euler 026](https://projecteuler.net/problem=26)\n\n## UX\n\n**Getting Started**\n\nEnter a whole number between 7 and 1000 in the input field and click on the Submit Button.  As long as your input is valid, you will see the value of d less than the number, for which 1/d contains the longest recurring cycle in its decimal fraction part.  For example, if you entered 700, you would expect to get 659.  Click on the Reset Button to clear the information or to start again.\n\n**User Stories**\n\nAs a user, I expect to get an error message, if I do any of:\n\n- Not enter anything in the input field\n- Entering text other than a number\n- Entering a number less than 7 or greater than 1000\n- Enering a number, but it is not an integer\n\nAs a user, I expect the function `reciprocalCycles(700)` to return a number.\n\nAs a user, I expect the function `reciprocalCycles(700)` to return 659.\n\nAs a user, I expect the function `reciprocalCycles(800)` to return 743.\n\nAs a user, I expect the function `reciprocalCycles(900)` to return 887.\n\nAs a user, I expect the function `reciprocalCycles(1000)` to return 983.\n\n**Information Architecture**\n\nThe function `reciprocalCycles(n)` returns a number, where `n` is a number between 7 and 1000.\n\n## Features\n\nAllows the user to enter a number as well as getting the value for which 1/d contains the longest recurring cycle in its decimal fraction part.  Performs checks on valid user input.  If the input is not valid, an error message is displayed.\n\n## Technologies\n\nUses HTML5, CSS3, JavaScript, Bootstrap 5.2.0-Beta1 and Google Fonts.\n\n## Testing\n\nEnsure all user stories have been met.\n\n## Deployment\n\nDeployed on [GitHub Pages](https://derektypist.github.io/project-euler-026) at the main branch.\n\n## Credits\n\n### Content\n\nWritten by me.\n\n### Acknowledgements\n\n- [Project Euler](https://projecteuler.net)\n- [FreeCodeCamp](https://www.freecodecamp.org)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fderektypist%2Fproject-euler-026","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fderektypist%2Fproject-euler-026","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fderektypist%2Fproject-euler-026/lists"}