{"id":13735488,"url":"https://github.com/alexcoder04/prime-checker","last_synced_at":"2025-04-03T20:15:44.307Z","repository":{"id":114989040,"uuid":"413522995","full_name":"alexcoder04/prime-checker","owner":"alexcoder04","description":"A simple program to check whether a number is prime on the TI-Nspire","archived":false,"fork":false,"pushed_at":"2023-06-25T09:31:14.000Z","size":7660,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-09T08:23:51.080Z","etag":null,"topics":["calculator","lua","math","nspire","nspired-lua","prime-numbers","primes","ti-nspire","ti-nspire-calculators"],"latest_commit_sha":null,"homepage":"","language":"Lua","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/alexcoder04.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,"governance":null,"roadmap":null,"authors":null}},"created_at":"2021-10-04T17:35:39.000Z","updated_at":"2023-03-25T14:39:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"176f9ddc-68c3-4abb-92a8-f041d0c0f417","html_url":"https://github.com/alexcoder04/prime-checker","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexcoder04%2Fprime-checker","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexcoder04%2Fprime-checker/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexcoder04%2Fprime-checker/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexcoder04%2Fprime-checker/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/alexcoder04","download_url":"https://codeload.github.com/alexcoder04/prime-checker/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247070927,"owners_count":20878586,"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":["calculator","lua","math","nspire","nspired-lua","prime-numbers","primes","ti-nspire","ti-nspire-calculators"],"created_at":"2024-08-03T03:01:07.405Z","updated_at":"2025-04-03T20:15:44.266Z","avatar_url":"https://github.com/alexcoder04.png","language":"Lua","funding_links":[],"categories":["Education"],"sub_categories":["Tools"],"readme":"\n# prime-checker for TI-Nspire\n\nA very simple program to check if a number is prime on the TI-Nspire calculator.\n\n\u003cimg src=\"./assets/screenshot0.jpeg\" style=\"width: 50%;\"\u003e\u003cimg src=\"./assets/screenshot1.jpeg\" style=\"width: 50%;\"\u003e\n\n## Method\n\nJust checking all dividers until the square root, using the simple `6k ± 1`\noptimization method ([wikipedia](https://en.wikipedia.org/wiki/Primality_test#Example_code)).\n\n## Installation\n\n### Relesases page\n\nFor pre-built `.tns`-files, check out the\n[latest release](https://github.com/alexcoder04/prime-checker/releases/latest) and copy the\n`.tns`-file onto your calculator.\n\n### Compiling yourself\n\n#### Requirements\n\n - [Luna](https://github.com/ndless-nspire/Luna)\n - [nspire-merge](https://github.com/alexcoder04/nspire-merge)\n - [GNU Make](https://www.gnu.org/software/make/)\n\n#### Building\n\nRunning `make clean build` in the project directory will create a `prime-checker.tns` file\nwhich can be copied onto the calculator\n\n## Note\n\nDepending on you exact model and settings, you may already have the built-in `isPrime()`-method :)\n\n## Features to be implemented in the future (maybe)\n\n - [ ] factorisation into primes\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falexcoder04%2Fprime-checker","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falexcoder04%2Fprime-checker","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falexcoder04%2Fprime-checker/lists"}