Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 8

Write a program that finds if a given number is a prime number.



#include <stdio.h>
void main()
{
int n, i, c = 0; 
clrscr();
printf("\n Enter a positive integer: "); scanf("%d",&n);

for(i=2; i<=n/2; ++i)
{
 // condition for nonprime number 
if(n%i==0)
{
    c=1;
    break;
}
}
 if (c==0)
printf("\n %d is a prime number.",n); else
printf("\n %d is not a prime number.",n);

 }

OUTPUT

Enter a positive integer: 67
67 is a prime number.

Comments

Post a Comment

Popular posts from this blog

Learning and Development Interview Questions and answers for Mathematics-1.

  1). What is Mean, Mode and Median? Solution Answer: The mean is the average of a  collection of numbers or terms in a sequence. To calculate the mean use a formula is sum of total terms divided  by number of terms. The mode  is the most f requent number or term in a sequence. It means the number that occurred  highest number of times  in a sequence. To find the mode arrange the numbers in ascending or descending order and verify which number repeated most number of times in a sorted sequence. The median is the middle number/term where the sequence is arranged in ascending or descending order. If the sorted sequence have odd number of terms then  divide by 2 and round up to get the position of the median number.  If the  sorted sequence  have  even  number of terms then  divide by 2  to get the position of the median number.  2 ). What is the Difference between Fractional and Rational number? Solu...
1 comment
Read more

INSERTION SORT, BUBBLE SORT, SELECTION SORT

// C program for insertion sort #include <math.h> #include <stdio.h> void insertionSort(int arr[], int n);     // A utility function to print a sorted array of size n void printArray(int arr[], int n) {     int i;     for (i = 0; i < n; i++)         printf("%d ", arr[i]);     printf("\n"); }    // Driver code int main() {     int arr[15],n,i;         printf("enter number of elements in array \n");     scanf("%d", &n);         printf("enter array values to sort\n");     for(i=0; i<n; i++)     scanf("%d", &arr[i]);         insertionSort(arr, n);     printArray(arr, n);        return 0; } /* Function to sort an array using insertion sort*/ void insertionSort(int arr[], int n) {     int i, key, j;     for (i = 1; i < n; i++) ...
Post a Comment
Read more