diff --git a/Project-Euler/Problem3.js b/Project-Euler/Problem3.js
index d870b80b4..789f62206 100644
--- a/Project-Euler/Problem3.js
+++ b/Project-Euler/Problem3.js
@@ -1,7 +1,6 @@
 // https://projecteuler.net/problem=3
-const problem = 600851475143
 
-const largestPrime = (num) => {
+export const largestPrime = (num = 600851475143) => {
   let newnumm = num
   let largestFact = 0
   let counter = 2
@@ -17,4 +16,3 @@ const largestPrime = (num) => {
   }
   return largestFact
 }
-console.log(largestPrime(problem))
diff --git a/Search/LinearSearch.js b/Search/LinearSearch.js
index f6416f6d6..a02ac3cd1 100644
--- a/Search/LinearSearch.js
+++ b/Search/LinearSearch.js
@@ -4,12 +4,13 @@
  * for the target value until a match is found or until all the elements
  * have been searched.
  */
-function SearchArray (searchNum, ar) {
+function SearchArray (searchNum, ar, output = v => console.log(v)) {
   const position = Search(ar, searchNum)
   if (position !== -1) {
-    console.log('The element was found at ' + (position + 1))
-  } else {
-    console.log('The element not found')
+    output('The element was found at ' + (position + 1))
+  }
+  else {
+    output('The element not found')
   }
 }