Skip to main content

C Program To Generate Prime Numbers.

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. Remember two is the only even and also the smallest prime number. First few prime numbers are 2, 3, 5, 7, 11, 13, 17....etc. Prime numbers have many applications in computer science and mathematics. Any number greater than 1 can be factorized into prime numbers; for example 540 = 22*33*51. This fact makes primes very significant to communications.

Most modern computer cryptography works by using the prime factors of large numbers. The large number that was used to encrypt a file can be publicly known and available, because the encryption works so only the prime factors of that large number can be used to decrypt it again. Though finding those factors is technically only a matter of time, it’s a matter of so much time that we say it cannot be done. A modern super-computer could chew on a 256-bit factorization problem for longer than the current age of the universe, and still not get the answer…




There are various methods of generating prime numbers in C Programming language which are mentioned below:

Method 01:
#include<stdio.h>

int main() {
int n, i = 2, count, c;

printf("Total Number Of Prime Numbers Required: ");
scanf("%d",&n);

if (n >= 1) {
printf("\nFirst %d Prime Numbers Are: \n",n);
printf("\n");
}

for (count = 2; count <= n; ) {
for (c = 2; c <= i-1; c++) {
if (i%c == 0)
break;
}

if (c == i) {
printf("%d\t",i);
count++;
}
i++;
}
printf("\n");
return 0;
}

Method 02:
#include<stdio.h>
int check_prime(int num);

int main(){
int n1,n2,i,flag;

printf("Enter Two Numbers (Intervals): ");
scanf("%d %d",&n1, &n2);
printf("\n\nPrime Numbers Between %d and %d Are: \n", n1, n2);

for(i=2;i<n2;++i) {
flag=check_prime(i);

if(flag==0)
printf("%d\t",i);
}
return 0;
}

/*  User-defined function to check prime number  */
int check_prime(int num) {

int j,flag=0;
for(j=2;j<=num/2;++j) {

if(num%j==0){
flag=1;
break;
}}
return flag;
}

Method 3:
#include<stdio.h>

void main() {
int num,i=1,j,count;

printf("\nEnter a number (max range): ");
scanf("%d",&num);

printf("\nPrime Numbers Between 1 and %d:\n\n",num);

while(i<=num) {
count=0; // initializing count to 0 for each iteration

for(j=1;j<=i;j++) {
if(i%j==0) //checking whether num is divisible by j
count++;
}

if(count==2) //if num is divisible by 2 numbers, then it is prime
printf("%d\t",i);
i++;
}
getch();
}
Labels:

Popular posts from this blog

C Program To Check Whether A Number Is Palindrome Or Not.

This program takes an integer from user and the integer is reversed. If the reversed integer is equal to the integer entered by user then that number is a palindrome. If not that number is not a palindrome.   #include <stdio.h> int main()  { int num, temp, remainder, reverse = 0; printf("Enter an integer: "); scanf("%d", &num); /*  original number is stored at temp */ temp = num; while (num > 0)  { remainder = num % 10; reverse = reverse * 10 + remainder; num /= 10;   }
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more

C Program To Convert Natural Numbers To Roman Numerals.

Roman Number System of representing numbers devised by the ancient Romans. The numbers are formed by combinations of the symbols I, V, X, L, C, D, and M, standing, respectively, for 1, 5, 10, 50, 100, 500, and 1,000 in the Hindu-Arabic numeral system. Natural numbers mean no negative numbers and no fractions, i.e. the whole numbers from 1 upwards: 1, 2, 3, and so on. Here is source code of the C program to convert natural numbers to Roman Numerals. It compiles and runs on any operating system. #include <stdio.h> void predigit(char num1, char num2); void postdigit(char c, int n); char romanval[1000]; int i = 0; int main() { int j; long number; printf("Enter any natural number: "); scanf("%d", &number);
Read more

Introduction To Algorithms, 3rd Edition

Before there were computers, there were algorithms. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. In this book, the authors tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures — many with multiple parts — illustrating how the algorithms work. It also includes careful analysis of the running times of all algorithms. In this third edition, the entire book once again updated including changes cove...
Read more