aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAryadev Chavali <aryadev@aryadevchavali.com>2021-06-26 14:36:10 +0100
committerAryadev Chavali <aryadev@aryadevchavali.com>2021-06-26 14:36:10 +0100
commit644fd5589abe9eac44b2108c654567f8078309ba (patch)
treeac2d33ead43f6f7e551de1e133ea3e3e9686fc31
downloadnumberdisplay-644fd5589abe9eac44b2108c654567f8078309ba.tar.gz
numberdisplay-644fd5589abe9eac44b2108c654567f8078309ba.tar.bz2
numberdisplay-644fd5589abe9eac44b2108c654567f8078309ba.zip
(Init)+README and gitignore
I've already started this project and a good way through it, so these are catch-up git commits.
-rw-r--r--.gitignore3
-rw-r--r--README.org13
2 files changed, 16 insertions, 0 deletions
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..5935a88
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,3 @@
+*.hi
+*.o
+nd
diff --git a/README.org b/README.org
new file mode 100644
index 0000000..f125fd7
--- /dev/null
+++ b/README.org
@@ -0,0 +1,13 @@
+#+title: README
+#+author: Aryadev Chavali
+#+options: toc:nil
+
+A little Haskell program to test my skills/make something genuinely
+useful for myself. This program takes an integer/pair of
+integers/list of integers and, with some flags, lists properties of
+the input. Current features are listed below.
+
+* Features
+- [X] Show whether numbers a prime
+- [X] List factors of a number
+- [X] Get highest common factor of two numbers