human
Check whether given three numbers are adjacent primes | Function checks whether given number is prime or not ..
Check if n is a multiple of 2.
If not , then just check the odds.
Return next prime number.
Start with next number.
Breaks after finding next prime number.
Check given three numbers are adjacent primes are not.
Check given three numbers are primes are not.
Find next prime of a.
If next is not same as 'a.
If next next is not same as 'c.
Driver code for above functions"
Solution in Python:
 ... What is a code to check whether given three numbers are adjacent primes and the other steps required?
assistant
#Here is code to check whether given three numbers are adjacent primes and the other steps required.
 def isPrime ( n ) :
	if ( n % 2 == 0 ) :
		return False
	i = 3
	while ( i * i <= n ) :
		if ( n % i == 0 ) :
			return False
		i = i + 2
	return True
def nextPrime ( start ) :
	nxt = start + 1
	while ( isPrime ( nxt ) == False ) :
		nxt = nxt + 1
	return nxt
def areAdjacentPrimes ( a , b , c ) :
	if ( isPrime ( a ) == False or isPrime ( b ) == False or isPrime ( c ) == False ) :
		return False
	nxt = nextPrime ( a )
'
	if ( nxt != b ) :
		return False
'
	if ( nextPrime ( b ) != c ) :
		return False
	return True
if ( areAdjacentPrimes ( 11 , 13 , 19 ) ) :
	print ( " Yes " ) ,
else :
	print ( " No " )