Scribd Logo
Upload

Welcome to Scribd!

  • 31 views

    Aim: To Calculate The First 100 Prime Numbers.

    Uploaded by

    Madhuri Ganguly
    This C++ program aims to calculate and display the first 100 prime numbers. It uses nested for loops to check if each number from 2 to i is prime by testing for divisibility by numbers from 2 to j. If a number is found to be prime, it is displayed in a formatted manner with 10 numbers per line. The program returns after displaying the first 100 prime numbers.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Aim: To Calculate The First 100 Prime Numbers.

    Uploaded by

    Madhuri Ganguly
    31 views2 pages
    This C++ program aims to calculate and display the first 100 prime numbers. It uses nested for loops to check if each number from 2 to i is prime by testing for divisibility by numbers from 2 to j. If a number is found to be prime, it is displayed in a formatted manner with 10 numbers per line. The program returns after displaying the first 100 prime numbers.

    Original Description:

    programming in c++ for generating 100 primes

    Original Title

    100 Primes using c++

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This C++ program aims to calculate and display the first 100 prime numbers. It uses nested for loops to check if each number from 2 to i is prime by testing for divisibility by numbers from 2 to j. If a number is found to be prime, it is displayed in a formatted manner with 10 numbers per line. The program returns after displaying the first 100 prime numbers.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    31 views2 pages

    Aim: To Calculate The First 100 Prime Numbers.

    Uploaded by

    Madhuri Ganguly
    This C++ program aims to calculate and display the first 100 prime numbers. It uses nested for loops to check if each number from 2 to i is prime by testing for divisibility by numbers from 2 to j. If a number is found to be prime, it is displayed in a formatted manner with 10 numbers per line. The program returns after displaying the first 100 prime numbers.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 2

    DATE: 17.9.

    12

    ROLL NO.: 1653

    /*Aim: TO CALCULATE THE FIRST 100 PRIME NUMBERS.*/


    #include<iostream.h>
    #include<conio.h>
    #include<iomanip.h>
    int main()
    {
    clrscr();
    int count=0,n,i,j,flag=1;
    cout<<"\n\n\t\tPROGRAM TO DISPLAY THE FIRST HUNDRED PRIME
    NUMBERS";
    cout<<"\n_______________________________________________________________
    _________________";
    for(i=2;i;i++)
    {
    flag=1;
    if(count==100)
    {
    cin.get();
    cin.get();
    return 0;
    }
    for(j=2;j<i;j++)
    {
    if(i%j==0)
    {
    flag=0;
    break;
    }
    }
    if(flag)
    {
    if(count%10==0)
    cout<<"\n"<<endl<<"\t";
    cout<<setw(6)<<i;
    count++;
    }
    }
    getch();
    return 0;
    }

    RESULT:

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy