If you have any query feel free to chat us!
Happy Coding! Happy Learning!
To print all prime numbers from 1 to N, you can modify the previous program to check each number in the range [1, N] for primality. If a number is prime, it will be printed; otherwise, it will be skipped. We can reuse the
isPrime
function from the previous program to determine whether a number is prime or not.Here's the C++ program to print all prime numbers from 1 to N:
cppCopy code
#include <iostream> bool isPrime(int number) { if (number <= 1) { return false; } for (int i = 2; i * i <= number; i++) { if (number % i == 0) { return false; } } return true; } int main() { int N; std::cout << "Enter a positive integer N: "; std::cin >> N; std::cout << "Prime numbers from 1 to " << N << " are: "; for (int i = 2; i <= N; i++) { if (isPrime(i)) { std::cout << i << " "; } } std::cout << std::endl; return 0; }
Example output:
mathematicaCopy code
Enter a positive integer N: 20 Prime numbers from 1 to 20 are: 2 3 5 7 11 13 17 19
mathematicaCopy code
Enter a positive integer N: 50 Prime numbers from 1 to 50 are: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47
In this program, we take the input N from the user and then loop through all numbers from 2 to N. For each number, we call the
isPrime
function to determine if it is prime. If it is prime, we print it on the console.Feel free to run this program with different values of N to find all the prime numbers within the given range.
Comments: 2
SCIAKU Team please upload 1st video of TREE please please please, please
I bought this course, it worth it!
Hi i want to buy this course but you dont have master card payment method please let me know how i can buy it
Dear mk.info.work, Now we have all types of payment options. If you need to purchase just checkout our official website