first init

Author: Zeyu-Li

.gitignore

@@ -0,0 +1,126 @@
+.jpeg
+.png
+.jpg
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+pip-wheel-metadata/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+.hypothesis/
+.pytest_cache/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+.python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don’t work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# celery beat schedule file
+celerybeat-schedule
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/

LICENSE.txt

@@ -0,0 +1,21 @@
+Copyright (c) 2019 Andrew Li
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+Do not copy for your homework or labwork!!

README.md

@@ -0,0 +1,38 @@
+# Quick Algorithms or Formulas
+
+## About
+
+This is a collection of algorithms and formulas written in different programing languages
+
+
+
+## How to Use
+
+For MacOS or Linux:
+
+```shell
+python3 name_of_program.py
+```
+
+For Windows:
+
+```powershell
+py name_of_program.py
+```
+
+
+
+## Licence
+
+The rules for copy and distributing this project licence are 
+outlined in the licence.txt file.
+
+This project is under an MIT licence 
+
+
+
+## Included:
+
+* gcd - greatest common divisor
+
+* lcd - lowest common denominator

python/gcd.py

@@ -0,0 +1,9 @@
+""""
+gcd (greatest common divisor) by Andrew Li
+"""
+
+
+def gcd(int1, int2):
+    if int2 == 0:
+        return int(int1)
+    return gcd(int1, int1 % int2)

python/lcd.py

@@ -0,0 +1,10 @@
+""""
+lcd (lowest common denominator) by Andrew Li
+"""
+from gcd import gcd
+
+def lcd(gcd, int1, int2):
+    return int((int1*int2)/gcd)
+
+def lcd_no_gcd(int1, int2):
+    return int((int1*int2)/gcd(int1,int2))

typescript/is_prime.ts

@@ -0,0 +1,40 @@
+// chose any number
+let number: number = 146192364271;
+
+// let number: any = process.openStdin();
+
+function isPrime(number) {
+    // is the number prime
+
+    // if 1, 0, or negative return an error
+    if (number <= 1) {
+        return 'The number cannot be below or equal to 1';
+    } else {
+        // if less than prime, it is prime, otherwise, 
+        // check if it is even, ends in 5 or divisible by 3 it is not prime
+        if (number <= 5 && number != 4) {
+            return 'prime';
+        } else if (number % 10 % 2 === 0 ||  number % 10 === 5) {
+            return 'not prime';
+        } else if (number % 3 === 0) {
+            return 'not prime';
+        } else {
+            // for i starting at 7 and incrementing a 2
+            for (let i: number = 7; i >= number ** .5; i+=2) {
+                // if multiple of 3, continue otherwise 
+                // if it is module the index, it is not prime
+                if (i % 10 % 3 === 0) {
+                    continue;
+                } else if (number % i === 0) {
+                    return 'not prime';
+                }
+            }
+
+            // if not flag, it is prime
+            return 'prime';
+        }
+    }
+}
+
+// calls is prime
+console.log(isPrime(number));