https://github.com/akin-mustapha/prime
A prime number library
https://github.com/akin-mustapha/prime
ess haskell haskell-exercises haskell-learning haskell-learning-journal haskell-library prime-numbers programming-language sieve-of-eratosthe-nes
Last synced: 29 days ago
JSON representation
A prime number library
- Host: GitHub
- URL: https://github.com/akin-mustapha/prime
- Owner: akin-mustapha
- License: bsd-3-clause
- Created: 2020-11-20T12:42:14.000Z (over 5 years ago)
- Default Branch: main
- Last Pushed: 2021-01-31T18:20:36.000Z (over 5 years ago)
- Last Synced: 2025-10-19T18:01:38.387Z (8 months ago)
- Topics: ess, haskell, haskell-exercises, haskell-learning, haskell-learning-journal, haskell-library, prime-numbers, programming-language, sieve-of-eratosthe-nes
- Language: C
- Homepage:
- Size: 53.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: ChangeLog.md
- License: LICENSE
Awesome Lists containing this project
README
# prime
## Prime is a library that works with prime numbers
- to check if a number is prime
- to get the prime factor of a number
### Essential problems
- Listing out primes less than a specified number
- Determining whether a given number is prime
- Breaking a number into its prime factors
### Issues
- it works with integers within the bound of 10000
### Description
prime takes an optional command line parameter of "-f", which determines the operation type. If "-f" then, it prompts you for an input and returns
it prime factor(s), for any other parameter aside from "-f" prime will perform a primality check on user input, returning "It is prime!" if test is passed, otherwise "It is not a prime number".
### Credit to: Get Programming With Haskell (https://www.manning.com/books/get-programming-with-haskell) by Will Kurt