How to Find Predecessor and Successor?

Each integer has only one successor and one predecessor, where the successor is on the right side of the number line and the predecessor is on the left side of the number line. Therefore, the given whole number is 2, a predecessor of 2 is 1 and a successor of 2 is 3.

We add 1 to any integer and subtract 1 from any integer to find its successor and predecessor respectively i.e.,

• To find Successor of any Integer we can use the formula i.e., S(n) = n + 1. Where n is the number for which successor is required.

• To find Predecessor of any Interger we can use the formula i.e., P(n) = n – 1. Where n is the number for which predecessor is required.

How to Find the Predecessor of Integer?

To find the predecessor of any integer we can use the formulas discuss below:

Predecessor = Given Number – 1 i.e., n – 1

Where n is the given number.

For example, If you want to find the predecessor of 22, you would precede it by subtraction

i.e., Predecessor = Given Number – 1 = 22 – 1 = 21

Similarly, If you have any other whole number, you can apply the same formula for precedes one less than the given number in the sequence.

How to Find the Successor of any number?

To find the sucessor of any integer we can use the formulas discuss below:

Successor = Given Number + 1 i.e., (n+1)

Where n is the given number.

For example, If you want to find the Successor of 22, you would succeed it by Addition:

Successor = Given Number + 1 = 22 + 1 = 23.
Similarly, If you have any other whole number, you can apply the same formula for Succeeding one more than the given number in the sequence.

In mathematics, Predecessor and Successor are terms used to describe numbers that come before and after a given number. For example, the successor of 2 is 3, and the predecessor of 2 is 1. Predecessor and Successor are important terminologies used in mathematics as well as computer science.

In this article, we will discuss both Predecessor and Successor in detail including their definitions, examples as well as methods to find Predecessor and Successor.