check prime in c++
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
bool checkPrime(int number){
for(int i=2; i<=sqrt(number); i++){
if(number%i==0){
return false;
}
}
return true;
}check prime in c++
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
bool checkPrime(int number){
for(int i=2; i<=sqrt(number); i++){
if(number%i==0){
return false;
}
}
return true;
}check prime numbers in c++
#include <iostream>
using namespace std;
int main()
{
int n, i, m=0, flag=0;
cout << "Enter the Number to check Prime: ";
cin >> n;
m=n/2;
for(i = 2; i <= m; i++)
{
if(n % i == 0)
{
cout<<"Number is not Prime."<<endl;
flag=1;
break;
}
}
if (flag==0)
cout << "Number is Prime."<<endl;
return 0;
} program to know if a number is prime
#include<bits/stdc++.h>
using namespace std;
bool Is_Prime(long long x){
if(x%2==0)return false;
for(int i=3;i*i<=x;i+=2)
if(x%i==0)return false;
return true;
}
int main(){
long long x;
cin>>x;
if(Is_Prime(x))cout<<"Is Prime";
else cout<<"Is not Prime";
}prime number c++
template<class T> bool isPrime(T n)
{
T i;
if(i<2) return false;
for(i = 2; i * i <= n; i++) {
if(n % i == 0) return false;
}
return true;
}C++ prime number check
// 6k+-1 optimisation
bool is_prime6(int num) {
int i;
if (num == 1)
return false;
if (num <= 3)
return true;
if (num % 2 == 0 || num % 3 == 0)
return false;
if (num < 25)
return true;
for (i = 5; i * i <= num; i += 6)
if (num % i == 0 || num % (i + 2) == 0)
return false;
return true;
}check prime in c++
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool isPrime(ll number){
for(ll i = 2; i <= number / 2; i++){
if(number % i == 0)
{
return false;
break;
}
}
return true;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
