{"id":16173316,"url":"https://github.com/rija/primefactors-nodejs-lsia-codingdojo","last_synced_at":"2026-01-19T06:33:03.950Z","repository":{"id":66428262,"uuid":"61873304","full_name":"rija/primefactors-nodejs-lsia-codingdojo","owner":"rija","description":"TDD Kata for prime factorisation","archived":false,"fork":false,"pushed_at":"2016-06-24T09:35:39.000Z","size":7,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-07T08:55:12.505Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"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/rija.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":"2016-06-24T09:26:03.000Z","updated_at":"2016-06-26T08:45:20.000Z","dependencies_parsed_at":"2023-03-07T17:00:35.980Z","dependency_job_id":null,"html_url":"https://github.com/rija/primefactors-nodejs-lsia-codingdojo","commit_stats":{"total_commits":16,"total_committers":1,"mean_commits":16.0,"dds":0.0,"last_synced_commit":"b571a13a8fcfc01eaa64e0c0abae7b3dab752556"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rija/primefactors-nodejs-lsia-codingdojo","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rija%2Fprimefactors-nodejs-lsia-codingdojo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rija%2Fprimefactors-nodejs-lsia-codingdojo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rija%2Fprimefactors-nodejs-lsia-codingdojo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rija%2Fprimefactors-nodejs-lsia-codingdojo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rija","download_url":"https://codeload.github.com/rija/primefactors-nodejs-lsia-codingdojo/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rija%2Fprimefactors-nodejs-lsia-codingdojo/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28562405,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-19T03:31:16.861Z","status":"ssl_error","status_checked_at":"2026-01-19T03:31:15.069Z","response_time":67,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: 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":"2024-10-10T04:08:16.873Z","updated_at":"2026-01-19T06:33:03.938Z","avatar_url":"https://github.com/rija.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Prime Factors of Positive Integer Number\n\n\n## Definition\n\nThe prime factorisation of a positive integer is a list of the integer's prime factors, together with their multiplicities.\n\nto shorten prime number factorisations, factors are often expressed in powers (multiplicities).\n\nexample:\n\n```\n360 = 2 x 2 x 2 x 3 x 3 x 5 = 2^3 x 3^2 x 5\n```\nFor a prime factor `p` of `n`, the multiplicity of `p` is the largest exponent `a` for which `p^a` divides n exactly.\n\n## Problem to solve (Part 1)\n\nWrite a program that returns the list of prime factors for all positive integers from 1 to 100.\n\nExample:\n\n```\n1 -\u003e []\n5 -\u003e [5]\n8 -\u003e [2, 2, 2]\n9 -\u003e [3, 3]\n```\n\n### If time allows:\n\nDiscuss the performance of the implementation.\n\n## Problem to solve (Part 2)\n\nsWrite a program that returns the list of prime factors and their multiplicities for all positive integers from 1 to 1000.\nExample:\n\n```\n1 -\u003e []\n5 -\u003e [ [5,1] ]\n8 -\u003e [ [2,3] ]\n9 -\u003e [ [3,2] ]\n360 -\u003e [ [2,3], [3,2] , [5,1] ] \n```\n\n## Running the kata\n\n```\n$ git clone https://github.com/rija/primefactors-nodejs-lsia-codingdojo\n$ cd primefactors-nodejs-lsia-codingdojo\n$ npm install\n$ npm test\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frija%2Fprimefactors-nodejs-lsia-codingdojo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frija%2Fprimefactors-nodejs-lsia-codingdojo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frija%2Fprimefactors-nodejs-lsia-codingdojo/lists"}