Given three non-negative integers a, d and x. Here, a is the first element, d is the difference of an AP (Arithmetic Progression). We need to find if x is part of given AP or not.**Examples :**

Input : a = 1, d = 3, x = 7 Output : Yes 7 is part of given AP, 1 + 3 + 3 = 7 Input : a = 10, d = 0, x = 10 Output : Yes

Firstly, in case d = 0, we should output Yes if a = x else answer is No. For non-zero d, if x belongs to sequence x = a + n * d where n is non-negative integer, only if (n – a) / c is non-negative integer.

## C++

`// C++ program to check if x exist` `// or not in the given AP.` `#include <bits/stdc++.h>` `using` `namespace` `std;` `// returns yes if exist else no.` `bool` `isMember(` `int` `a, ` `int` `d, ` `int` `x)` `{` ` ` `// If difference is 0, then x must` ` ` `// be same as a.` ` ` `if` `(d == 0)` ` ` `return` `(x == a);` ` ` `// Else difference between x and a` ` ` `// must be divisible by d.` ` ` `return` `((x - a) % d == 0 && (x - a) / d >= 0);` `}` `// Driver code.` `int` `main()` `{` ` ` `int` `a = 1, x = 7, d = 3;` ` ` `if` `(isMember(a, d, x))` ` ` `cout << ` `"Yes"` `;` ` ` `else` ` ` `cout << ` `"No"` `;` ` ` `return` `0;` `}` |

*chevron_right*

*filter_none*

## Java

`// Java program to check if x exist` `// or not in the given AP.` `class` `GFG {` ` ` `// returns yes if exist else no.` ` ` `static` `boolean` `isMember(` `int` `a, ` `int` `d, ` `int` `x)` ` ` `{` ` ` `// If difference is 0, then x must` ` ` `// be same as a.` ` ` `if` `(d == ` `0` `)` ` ` `return` `(x == a);` ` ` `// Else difference between x and a` ` ` `// must be divisible by d.` ` ` `return` `((x - a) % d == ` `0` `&& (x - a) / d >= ` `0` `);` ` ` `}` ` ` `// Driver code.` ` ` `public` `static` `void` `main(String args[])` ` ` `{` ` ` `int` `a = ` `1` `, x = ` `7` `, d = ` `3` `;` ` ` `if` `(isMember(a, d, x))` ` ` `System.out.println(` `"Yes"` `);` ` ` `else` ` ` `System.out.println(` `"No"` `);` ` ` `}` `}` `// This code is contributed by Nikita Tiwari` |

*chevron_right*

*filter_none*

## Python3

`# Python3 code to check if x exist ` `# or not in the given AP.` `def` `isMember(a, d, x):` ` ` ` ` `# If difference is 0, then x` ` ` `# must be same as a.` ` ` `if` `d ` `=` `=` `0` `:` ` ` `return` `x ` `=` `=` `a` ` ` ` ` `# Else difference between x ` ` ` `# and a must be divisible by d.` ` ` `return` `((x ` `-` `a) ` `%` `d ` `=` `=` `0` `and` ` ` `int` `((x ` `-` `a) ` `/` `d) >` `=` `0` `)` `# Driver code` `a ` `=` `1` `x ` `=` `7` `d ` `=` `3` `if` `isMember(a, d, x):` ` ` `print` `( ` `"Yes"` `)` `else` `:` ` ` `print` `(` `"No"` `)` `# This code is contributed by "Abhishek Sharma 44"` |

*chevron_right*

*filter_none*

## C#

`// C# program to check if x exist` `// or not in the given AP.` `using` `System;` `class` `GFG {` ` ` `// returns yes if exist else no.` ` ` `static` `bool` `isMember(` `int` `a, ` `int` `d, ` `int` `x)` ` ` `{` ` ` `// If difference is 0, then x must` ` ` `// be same as a.` ` ` `if` `(d == 0)` ` ` `return` `(x == a);` ` ` `// Else difference between x and a` ` ` `// must be divisible by d.` ` ` `return` `((x - a) % d == 0 && (x - a) / d >= 0);` ` ` `}` ` ` `// Driver code.` ` ` `public` `static` `void` `Main()` ` ` `{` ` ` `int` `a = 1, x = 7, d = 3;` ` ` `if` `(isMember(a, d, x))` ` ` `Console.WriteLine(` `"Yes"` `);` ` ` `else` ` ` `Console.WriteLine(` `"No"` `);` ` ` `}` `}` `// This code is contributed by vt_m.` |

*chevron_right*

*filter_none*

## PHP

`<?php` `// PHP program to check ` `// if x exist or not in ` `// the given AP.` `// returns yes if exist ` `// else no.` `function` `isMember(` `$a` `, ` `$d` `, ` `$x` `)` `{` ` ` `// If difference is 0, then ` ` ` `// x must be same as a` ` ` `if` `(` `$d` `== 0)` ` ` `return` `(` `$x` `== ` `$a` `);` ` ` `// Else difference between x` `// and a must be divisible by d. ` `return` `((` `$x` `- ` `$a` `) % ` `$d` `== 0 && ` ` ` `(` `$x` `- ` `$a` `) / ` `$d` `>= 0);` `}` `// Driver code.` `$a` `= 1; ` `$x` `= 7; ` `$d` `= 3;` `if` `(isMember(` `$a` `, ` `$d` `, ` `$x` `))` ` ` `echo` `"Yes"` `;` `else` ` ` `echo` `"No"` `;` `// This code is contributed by aj_36` `?>` |

*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:

- Split the number into N parts such that difference between the smallest and the largest part is minimum
- Find the real and imaginary part of a Complex number
- Partition N into M parts such that difference between Max and Min part is smallest
- Number of ways to split a binary number such that every part is divisible by 2
- Divide a sorted array in K parts with sum of difference of max and min minimized in each part
- Find a number M < N such that difference between their XOR and AND is maximum
- Array formed from difference of each element from the largest element in the given array
- Pair of integers with difference K having an element as the K-th multiple of the other
- Count of pairs with difference at most K with no element repeating
- Minimize sum of adjacent difference with removal of one element from array
- Min and max length subarray having adjacent element difference atmost K
- Longest subarray in which absolute difference between any two element is not greater than X
- Largest subset where absolute difference of any two element is a power of 2
- Find the element that appears once
- Find K for every Array element such that at least K prefixes are ≥ K
- Find First element in AP which is multiple of given prime
- Find the Kth position element of the given sequence
- Find the maximum element in the array other than A
_{i} - Find the element at R'th row and C'th column in given a 2D pattern
- Find Second largest element in an array | Set 2

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.