Given two numbers A and B. The task is to find the smallest positive integer greater than or equal to 1 such that the sum of all three numbers become a prime number.
Input: A = 2, B = 3
The third number is 2 because if we add all three number the
sum obtained is 7 which is a prime number.
Input: A = 5, B = 3
- First of all store the sum of given 2 number in sum variable.
- Now, check if bitwise and (&) of sum and 1 is equal to 1 or not (checking if the number is odd or not).
- If it is equal to 1 then assign 2 to variable temp and go to step 4.
- Else check sum value of sum and temp variable whether it is prime number or not. If prime, then print the value of temp variable else add 2 to temp variable untill it is less than a prime value.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Insert minimum number in array so that sum of array becomes prime
- Number formed by deleting digits such that sum of the digits becomes even and the number odd
- Finding sum of digits of a number until sum becomes single digit
- Find minimum value to assign all array elements so that array product becomes greater
- Minimum value to be assigned to the elements so that sum becomes greater than initial sum
- Remove characters from a numeric string such that string becomes divisible by 8
- Remove minimum elements from the array such that 2*min becomes more than max
- Find all numbers between range L to R such that sum of digit and sum of square of digit is prime
- Find three prime numbers with given sum
- Number of quadruples where the first three terms are in AP and last three terms are in GP
- Add minimum number to an array so that the sum becomes even
- Count all prime numbers in a given range whose sum of digits is also prime
- Permutation of first N positive integers such that prime numbers are at prime indices
- Permutation of first N positive integers such that prime numbers are at prime indices | Set 2
- Find three integers less than or equal to N such that their LCM is maximum
- Rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space
- Change K elements so that (a1^2 + a2^2 + …+ aN^2 ) <= (a1 + a2 +…+ aN) becomes true
- Probability of getting more value in third dice throw
- Third last digit in 5^N for given N
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.