In the science of structure, order, and relation otherwise known as mathematics, the successor function is a primitive recursive function S in a way that S(n) = n+1 for n, each natural number.
The successor function is also known as the successor operation and in the context of a zeroth hyperoperation, it is called zeration.
Sn = n + 1
Sn = n - 1
Sn = n * 1
Sn = n/1
Rate this question:
0
1
2
-1
Rate this question:
6
4
5
3
Rate this question:
9
10
5
11
18
20
21
25
Rate this question:
Implementation
Zeration
Zeroth functions
Geometric functions
Rate this question:
Recurrence function
Recursive function
Reorganized function
Inordinate function
Rate this question:
H0 (a, b) = 1 + a
H0 (a, b) = 1 + b
H1 (a, b) = a + b
H2 (a, b) = a * b
Rate this question:
Peano axioms
Richardson axioms
Patt axioms
Corolla axioms
Rate this question:
Real number
Whole number
Integer
Natural number
Rate this question:
Wait!
Here's an interesting quiz for you.