amp-web-push-widget button.amp-subscribe { display: inline-flex; align-items: center; border-radius: 5px; border: 0; box-sizing: border-box; margin: 0; padding: 10px 15px; cursor: pointer; outline: none; font-size: 15px; font-weight: 500; background: #4A90E2; margin-top: 7px; color: white; box-shadow: 0 1px 1px 0 rgba(0, 0, 0, 0.5); -webkit-tap-highlight-color: rgba(0, 0, 0, 0); } .amp-logo amp-img{width:190px} .amp-menu input{display:none;}.amp-menu li.menu-item-has-children ul{display:none;}.amp-menu li{position:relative;display:block;}.amp-menu > li a{display:block;} /* Inline styles */ figure.acss96ba9{max-width:546px;}div.acss138d7{clear:both;}div.acssf5b84{--relposth-columns:3;--relposth-columns_m:2;--relposth-columns_t:2;}div.acss1efa8{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2019/08/product2.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss6bdea{color:#333333;font-family:Arial;font-size:12px;height:75px;}div.acssc61bb{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/plugins/related-posts-thumbnails/img/default.png) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss626a3{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2019/03/largestone.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acsscae85{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2023/01/first-n-prime-300x113.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}a.acss9bfd5{font-size:14.52427184466pt;}a.acssc37f8{font-size:16.427184466019pt;}a.acss29e97{font-size:16.631067961165pt;}a.acss361c8{font-size:17.174757281553pt;}a.acss51c7b{font-size:20.029126213592pt;}a.acssa2e10{font-size:20.097087378641pt;}a.acss5dd67{font-size:21.728155339806pt;}a.acssf0e8e{font-size:12.077669902913pt;}a.acss759e3{font-size:17.922330097087pt;}a.acss0abf8{font-size:21.252427184466pt;}a.acss6bf84{font-size:13.504854368932pt;}a.acss349b0{font-size:10.038834951456pt;}a.acssf23c5{font-size:8pt;}a.acss7e0a8{font-size:9.2233009708738pt;}a.acsse6f77{font-size:16.970873786408pt;}a.acssc51bb{font-size:14.116504854369pt;}a.acss38f57{font-size:11.26213592233pt;}a.acss066f0{font-size:22pt;}a.acss4e811{font-size:17.31067961165pt;}a.acss9cc90{font-size:12.417475728155pt;}a.acss01721{font-size:15.339805825243pt;}a.acsse9f66{font-size:15.543689320388pt;}a.acss72254{font-size:20.708737864078pt;}a.acsseedeb{font-size:20.776699029126pt;}a.acss25b87{font-size:14.320388349515pt;}a.acss7c517{font-size:12.757281553398pt;}a.acss7a3ee{font-size:18.941747572816pt;}a.acssf92d5{font-size:18.26213592233pt;}a.acss551d3{font-size:16.291262135922pt;} .icon-widgets:before {content: "\e1bd";}.icon-search:before {content: "\e8b6";}.icon-shopping-cart:after {content: "\e8cc";}
In this tutorial, we will discuss the concept of an Example Program to find first n prime numbers in C language
In this post, we are going to learn how to write a program to find the first n prime number using for, while, and do-while loops in C programming language:
The number that can be divided by 1 and itself only. it is called the prime number
for Example 2,3,5,7,11,13….
To understand this example program, you should have previous knowledge of the following Java topics
In this program, we will print the first “n” prime numbers, using for loop. first, the user is asked to enter a number randomly for n, and then the program prints the prime numbers 1 to n in C language.
Program 1
//Program to find first n prime numbers in C language #include <stdio.h> #include <stdlib.h> int main() { int n,i=3,count,num; //declare and initialize the variable 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("The first %d primes numbers are: \n",n); //Generating prime numbers 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 \n",i); count++; } } getch(); return 0; }
When the above code is executed, it produces the following result
Enter the number of primes you want The First 6 prime numbers are 2 3 5 7 11 13
In this program, we will print the first “n” prime numbers, using a while loop. first, the user is asked to enter a number randomly for n, and then the program prints the prime numbers 1 to n in C language.
Program 2
//Program to find first n prime numbers in C language #include <stdio.h> #include <stdlib.h> int main() { int n,i=3,count,num; //declare and initialize the variable 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("The first %d prime numbers are: \n",n); //Generating prime numbers printf("2\n"); } count=2; while(count<=n){ num=2; while(num<i){ if(i%num==0) break; num++; } if(num==i){ printf("%d \n",i); count++; } i++; } getch(); return 0; }
When the above code is executed, it produces the following result
Enter the number of primes you want The first 10 prime numbers are 2 3 5 7 11 13 17 19 23 29
In this program, we will print the first “n” prime numbers, using the do-while loop. first, the user is asked to enter a number randomly for n, and then the program prints the prime numbers 1 to n.
Program 3
//Program to find first n prime numbers in C language #include <stdio.h> #include <stdlib.h> int main() { int n,i=3,count,num; //declare and initialize the variable printf("Enter the number of first n 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); //Generating prime numbers printf("2\n"); } count=2; do{ num=2; do{ if(i%num==0) break; num++; }while(num<i); if(num==i){ printf("%d \n",i); count++; } i++; } while(count<=n); getch(); return 0; }
When the above code is executed, it produces the following result
Enter the number of first n primes you want The first 12 prime numbers are 2 3 5 7 11 13 17 19 23 29 31 37
Suggested for you
Type of variable in C language
Program to find whether a Number is Prime or Not in C++
Program to find whether a Number is Prime or Not in C
Program to find whether a Number is Prime or Not in Java
Program to find whether a Number is Prime or Not in Python
C++ program to find first n prime numbers
Java program to find first n prime numbers
C program to find first n prime numbers
C code to 5 ways to check whether the given integer is Even or Odd
Java code to 5 ways to check whether the given integer is Even or Odd
C++ code to 5 ways to check whether the given integer is Even or Odd
Python code to 5 ways to check whether the given integer is Even or Odd
10 best Ways to Subtract Two Numbers in Java (With Examples) In this article, we…
Array Data Structure: Definition, Types, Operations & Advantages Array Data Structure Introduction In this post,…
20 ways to subtract two numbers in Java In this article, we will discuss the…
10 simple ways to add two numbers in Java In this article, we will discuss…
Write a Python program to find the first n prime numbers In this article we…
Python: Calculate Average of odd and even in a list using loops In this post,…