Quantcast
Channel: LabVIEW topics
Viewing all articles
Browse latest Browse all 69105

Project Euler Problems Help (Urgent)

$
0
0

Hi friends, I need help doing the problems below in LabVIEW. I need a code that is quick and efficient because my code is simply consuming too much time.:smileyindifferent: I want the code without using any inbuilt LabVIEW VIs such as the prime factor.vi.:smileyhappy:

 

 

1) Find the greatest product of 6 consecutive digits in the first 1000 decimal digits of Euler's number e.

 

2) By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?

 

3) The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.

 

4)  2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?

 

Thanks


Viewing all articles
Browse latest Browse all 69105

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>