Java program to find sum of first n prime
Table of Contents
In this article, we will discuss the concept of Write a C++ program to find sum of first n prime numbers
In this code, we are going to learn how to write to calculate sum of the first n prime numbers using different methods in C++ program.
This is done using for loop,while loop and do-while loop in C++ language.
In this program, we will calculate sum of the first n prime numbers using for loop in C++ language
Program 1
#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
int i,j=2,n,counter=0,sum=0,flag=1;
//the program ask to input maximum limit
cout<<"Enter the value to n: ";
cin>>n;
//store the maximum in the max variable
while(counter<n){
for(i=2; i<=j-1; i++){
if(j%i==0){
flag=0;
break;
}
}
// when the 'i' is prime then add to sum
if(flag){
sum+=j;
counter++;
}
j++;
flag=1;
}
cout<<"sum of first "<<n<<" prime numbers:"<<sum;
getch();
return 0;
}
When the above code is executed, it produces the following result
Enter the value to n:100 sum of first 100 prime numbers: 24133
In this program, we will calculate sum of the first n prime numbers using while loop in C++ language
Program 1
#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
int i,j=2,n,counter=0,sum=0,flag=1;
//the program ask to input maximum limit
cout<<"Enter the value to n: ";
cin>>n;
//store the maximum in the max variable
while(counter<n){
i=2;
while(i<=j-1){
if(j%i==0){
flag=0;
break;
}
i++;
}
// when the 'i' is prime then add to sum
if(flag){
sum+=j;
counter++;
}
j++;
flag=1;
}
cout<<"sum of all first "<<n<<" prime numbers:"<<sum;
getch();
return 0;
}
When the above code is executed, it produces the following result
Enter the value to n:1000 sum of first 100 prime numbers: 3682913
In this program, we will calculate sum of the first n prime numbers using do-while loop in C++ language
Program 1
#include <iostream>
#include <conio.h>
using namespace std;
int isPrime(int j){
int counter=0,i;
for(i=2; i<=j/2; i++){
if(j%i==0){
counter=1;
}
}
if(counter==0)
return 1;
else return 0;
}
int main(void)
{
int n;
cout<<"Enter value for n: \n";
cin>>n;
int i=0,j=1,sum=0;
while(1){
j++;
if(isPrime(j)){
sum+=j;
i++;
}
if(i==n){
break;
}
}
cout<<"sum of all first "<<n<< "prime numbers:"<<sum;
getch();
return 0;
}
When the above code is executed, it produces the following result
Enter the value to n:500 sum of first 500 prime numbers: 824693
Suggested post
Similar post
Java programming code to check prime or not
C programming code to check prime or not
C++ programming code to check prime or not
Python programming code to check prime or not
Code to print prime numbers from 1 to 100 or 1 to n in Java
Code to print prime numbers from 1 to 100 or 1 to n in C
Code to print prime numbers from 1 to 100 or 1 to n in C++
Code to print prime numbers from 1 to 100 or 1 to n in Python
Multiply two numbers in Java using scanner| 5 different ways In this article, we will…
5 Different ways to Divide two numbers in Java using scanner In this article, we…
Learn 8 Ways to Subtract Two Numbers Using Methods in Java In this article, we…
10 ways to subtract two numbers in Java In this article, we will discuss the…
Java Code Examples – Multiply Two Numbers in 5 Easy Ways In this article, we…
How to Divide two numbers in Java| 5 different ways In this article, we will…
This website uses cookies.