first n prime numbers
Table of Contents
In this article, we will discuss the concept of Program for print first n prime numbers in C
In this code, we are going to learn how to find first n prime numbers using different methods in C language.
This is done using for loop,while loop and ,do-while loop in C language
In this program, we will display first n prime numbers using for loop in C language
Program 1
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i=3,count,num;
printf("Enter the number of prime you want\n");
//ask input from the user and store in n
scanf("%d",&n);
if(n>=1){
printf("First %d prime numbers are: \n",n);
printf("2\n");
}
for(count=2; count<=n; i++){
for(num=2; num<i; num++){
if(i%num==0)
break;
}
if(num==i){
printf("%d ",i);
count++;
}
}
return 0;
}
When the above code is executed, it produces the following results
Enter the number of prime you want 15 First 15 prime numbers are : 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47
In this program, we will display first n prime numbers using while loop in C language
Program 2
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i=3,count,num;
printf("Enter the number of prime you want\n");
//ask input from the user and store in n
scanf("%d",&n);
if(n>=1){
printf("First %d prime numbers are: \n\n",n);
printf("2 ");
}
count=2;
while(count<=n){
num=2;
while(num<i){
if(i%num==0)
break;
num++;
}
if(num==i){
printf("%d ",i);
count++;
}
i++;
}
getch();
return 0;
}
When the above code is executed, it produces the following results
Enter the number of prime you want 10 First 10 prime numbers are : 2 3 5 7 11 13 17 19 23 29
In this program, we will display first n prime numbers using do-while loop in C language
Program 3
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i=3,count,num;
printf("Enter the number of prime you want\n");
//ask input from the user and store in n
scanf("%d",&n);
if(n>=1){
printf("First %d prime numbers are: \n\n",n);
printf("2 ");
}
count=2;
do{
num=2;
do{
if(i%num==0)
break;
num++;
}while(num<i);
if(num==i){
printf("%d ",i);
count++;
}
i++;
}while(count<=n);
getch();
return 0;
}
When the above code is executed, it produces the following results
Enter the number of prime you want 8 First 8 prime numbers are : 2 3 5 7 11 13 17 19
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.