Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check whether given three numbers are adjacent primes

  • Last Updated : 12 May, 2022

Given three numbers and check whether they are adjacent primes are not. Three prime numbers are said to be adjacent primes if there is no prime between them.
Examples :
 

Input : 2, 3, 5
Output : Yes
Explanation: 2, 3, 5 are adjacent primes.

Input : 11, 13, 19
Output : No
Explanation: 11, 13, 19 are not adjacent primes. 
Because there exits 17 between 13 and 19 which 
is prime.

 

Approach: 
We already know what is a prime number. Here we need to check whether the given three numbers are adjacent primes or not. First we check given three numbers are prime or not. After that we will find next prime of first number and second number. If satisfies the condition of adjacent primes then it is clear that given three numbers are adjacent primes otherwise not. 
 

C++




// CPP program to check given three numbers are
// primes are not.
 
#include <bits/stdc++.h>
using namespace std;
 
// checks whether given number is prime or not.
bool isPrime(int n)
{
    // check if n is a multiple of 2
    if (n % 2 == 0)
        return false;
 
    // if not, then just check the odds
    for (int i = 3; i * i <= n; i += 2)
        if (n % i == 0)
            return false;   
    return true;
}
 
// return next prime number
int nextPrime(int start)
{
    // start with next number.
    int next = start + 1;
 
    // breaks after finding next prime number
    while (!isPrime(next))
        next++;
 
    return next;
}
 
// check given three numbers are adjacent primes are not.
bool areAdjacentPrimes(int a, int b, int c)
{
    // check given three numbers are primes are not.
    if (!isPrime(a) || !isPrime(b) || !isPrime(c))
        return false;
 
    // find next prime of a
    int next = nextPrime(a);
 
    // If next is not same as 'a'
    if (next != b)
        return false;
 
    // If next is not same as 'c'
    if (nextPrime(b) != c)
        return false;
 
    return true;
}
 
// Driver code for above functions
int main()
{
    if (areAdjacentPrimes(11, 13, 19))
        cout << "Yes";
    else
        cout << "No";
 
    return 0;
}
Java



// Java program to check given three numbers are
// primes are not.
 
import java.io.*;
import java.util.*;
 
class GFG
{
    public static boolean isPrime(int n)
    {
        // check if n is a multiple of 2
        if (n % 2 == 0)
            return false;
 
        // if not, then just check the odds
        for (int i = 3; i * i <= n; i += 2)
            if (n % i == 0)
                return false;
        return true;
    }
 
    // return next prime number
    public static int nextPrime(int start)
    {
        // start with next number.
        int next = start + 1;
 
        // breaks after finding next prime number
        while (!isPrime(next))
            next++;
 
        return next;
    }
 
    // check given three numbers are adjacent primes are not.
    public static boolean areAdjacentPrimes(int a, int b, int c)
    {
        // check given three numbers are primes are not.
        if (!isPrime(a) || !isPrime(b) || !isPrime(c))
            return false;
 
        // find next prime of a
        int next = nextPrime(a);
 
        // If next is not same as 'a'
        if (next != b)
            return false;
 
        // If next is not same as 'c'
        if (nextPrime(b) != c)
            return false;
 
        return true;
    }
 
    // Driver code for above functions
    public static void main (String[] args)
    {
        if (areAdjacentPrimes(11, 13, 19))
            System.out.print("Yes");
        else
            System.out.print("No");
    }
}
// Mohit Gupta_OMG <(o_0)>
Python



# Python3 program to check given 
# three numbers are primes are not.
 
# Function checks whether given number is prime or not.
def isPrime(n) :
    # Check if n is a multiple of 2
    if (n % 2 == 0) :
        return False
 
    # If not, then just check the odds
    i = 3
    while( i*i <= n) :
        if (n % i == 0) :
            return False
        i = i + 2
    return True
     
 
# Return next prime number
def nextPrime(start) :
    # Start with next number
    nxt = start + 1
     
    # Breaks after finding next prime number
    while (isPrime(nxt) == False) :
        nxt = nxt + 1
 
    return nxt
 
 
# Check given three numbers
# are adjacent primes are not
def areAdjacentPrimes(a, b, c) :
    # Check given three numbers are primes are not
    if (isPrime(a) == False or isPrime(b) == False
                            or isPrime(c) == False) :
        return False
 
    # Find next prime of a
    nxt = nextPrime(a)
 
    # If next is not same as 'a'
    if (nxt != b) :
        return False
 
    # If next is not same as 'c'
    if (nextPrime(b) != c) :
        return False
 
    return True
     
# Driver code for above functions
if (areAdjacentPrimes(11, 13, 19)) :
    print( "Yes"),
else :
    print( "No")
     
 
#This code is contributed by NIKITA TIWARI.
C#



// Java program to check given three numbers are
// primes are not.
using System;
 
class GFG
{
    public static bool isPrime(int n)
    {
        // check if n is a multiple of 2
        if (n % 2 == 0)
            return false;
 
        // if not, then just check the odds
        for (int i = 3; i * i <= n; i += 2)
            if (n % i == 0)
                return false;
        return true;
    }
 
    // return next prime number
    public static int nextPrime(int start)
    {
        // start with next number.
        int next = start + 1;
 
        // breaks after finding next prime number
        while (!isPrime(next))
            next++;
 
        return next;
    }
 
    // check given three numbers are adjacent primes are not.
    public static bool areAdjacentPrimes(int a, int b, int c)
    {
        // check given three numbers are primes are not.
        if (!isPrime(a) || !isPrime(b) || !isPrime(c))
            return false;
 
        // find next prime of a
        int next = nextPrime(a);
 
        // If next is not same as 'a'
        if (next != b)
            return false;
 
        // If next is not same as 'c'
        if (nextPrime(b) != c)
            return false;
 
        return true;
    }
 
    // Driver code
    public static void Main ()
    {
        if (areAdjacentPrimes(11, 13, 19))
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
}
 
// This article is contributed by vt_m.
PHP



<?php
// PHP program to check given
// three numbers are primes or not.
 
// checks whether given
// number is prime or not.
function isPrime($n)
{
    // check if n is
    // a multiple of 2
    if ($n % 2 == 0)
        return false;
 
    // if not, then just
    // check the odds
    for ($i = 3; $i * $i <= $n; $i += 2)
        if ($n % $i == 0)
            return false;
    return true;
}
 
// return next prime number
function nextPrime($start)
{
    // start with next number.
    $next = $start + 1;
 
    // breaks after finding
    // next prime number
    while (!isPrime($next))
        $next++;
 
    return $next;
}
 
// check given three numbers
// are adjacent primes are not.
function areAdjacentPrimes($a, $b, $c)
{
    // check given three numbers
    // are primes are not.
    if (!isPrime($a) || !isPrime($b) ||
                        !isPrime($c))
        return false;
 
    // find next prime of a
    $next = nextPrime($a);
 
    // If next is not same as 'a'
    if ($next != $b)
        return false;
 
    // If next is
    // not same as 'c'
    if (nextPrime($b) != $c)
        return false;
 
    return true;
}
 
// Driver code
if (areAdjacentPrimes(11, 13, 19))
    echo "Yes";
else
    echo "No";
 
// This article is contributed by mits
?>
Javascript



<script>
 
// JavaScript program to check given
// three numbers are
// primes are not.
 
    function isPrime(n)
    {
        // check if n is a multiple of 2
        if (n % 2 == 0)
            return false;
   
        // if not, then just check the odds
        for (let i = 3; i * i <= n; i += 2)
            if (n % i == 0)
                return false;
        return true;
    }
   
    // return next prime number
    function nextPrime(start)
    {
        // start with next number.
        let next = start + 1;
   
        // breaks after finding next prime number
        while (!isPrime(next))
            next++;
   
        return next;
    }
   
    // check given three numbers are
    // adjacent primes are not.
    function areAdjacentPrimes(a, b, c)
    {
        // check given three numbers are primes are not.
        if (!isPrime(a) || !isPrime(b) || !isPrime(c))
            return false;
   
        // find next prime of a
        let next = nextPrime(a);
   
        // If next is not same as 'a'
        if (next != b)
            return false;
   
        // If next is not same as 'c'
        if (nextPrime(b) != c)
            return false;
   
        return true;
    }
 
// Driver code
         
        if (areAdjacentPrimes(11, 13, 19))
            document.write("Yes");
        else
            document.write("No");
         
</script>
Output : 
No
 

My Personal Notes
arrow_drop_up
Previous
Python Dictionary | Check if binary representations of two numbers are anagram
Next

PHP rand() Function
Recommended Articles
Page :
Nth Term of a Fibonacci Series of Primes formed by concatenating pairs of Primes in a given range
07, Aug 20
Length of largest sub-array having primes strictly greater than non-primes
12, Oct 18
Count primes that can be expressed as sum of two consecutive primes and 1
12, Feb 19
Count of primes below N which can be expressed as the sum of two primes
09, Dec 19
Check whether triangle is valid or not if three points are given
16, May 20
Check whether a number has exactly three distinct factors or not
09, Oct 17
Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
22, Jan 19
Number of quadruples where the first three terms are in AP and last three terms are in GP
01, Mar 19
Check whether an array can be made strictly increasing by incrementing and decrementing adjacent pairs
09, Dec 21
Check whether the sum of absolute difference of adjacent digits is Prime or not
15, Jan 19
Find the prime numbers which can written as sum of most consecutive primes
01, Dec 16
K-Primes (Numbers with k prime factors) in a range
05, Dec 17
Count numbers which can be represented as sum of same parity primes
09, Sep 18
Count numbers < = N whose difference with the count of primes upto them is > = K
19, Dec 18
Count of N digit numbers which contains all single digit primes
05, Aug 21
Check if a number is sandwiched between primes
31, Jan 18
Check if an integer can be expressed as a sum of two semi-primes
22, Oct 18
Check if the sum of primes is divisible by any prime from the array
17, Dec 18
Check if all nodes of the Binary Tree can be represented as sum of two primes
11, Jun 20
Check whether the given numbers are Cousin prime or not
29, Oct 18
Check whether XOR of all numbers in a given range is even or odd
23, Jan 19
Program for Goldbach’s Conjecture (Two Primes with given Sum)
06, Mar 17
Sum of all Primes in a given range using Sieve of Eratosthenes
17, Oct 18
Maximum Primes whose sum is equal to given N
06, Mar 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
pawan_asipu
@pawan_asipu
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!