A faster way to compute the largest prime factor Announcing the arrival of Valued Associate...

How to avoid introduction cliches

A Dictionary or Encyclopedia of Fantasy or Fairy Tales from the 1960s

As an international instructor, should I openly talk about my accent?

Why isn't everyone flabbergasted about Bran's "gift"?

PIC mathematical operations weird problem

What is the term for a person whose job is to place products on shelves in stores?

c++ diamond problem - How to call base method only once

Implementing 3DES algorithm in Java: is my code secure?

Raising a bilingual kid. When should we introduce the majority language?

Does Mathematica have an implementation of the Poisson binomial distribution?

How to not starve gigantic beasts

Could Neutrino technically as side-effect, incentivize centralization of the bitcoin network?

Has a Nobel Peace laureate ever been accused of war crimes?

Justification for leaving new position after a short time

Could moose/elk survive in the Amazon forest?

Suing a Police Officer Instead of the Police Department

How to get even lighting when using flash for group photos near wall?

Is Diceware more secure than a long passphrase?

Contradiction proof for inequality of P and NP?

A faster way to compute the largest prime factor

Is a 5 watt UHF/VHF handheld considered QRP?

What’s with the clanks in Endgame?

Did the Roman Empire have penal colonies?

Is Bran literally the world's memory?



A faster way to compute the largest prime factor



Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Project Euler #3 - largest prime factorFaster way to determine largest prime factorx64 Assembly - checking for largest prime factorProject Euler #3 (Largest prime factor) in SwiftProject Euler 3: Getting the largest prime factor of a numberVery slow Project Euler Q3 (largest prime factor of a large number)Project Euler 3: Largest prime factorLargest prime factor of a given numberProject Euler 3 - Largest prime factorEuler problem 3: largest prime factor of the numberWork out largest prime factor of a number





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0;
}







1












$begingroup$


I am self-learning js and came across this problem(#3) from the Euler Project




The prime factors of 13195 are 5, 7, 13 and 29.



What is the largest prime factor of the number 600851475143 ?




Logic:




  • Have an array primes to store all the prime numbers less than number


  • Loop through the odd numbers only below number to check for primes using i



  • Check if i is divisible by any of the elements already in primes.




    • If yes, isPrime = false and break the for loop for j by j=primesLength

    • If not, isPrime = true




  • If isPrime == true then add i to the array primes and check if number%i == 0




    • If number%i == 0% update the value of factor as factor = i



  • Return factor after looping through all the numbers below number



My code:






function problem3(number){

	let factor = 1;

	let primes = [2];	//array to store prime numbers



	for(let i=3; i<number; i=i+2){		//Increment i by 2 to loop through only odd numbers

		let isPrime = true;

		let primesLength= primes.length;



		for(let j=0; j< primesLength; j++){

			if(i%primes[j]==0){

				isPrime = false;

				j=primesLength;	//to break the for loop

			}

		}



		if(isPrime == true){

			primes.push(i);

			if(number%i == 0){

				factor = i;

			}

		}

	}

	return  factor;

}



console.log(problem3(600851475143));





It is working perfectly for small numbers, but is quite very slow for 600851475143. What should I change in this code to make the computation faster?






javascript beginner programming-challenge time-limit-exceeded primes







share|improve this question









New contributor




Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$



















    1












    $begingroup$


    I am self-learning js and came across this problem(#3) from the Euler Project




    The prime factors of 13195 are 5, 7, 13 and 29.



    What is the largest prime factor of the number 600851475143 ?




    Logic:




    • Have an array primes to store all the prime numbers less than number


    • Loop through the odd numbers only below number to check for primes using i



    • Check if i is divisible by any of the elements already in primes.




      • If yes, isPrime = false and break the for loop for j by j=primesLength

      • If not, isPrime = true




    • If isPrime == true then add i to the array primes and check if number%i == 0




      • If number%i == 0% update the value of factor as factor = i



    • Return factor after looping through all the numbers below number



    My code:






    function problem3(number){
    
	let factor = 1;
    
	let primes = [2];	//array to store prime numbers
    

    
	for(let i=3; i<number; i=i+2){		//Increment i by 2 to loop through only odd numbers
    
		let isPrime = true;
    
		let primesLength= primes.length;
    

    
		for(let j=0; j< primesLength; j++){
    
			if(i%primes[j]==0){
    
				isPrime = false;
    
				j=primesLength;	//to break the for loop
    
			}
    
		}
    

    
		if(isPrime == true){
    
			primes.push(i);
    
			if(number%i == 0){
    
				factor = i;
    
			}
    
		}
    
	}
    
	return  factor;
    
}
    

    
console.log(problem3(600851475143));





    It is working perfectly for small numbers, but is quite very slow for 600851475143. What should I change in this code to make the computation faster?






    javascript beginner programming-challenge time-limit-exceeded primes







    share|improve this question









    New contributor




    Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      1












      1








      1





      $begingroup$


      I am self-learning js and came across this problem(#3) from the Euler Project




      The prime factors of 13195 are 5, 7, 13 and 29.



      What is the largest prime factor of the number 600851475143 ?




      Logic:




      • Have an array primes to store all the prime numbers less than number


      • Loop through the odd numbers only below number to check for primes using i



      • Check if i is divisible by any of the elements already in primes.




        • If yes, isPrime = false and break the for loop for j by j=primesLength

        • If not, isPrime = true




      • If isPrime == true then add i to the array primes and check if number%i == 0




        • If number%i == 0% update the value of factor as factor = i



      • Return factor after looping through all the numbers below number



      My code:






      function problem3(number){
      
	let factor = 1;
      
	let primes = [2];	//array to store prime numbers
      

      
	for(let i=3; i<number; i=i+2){		//Increment i by 2 to loop through only odd numbers
      
		let isPrime = true;
      
		let primesLength= primes.length;
      

      
		for(let j=0; j< primesLength; j++){
      
			if(i%primes[j]==0){
      
				isPrime = false;
      
				j=primesLength;	//to break the for loop
      
			}
      
		}
      

      
		if(isPrime == true){
      
			primes.push(i);
      
			if(number%i == 0){
      
				factor = i;
      
			}
      
		}
      
	}
      
	return  factor;
      
}
      

      
console.log(problem3(600851475143));





      It is working perfectly for small numbers, but is quite very slow for 600851475143. What should I change in this code to make the computation faster?






      javascript beginner programming-challenge time-limit-exceeded primes







      share|improve this question









      New contributor




      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I am self-learning js and came across this problem(#3) from the Euler Project




      The prime factors of 13195 are 5, 7, 13 and 29.



      What is the largest prime factor of the number 600851475143 ?




      Logic:




      • Have an array primes to store all the prime numbers less than number


      • Loop through the odd numbers only below number to check for primes using i



      • Check if i is divisible by any of the elements already in primes.




        • If yes, isPrime = false and break the for loop for j by j=primesLength

        • If not, isPrime = true




      • If isPrime == true then add i to the array primes and check if number%i == 0




        • If number%i == 0% update the value of factor as factor = i



      • Return factor after looping through all the numbers below number



      My code:






      function problem3(number){
      
	let factor = 1;
      
	let primes = [2];	//array to store prime numbers
      

      
	for(let i=3; i<number; i=i+2){		//Increment i by 2 to loop through only odd numbers
      
		let isPrime = true;
      
		let primesLength= primes.length;
      

      
		for(let j=0; j< primesLength; j++){
      
			if(i%primes[j]==0){
      
				isPrime = false;
      
				j=primesLength;	//to break the for loop
      
			}
      
		}
      

      
		if(isPrime == true){
      
			primes.push(i);
      
			if(number%i == 0){
      
				factor = i;
      
			}
      
		}
      
	}
      
	return  factor;
      
}
      

      
console.log(problem3(600851475143));





      It is working perfectly for small numbers, but is quite very slow for 600851475143. What should I change in this code to make the computation faster?






      function problem3(number){
      
	let factor = 1;
      
	let primes = [2];	//array to store prime numbers
      

      
	for(let i=3; i<number; i=i+2){		//Increment i by 2 to loop through only odd numbers
      
		let isPrime = true;
      
		let primesLength= primes.length;
      

      
		for(let j=0; j< primesLength; j++){
      
			if(i%primes[j]==0){
      
				isPrime = false;
      
				j=primesLength;	//to break the for loop
      
			}
      
		}
      

      
		if(isPrime == true){
      
			primes.push(i);
      
			if(number%i == 0){
      
				factor = i;
      
			}
      
		}
      
	}
      
	return  factor;
      
}
      

      
console.log(problem3(600851475143));





      function problem3(number){
      
	let factor = 1;
      
	let primes = [2];	//array to store prime numbers
      

      
	for(let i=3; i<number; i=i+2){		//Increment i by 2 to loop through only odd numbers
      
		let isPrime = true;
      
		let primesLength= primes.length;
      

      
		for(let j=0; j< primesLength; j++){
      
			if(i%primes[j]==0){
      
				isPrime = false;
      
				j=primesLength;	//to break the for loop
      
			}
      
		}
      

      
		if(isPrime == true){
      
			primes.push(i);
      
			if(number%i == 0){
      
				factor = i;
      
			}
      
		}
      
	}
      
	return  factor;
      
}
      

      
console.log(problem3(600851475143));





      javascript beginner programming-challenge time-limit-exceeded primes




      javascript beginner programming-challenge time-limit-exceeded primes






      share|improve this question









      New contributor




      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question









      New contributor




      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question








      edited 1 hour ago









      200_success

      131k17157422




      131k17157422






      New contributor




      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 2 hours ago









      EagleEagle

      1085




      1085




      New contributor




      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Eagle is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$

          There are many questions about Project Euler 3 on this site already. The trick is to pick an algorithm that…




          • Reduces n whenever you find a factor, so that you don't need to consider factors anywhere near as large as 600851475143

          • Only finds prime factors, and never composite factors, so that you never need to explicitly test for primality.


          Your algorithm suffers on both criteria: the outer for loop goes all the way up to 600851475143 (which is insane), and you're testing each of those numbers for primality (which is incredibly computationally expensive).






          share|improve this answer









          $endgroup$





















            1












            $begingroup$

            The first problem is that you are trying to find all prime numbers under number. The number of prime numbers under x is approximately x/ln(x) which is around 22153972243.4 for our specific value of x



            This is way too big ! So even if you where capable of obtaining each of these prime numbers in constant time it would take too much time.



            This tells us this approach is most likely unfixable.






            share|improve this answer








            New contributor




            Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            $endgroup$














              Your Answer






              StackExchange.ifUsing("editor", function () {
              StackExchange.using("externalEditor", function () {
              StackExchange.using("snippets", function () {
              StackExchange.snippets.init();
              });
              });
              }, "code-snippets");

              StackExchange.ready(function() {
              var channelOptions = {
              tags: "".split(" "),
              id: "196"
              };
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function() {
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled) {
              StackExchange.using("snippets", function() {
              createEditor();
              });
              }
              else {
              createEditor();
              }
              });

              function createEditor() {
              StackExchange.prepareEditor({
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader: {
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              },
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              });


              }
              });






              Eagle is a new contributor. Be nice, and check out our Code of Conduct.










              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f219063%2fa-faster-way-to-compute-the-largest-prime-factor%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              3












              $begingroup$

              There are many questions about Project Euler 3 on this site already. The trick is to pick an algorithm that…




              • Reduces n whenever you find a factor, so that you don't need to consider factors anywhere near as large as 600851475143

              • Only finds prime factors, and never composite factors, so that you never need to explicitly test for primality.


              Your algorithm suffers on both criteria: the outer for loop goes all the way up to 600851475143 (which is insane), and you're testing each of those numbers for primality (which is incredibly computationally expensive).






              share|improve this answer









              $endgroup$


















                3












                $begingroup$

                There are many questions about Project Euler 3 on this site already. The trick is to pick an algorithm that…




                • Reduces n whenever you find a factor, so that you don't need to consider factors anywhere near as large as 600851475143

                • Only finds prime factors, and never composite factors, so that you never need to explicitly test for primality.


                Your algorithm suffers on both criteria: the outer for loop goes all the way up to 600851475143 (which is insane), and you're testing each of those numbers for primality (which is incredibly computationally expensive).






                share|improve this answer









                $endgroup$
















                  3












                  3








                  3





                  $begingroup$

                  There are many questions about Project Euler 3 on this site already. The trick is to pick an algorithm that…




                  • Reduces n whenever you find a factor, so that you don't need to consider factors anywhere near as large as 600851475143

                  • Only finds prime factors, and never composite factors, so that you never need to explicitly test for primality.


                  Your algorithm suffers on both criteria: the outer for loop goes all the way up to 600851475143 (which is insane), and you're testing each of those numbers for primality (which is incredibly computationally expensive).






                  share|improve this answer









                  $endgroup$



                  There are many questions about Project Euler 3 on this site already. The trick is to pick an algorithm that…




                  • Reduces n whenever you find a factor, so that you don't need to consider factors anywhere near as large as 600851475143

                  • Only finds prime factors, and never composite factors, so that you never need to explicitly test for primality.


                  Your algorithm suffers on both criteria: the outer for loop goes all the way up to 600851475143 (which is insane), and you're testing each of those numbers for primality (which is incredibly computationally expensive).







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 1 hour ago









                  200_success200_success

                  131k17157422




                  131k17157422

























                      1












                      $begingroup$

                      The first problem is that you are trying to find all prime numbers under number. The number of prime numbers under x is approximately x/ln(x) which is around 22153972243.4 for our specific value of x



                      This is way too big ! So even if you where capable of obtaining each of these prime numbers in constant time it would take too much time.



                      This tells us this approach is most likely unfixable.






                      share|improve this answer








                      New contributor




                      Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.






                      $endgroup$


















                        1












                        $begingroup$

                        The first problem is that you are trying to find all prime numbers under number. The number of prime numbers under x is approximately x/ln(x) which is around 22153972243.4 for our specific value of x



                        This is way too big ! So even if you where capable of obtaining each of these prime numbers in constant time it would take too much time.



                        This tells us this approach is most likely unfixable.






                        share|improve this answer








                        New contributor




                        Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                        Check out our Code of Conduct.






                        $endgroup$
















                          1












                          1








                          1





                          $begingroup$

                          The first problem is that you are trying to find all prime numbers under number. The number of prime numbers under x is approximately x/ln(x) which is around 22153972243.4 for our specific value of x



                          This is way too big ! So even if you where capable of obtaining each of these prime numbers in constant time it would take too much time.



                          This tells us this approach is most likely unfixable.






                          share|improve this answer








                          New contributor




                          Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.






                          $endgroup$



                          The first problem is that you are trying to find all prime numbers under number. The number of prime numbers under x is approximately x/ln(x) which is around 22153972243.4 for our specific value of x



                          This is way too big ! So even if you where capable of obtaining each of these prime numbers in constant time it would take too much time.



                          This tells us this approach is most likely unfixable.







                          share|improve this answer








                          New contributor




                          Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.









                          share|improve this answer



                          share|improve this answer






                          New contributor




                          Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.









                          answered 1 hour ago









                          Jorge FernándezJorge Fernández

                          1645




                          1645




                          New contributor




                          Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.





                          New contributor





                          Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.






                          Jorge Fernández is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.






















                              Eagle is a new contributor. Be nice, and check out our Code of Conduct.










                              draft saved

                              draft discarded


















                              Eagle is a new contributor. Be nice, and check out our Code of Conduct.













                              Eagle is a new contributor. Be nice, and check out our Code of Conduct.












                              Eagle is a new contributor. Be nice, and check out our Code of Conduct.
















                              Thanks for contributing an answer to Code Review Stack Exchange!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid …



                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.


                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f219063%2fa-faster-way-to-compute-the-largest-prime-factor%23new-answer', 'question_page');
                              }
                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              -

                              Popular posts from this blog

                              What is the “three and three hundred thousand syndrome”?Who wrote the book Arena?What five creatures were...

                              Image
                              What happens when the centripetal force is equal and opposite to the centrifugal force? Why is "la Gestapo" feminine? Nested Dynamic SOQL Query How are passwords stolen from companies if they only store hashes? Exposing a company lying about themselves in a tightly knit industry: Is my career at risk on the long run? Can "few" be used as a subject? If so, what is the rule? Why are there no stars visible in cislunar space? categorizing a variable turns it from insignificant to significant Do I need an EFI partition for each 18.04 ubuntu I have on my HD? What are the consequences of changing the number of hours in ...
                              Read more

                              Gersau Kjelder | Navigasjonsmeny46°59′0″N 8°31′0″E46°59′0″N...

                              Image
                              Tidlegare republikkarSkipingar i 1433Kommunar i SchwyzDistrikt i SchwyzNedleggingar i 1798Stader ved Vierwaldstättersee kommunekantonenSchwyzSveitskm²VierwaldstätterseeLauerz Gersau Kommunevåpenet til Gersau Plassering Styresmakter Land   Sveits Kanton kantonen Schwyz Distrikt Gersau Språk tysk Geografi Flatevidd  - kommune 23,70 km² Innbyggjarar  - kommune (desember 2010)    - folketettleik 2 094   88,4 /km² Koordinatar 46°59′0″N 8°31′0″E  Koordinatar: 46°59′0″N 8°31′0″E  Høgd over havet 435 moh Diverse annan informasjon Postnummer 6442 Nettstad: www.gersau.ch Freistaat und Republik Gersau Fristaten og republikken Gersau By-republikk og alliert protektorat i Det gamle sveitsiske eidsforundet ←   ← 1433–1798 1814–1818 →   → Hovudstad Gersau Styreform Republikk Historisk periode Tidleg moderne tid  - Kjøpte fridom frå ...
                              Read more

                              Hestehale Innhaldsliste Hestehale på kvinner | Hestehale på menn | Galleri | Sjå òg |...

                              Image
                              Frisyrar frisyrehårhårstrikkhårklemmerøyrethesthovudverkeuropeisk motejobbtreningfletterparykkarungdomsopprørmotkulturmusikararmotorsykkelentusiastarpolitietpolitiskforretningverksemdfiskeflette Hestehale sett bakfrå. Hestehale på ein mannleg indianarleiar. Hestehale er ein frisyre der ein samlar det meste eller alt av langt hår [1] i bakhovudet med ein hårstrikk eller liknande. Avhengig av mote kan det òg vere vanleg å sette opp hestehalen med hårklemmer eller å ha hestehalen hengande på den eine sida av hovudet ved å samle håret ved øyret. Hestehale er ein vanleg frisyre for jenter og for gutar med langt hår. Han har fått namnet sitt etter likskapen med halen på ein hest. For stramme hestehaler kan føre til hårtap, [2] i nokre høve også hovudverk. [3] Innhaldsliste 1 Hestehale på kvinner 2 Hestehale på menn 3 Galleri 4 Sjå òg 5 Bakgrunnsstoff 6 Kjelder Hestehale på kvinner | Ungjente med hestehale som held håret unna ansiktet...
                              Read more