fixed my code to be any number

Author: Dasiame

lesson_04/dasiaenglish/lesson_04.md

@@ -1,10 +1,20 @@
-## Javascript
-```javascript
-function findPrimes() { // A machine that helps find prime numbers
-    let primeNumbers = [];  // Use 'let' and an empty array for prime numbers
+```Javascript
+#Javascript
+
+const readline = require(`readline`);
+
+const rl =readline.createInterface({
+    input: process.stdin,
+    output: process.stdout
+});
+
+function findPrimes(numberToCheck) { // A machine that helps find prime numbers
+
+    if (numberToCheck <=1){
+        return `${numberToCheck} is not a prime number.`; //any number that is less or equal to 1 it is NOT a prime number
+    }
+    let isPrime = true; //I am start with assuming the number is prime 
 
-    for (let numberToCheck = 2; numberToCheck <= 100; numberToCheck++) { // Here is a loop that starts at 2 and keeps going until 100
-        let isPrime = true; //I am starting this out with assuming the number is true 
 
         for (let factor = 2; factor <= Math.floor(numberToCheck / 2); factor++) { //this is another loop but it checks to see if the number is divisible by other numbers.
             if (numberToCheck % factor === 0) { // this is checking to see if the number can divide evenly and if so then it is not a prime number
@@ -14,43 +24,48 @@ function findPrimes() { // A machine that helps find prime numbers
         }
 
         if (isPrime) { //if said number is still true that means that we did not find any number that is divided evenly so it is prime
-            primeNumbers.push(numberToCheck);  // Push primes into the array box above []
-        } 
-      }  //closing the loop from 2 to 100
+            return `${numberToCheck} is a prime number.`; //if the numbe is prime it will say^^
+        } else{
+            return `${numberToCheck} is not a prime number.`; // if it is NOT prime it will say so
+        }
+} //closing the loop of if it is a prime number or not 
 
+rl.question(`Enter a number to check if it\'s prime:`, (input)=>{
+    let number = parseInt(input);
 
-    //Output the prime numbers
-    console.log("Prime numbers from 1 to 100 are:"); // telling the comuter to print it out what is in " "
-    console.log(primeNumbers.join(", ")); // show the prime numbers that we found
-} //will fill in all the numbers that are prime
+    if (isNaN(number)) {
+        console.log("Please enter a valid number.");
+    } else {
+        console.log(findPrimes(number));
+    }
+});
+// credit from Coding with John youtube video https://www.youtube.com/watch?v=I9-3drnfyp0 and Chatgpt for a explanation of things I still might have been confused about 
+```
 
-// Call the function to find and print primes
-findPrimes();
+```python
+# Python
+# this is a function that will help us find all the prime numbers
+def find_primes(number_to_check):
+    if number_to_check <= 1:  # this is an empty list for now until we run the test for all the prime numbers we find
+        return f"{number_to_check} is not a prime number."
 
-// credit from Coding with John youtube video https://www.youtube.com/watch?v=I9-3drnfyp0 
-```
+    is_prime = True  # I am saying that it is a prime until I find out it is not
 
+        # checks to see if the number can be divided by a smaller number evenly
+    for factor in range(2, number_to_check // 2 + 1):
+        if number_to_check % factor == 0:  # trying to see if there is a remainder after the divison and if it is equal to zero
+                is_prime = False  # if it is equal to zero it is flase meaning it is not prime
+                break  # again it means STOP
+    if is_prime:  # after checking all
+        return f"{number_to_check} is a prime number."
+    else:
+        return f"{number_to_check} is not a prime number."
+
+number = int(input("Enter a number to check to see if its prime: "))
+print(find_primes(number))
 
-## Python
-```python
-def find_primes(): # this is a function that will help us find all the prime numbers
-    prime_numbers = [] # this is an empty list for now until we run the test for all the prime numbers we find
-
-    for number_to_check in range(2, 101): # checking numbers from 2 to 100
-        is_prime = True # I am saying that it is a prime until I find out it is not 
-
-        for factor in range(2, number_to_check // 2 + 1): # checks to see if the number can be divided by a smaller number evenly
-            if number_to_check % factor == 0: # trying to see if there is a remainder after the divison and if it is equal to zero
-                is_prime = False # if it is equal to zero it is flase meaning it is not prime
-                break # again it means STOP
-        if is_prime: # after checking all 
-            prime_numbers.append(number_to_check)  # Add prime numbers
-
-    print("Prime  numbers from 1 to 100 are:")
-    # type out what is in the " "
-    print(", ".join(map(str, prime_numbers))) # put all the prime numbers split by a commma
-find_primes() #tells the computer to go ahead and run the function
 ```
+
 ## Explanation 
 My first thought was to use Javascript and html because those were the 2 languages that I was familiar with. I did some research and quickly came to the realization that html would not be the most effective. That's when I found out that I should use Python and Javascript.
 Python is known for how easy it is to read and how simple it is. But is super space indentation sensitive. Whereas Javascript is a little more complex because it uses different characters, which makes it a little harder to understand.