diff --git a/javascript/README.md b/javascript/README.md
index 4ec9e4d..611556f 100644
--- a/javascript/README.md
+++ b/javascript/README.md
@@ -1,4 +1,4 @@
 # Javascript
 
 - hello_world.js | 2024-01-01 | 1 line
-- prime_number_finder.js | 2024-07-31 | 28 lines
+- prime-number-finder.js | 2024-07-31 | 26 lines
diff --git a/javascript/package.json b/javascript/package.json
index 5092c1f..1ffd8d2 100644
--- a/javascript/package.json
+++ b/javascript/package.json
@@ -1,7 +1,7 @@
 {
   "name": "javascript-programs",
   "version": "1.0.0",
-  "description": "A collection of Javascript programs.",
+  "description": "A collection of JavaScript programs.",
   "main": "index.js",
   "scripts": {
     "test": "echo \"Error: no test specified\" && exit 1"
diff --git a/javascript/prime-number-finder.js b/javascript/prime-number-finder.js
new file mode 100644
index 0000000..7ae6713
--- /dev/null
+++ b/javascript/prime-number-finder.js
@@ -0,0 +1,26 @@
+// Function to check if a number is prime
+function isPrime(num) {
+  if (num <= 1) {
+    return false;
+  }
+  for (let i = 2; i <= Math.sqrt(num); i++) {
+    if (num % i === 0) {
+      return false;
+    }
+  }
+  return true;
+}
+
+// Get the number from the command line arguments
+const number = parseInt(process.argv[2]);
+
+// Check if the number is prime and print the result
+if (isNaN(number)) {
+  console.log("Please provide a valid number.");
+} else {
+  if (isPrime(number)) {
+    console.log(`${number} is a prime number.`);
+  } else {
+    console.log(`${number} is not a prime number.`);
+  }
+}
diff --git a/javascript/prime_number_finder.js b/javascript/prime_number_finder.js
deleted file mode 100644
index 2db9621..0000000
--- a/javascript/prime_number_finder.js
+++ /dev/null
@@ -1,28 +0,0 @@
-
-function isPrime(num) {
-  if (num <= 1) return false;
-  if (num <= 3) return true;
-
-  if (num % 2 === 0 || num % 3 === 0) return false;
-
-  for (let i = 5; i * i <= num; i = i + 6) {
-    if (num % i === 0 || num % (i + 2) === 0) return false;
-  }
-
-  return true;
-}
-
-function findPrimes(limit) {
-  const primes = [];
-  for (let i = 2; i <= limit; i++) {
-    if (isPrime(i)) {
-      primes.push(i);
-    }
-  }
-  return primes;
-}
-
-const limit = 100;
-const primeNumbers = findPrimes(limit);
-console.log(`Prime numbers up to ${limit}:`);
-console.log(primeNumbers.join(', '));