Question: Task G. Largest twin prime in range Add a function int largestTwinPrime(int a, int b); that returns the largest twin prime in the range a
Task G. Largest twin prime in range Add a function int largestTwinPrime(int a, int b); that returns the largest twin prime in the range a N b. If there is no twin primes in range, then return -1. For example: largestTwinPrime(5, 18) == 17 largestTwinPrime(1, 31) == 31 largestTwinPrime(14, 16) == -1 Change the main function to test the new code. Please, it is necessary to use the functions and names given. Thanks.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
