feat: adds Martha's prime number checker (#184)

* feat: define criteria for coding assignment

* feat: adds Tyrans quiz to the quizzes folder with correct bcrypt hashing (#105)

* feat: adds lesson_03 trinitiejackson quiz (#108)

* trinitie_jackson_quiz

* change closed to void

* change tag to element

* change question and answers

* add anthony_mays_quiz back

* edit spacing

---------

Co-authored-by: Trinitie Jackson <[email protected]>

* feat: adds Benjamin's completed lesson 03 hw (#107)

* feat: adds Danielson Adjocy's lesson_03 quiz (#111)

* Added files

* update

* update

* update

* update

* update

* update

* update

* ”update”

* finished README

* fix:fixing chhange requests

* feat: add work email

* feat: added test and passing

* chore:updating

* Update quiz.yaml

* Update quiz.yaml

* revert: reverted another_quiz.ts

* Update quiz.yaml

* fix: quizzes.module.ts

---------

Co-authored-by: Danielson Adjocy <[email protected]>

* feat: adds lesson_05 quiz (#151)

Signed-off-by: Anthony D. Mays <[email protected]>

* feat: added quiz check (#170)

Signed-off-by: Anthony D. Mays <[email protected]>

* feat: adds lesson_05 homework and lesson_06 pre-work (#171)

Signed-off-by: Anthony D. Mays <[email protected]>

* docs: fix bug with assignment details (#179)

Signed-off-by: Anthony D. Mays <[email protected]>

* feat: add criteria doc to martha's lesson 04 homework file

* feat: create python code file

* chore: update doc name to README

* feat: add python prime checking function to file

* feat: create JavaScript code file

* chore: adds semicolons to clean up formatting

* feat: add writeup for Martha's lesson_04 homework

---------

Signed-off-by: Anthony D. Mays <[email protected]>
Co-authored-by: Tyran Rice Jr. <[email protected]>
Co-authored-by: txjackson252 <[email protected]>
Co-authored-by: Trinitie Jackson <[email protected]>
Co-authored-by: bscott519 <[email protected]>
Co-authored-by: Danielson A. <[email protected]>
Co-authored-by: Danielson Adjocy <[email protected]>
Co-authored-by: Anthony D. Mays <[email protected]>

Author: 8 people

lesson_04/marthao/README.md

@@ -0,0 +1,22 @@
+## Explanation
+
+The languages used for the assignment are Python and JavaScript. In order to determine whether or not a number is prime, the functions used for both the Python implementation and the JavaScript implementation needed to meet the following criteria:
+
+- If the number is less than 2, it is not prime.
+- If the number is 2, it is prime.
+- If the number can be evenly divided by 2 (i.e. the remainder of the division of the number by 2 equals 0), it is not prime.
+- If the number is greater than 2 and can be evenly divided by any number from 2 up to the square root of the number, it is not prime.
+- If the number can NOT be evenly divided by any number from 2 up to the square root of the number, it is prime.
+
+### Other Similarities
+- In both Python and JavaScript, `i` is used to represent the numbers being tested as divisors. 
+
+### Differences
+- #### Syntax:
+    - In Python, the function is defined using the `def` keyword, while the `function` keyword is used in JavaScript.
+    - In Python, the `==` is used as the equality operator, while `===` is used as the equality operator in JavaScript. 
+    - In Python the `True` and `False` are used for boolean values, while JavaScript uses `true` and `false`.
+    - In Python the equation for square root is represented by `n**0.5`, while Python represents it by `Math.sqrt(n)`.
+
+
+

lesson_04/marthao/javascriptcode.js

@@ -0,0 +1,17 @@
+function checkIfPrime(n) {
+    if (n < 2) {
+        return false;
+    } 
+    if (n === 2) {
+        return true;
+    } 
+    if (n % 2 === 0) {
+        return false;
+    }
+    for (let i=3; i <=Math.sqrt(n) + 1; i = i + 2) {
+        if (n % i === 0) {
+            return false;
+        }
+    }
+    return true;
+}

lesson_04/marthao/pythoncode.py

@@ -0,0 +1,15 @@
+def is_prime(n):
+    if n < 2:
+        return False
+
+    if n == 2:
+        return True
+
+    if n % 2 == 0:
+        return False
+
+    for i in range(3, int(n**0.5) + 1, 2):
+        if n % i == 0:
+            return False
+
+    return True