Common · Knowledge
Successor function
Elementary operation on a natural number
In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by S {\displaystyle S} , so S ( n ) = n + 1 {\displaystyle S(n)=n+1} . For example, S ( 1 ) = 2 {\displaystyle S(1)=2} and S ( 2 ) = 3 {\displaystyle S(2)=3} .
From Wikipedia
In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by S {\displaystyle S} , so S ( n ) = n + 1 {\displaystyle S(n)=n+1} . For example, S ( 1 ) = 2 {\displaystyle S(1)=2} and S ( 2 ) = 3 {\displaystyle S(2)=3} . The successor function is one of the basic components used to build a primitive recursive function. Successor operations are also known as zeration in the context of a zeroth hyperoperation. In this context, the extension of zeration is addition, which is defined as repeated succession.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
★
Sum-of-divisors function
Arithmetic function mapping a positive integer to the sum of all its positive divisors (including itself)
-
★★★★
Function (mathematics)
Association of a single output to each input
-
n★
number of divisors
Number of different natural numbers that evenly divide the given number
-
★
Padovan sequence
Sequence of integers
-
★★★★
Natural exponential function
Exponential function with base e, denoted exp(x) or e^x
-
L★
Legendre's formula
Number theory expression