Skip to main content

Problem 10 projecteuler.net matlab Summation of primes - solution

Problem

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

Solution

In this program we have used the for loop, if statement, isprime function, logical function, num2str function which are in built in matlab. Please head on to the below links if you don't know any of them:
Find the explanation of this program below

Program

sum = 0;
for i = 1:2000000
    if isprime(i) == logical(1)
        sum = sum+i;
    end
end
num2str(sum)

Download this program from here: sum_of_primes.m

Explanation

During the start of this program we have initiated the variable sum equal to 0. Now a for loop is started in the range of 1 to 2000000(2 million). Let us understand this problem by going through iterations.

First iteration

In the first iteration, the value of i is 1. Now the if statement starts and checks for the condition whether 1 is prime using the isprime function and the condition is false, So the statement inside the if statement (Add the value of the sum to the prime number, if the if statement is true) is not executed and the second iteration starts.

Second iteration

Now in the second iteration the value of the i is changed from 1 to 2. Condition for the if statement is satisfied and the statement inside the if statement gets executed. Now the value of the sum is changed from 0 to 0+2. Now again the third iteration starts

Third iteration

In the third iteration, the value of i is changed to 3 and the condition for the if statement is satisfied and the value of sum changed from 2 to 5. Similarly this continues till the value of the i is 2000000(2 million).

Finally num2str function is used to give the output of the sum of all the prime numbers below 2000000(2 million).

You may have a doubt on why I have converted the number to string using num2str instead of directly stating the output as number. I have tried this and I have found that the output is in the form of scientific notation(Ex. 1.408e+34), and this is not accurate, but as we need the accurate result, I have converted it to string and the output is accurate.

I have tried to explain this program so that even novice can understand it, but if you have doubt please don't hesitate to ask me the doubt you have.

You can download this post in pdf format and read it offline here: problem10_projecteuler_matlab.pdf

The code was highlighted using hilite.me

The problem has been taken from projecteuler.net and can be found here: problem10

Run the program and comment below the output you are getting for a given input.

 Keywords: problem 10, projecteuler.net, sum of primes, matlab
Labels:

Popular posts from this blog

Project Euler Problem 67 Solution with Python

Maximum path sum II By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.
Read more

Problem 43 Project Euler Solution with python

Sub-string divisibility The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property. Let d 1 be the 1 st digit, d 2 be the 2 nd digit, and so on. In this way, we note the following: d 2 d 3 d 4 =406 is divisible by 2 d 3 d 4 d 5 =063 is divisible by 3 d 4 d 5 d 6 =635 is divisible by 5 d 5 d 6 d 7 =357 is divisible by 7 d 6 d 7 d 8 =572 is divisible by 11 d 7 d 8 d 9 =728 is divisible by 13 d 8 d 9 d 10 =289 is divisible by 17 Find the sum of all 0 to 9 pandigital numbers with this property. One might write a simple solution using direct if else statements for this problem. Using if else statements, the execution time may be a few seconds. But this is not a very good approach. I too had written a program with if else statement which will take each and every permutation of the 0-9 Pandigital and check for the conditions given in the qu...
Read more

Add/Embed SVG to Blogger website

In this post I will tell you my method(trick) of adding SVG images in a blogger website or blog. Before starting , the first thin g I am assu m ing is that you are aware of SVG if you are here. If not please see S calable V ec tor G raphics Recently when I tried to embed a SVG image for a post on pygal, I tried uploading the SVG file and blogger Image uploader came up with an error, because of which I had to find some other way.  SVG File upload Error in Blogger  I started sea rc hing Google " Embed SVG in Blogger " . I found blogorrhea , w h ich gave some i nformatio n on add ing SVG directly as a markup , which worked , but I faced another problem using this . Also th is guy has used lot of Javascript which was confusin g for me, being new to using SVG.   So I first t houg ht of learning on h ow to embed SVG in HTML and t his on e worked out. Actually we can embed SVG in HTML i n following ways: Using Object tag Using Iframe tag Using embed...
Read more