Given two integers, **A** and **B**, the task is to find whether it is possible to make **A** equal to **B** if you are allowed to subtract a prime number **P** any number of times from **A**.**Examples:**

Input:A = 10, B = 4Output:YESExplanation:

Let P = 2 and after subtracting it

three times from AInput:A = 41, B = 40Output:NO

**Approach:** The key observation in the problem is we have to represent the number A as

, As we know every number is divisible by some prime number except 1. Therefore if we find the difference of the number

and if the difference is greater than 1 then both the number can be made equal by subtracting a prime number X times from A.

Below is the implementation of the above approach:

## C++

`// C++ implementation to find if ` `// it is possible to make a equal to b ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find if ` `// it is possible to make ` `// A equal to B ` `bool` `isPossible(` `int` `A, ` `int` `B) ` `{ ` ` ` `return` `(A - B > 1); ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `int` `A = 10, B = 4; ` ` ` ` ` `// Function Call ` ` ` `if` `(isPossible(A, B)) ` ` ` `cout << ` `"Yes"` `; ` ` ` `else` ` ` `cout << ` `"No"` `; ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation to find if ` `// it is possible to make a equal to b ` `class` `GFG{ ` ` ` `// Function to find if ` `// it is possible to make ` `// A equal to B ` `static` `boolean` `isPossible(` `int` `A, ` `int` `B) ` `{ ` ` ` `return` `(A - B > ` `1` `); ` `} ` ` ` `// Driver Code ` `public` `static` `void` `main (String[] args) ` `{ ` ` ` `int` `A = ` `10` `, B = ` `4` `; ` ` ` ` ` `// Function Call ` ` ` `if` `(isPossible(A, B)) ` ` ` `System.out.print(` `"Yes"` `); ` ` ` `else` ` ` `System.out.print(` `"No"` `); ` `} ` `} ` ` ` `// This code is contributed by shivanisinghss2110 ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation to find if ` `# it is possible to make a equal to b ` ` ` `# Function to find if ` `# it is possible to make ` `# A equal to B ` `def` `isPossible(A, B): ` ` ` ` ` `return` `(A ` `-` `B > ` `1` `); ` ` ` `# Driver Code ` `A ` `=` `10` `; B ` `=` `4` `; ` ` ` `# Function Call ` `if` `(isPossible(A, B)): ` ` ` `print` `(` `"Yes"` `); ` `else` `: ` ` ` `print` `(` `"No"` `); ` ` ` `# This code is contributed by Code_Mech` |

*chevron_right*

*filter_none*

## C#

`// C# implementation to find if ` `// it is possible to make a equal to b ` `using` `System; ` `class` `GFG{ ` ` ` `// Function to find if ` `// it is possible to make ` `// A equal to B ` `static` `bool` `isPossible(` `int` `A, ` `int` `B) ` `{ ` ` ` `return` `(A - B > 1); ` `} ` ` ` `// Driver Code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `A = 10, B = 4; ` ` ` ` ` `// Function Call ` ` ` `if` `(isPossible(A, B)) ` ` ` `Console.Write(` `"Yes"` `); ` ` ` `else` ` ` `Console.Write(` `"No"` `); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

**Output:**

Yes

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.

## Recommended Posts:

- Check if a number is Prime, Semi-Prime or Composite for very large numbers
- Check if a prime number can be expressed as sum of two Prime Numbers
- Check if a number is divisible by all prime divisors of another number
- Check if N is a Balanced Prime number or not
- Check whether N is a Dihedral Prime Number or not
- Check whether a number is circular prime or not
- Check if a number is a Pythagorean Prime or not
- Check whether the given number is Wagstaff prime or not
- Check if a number is Primorial Prime or not
- Check if the first and last digit of number N is prime and their sum is less than K
- C Program to Check Whether a Number is Prime or not
- Check if a number is Full Prime
- Check a number for Permutable Prime
- Check if a number is Quartan Prime or not
- Check if N is a Weak Prime number or not
- Check whether a number is Good prime or not
- Check if the number is a Prime power number
- Check if there exists a number with X factors out of which exactly K are prime
- Check if a number can be written as a sum of 'k' prime numbers
- Check if all Prime factors of number N are unique or not

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.