What Do You Know About The Successor Function?
10 Questions
Settings
-
+
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.
Questions and Answers
- 1.How do we denote the successor function?
- A.
Sn = n + 1
- B.
Sn = n - 1
- C.
Sn = n * 1
- D.
Sn = n/1
- 2.What does S(1) equal to?
- A.
0
- B.
1
- C.
2
- D.
-1
- 3.What does S(5) equal to?
- A.
6
- B.
4
- C.
5
- D.
3
- 4.What does S(10) equal to?
- A.
9
- B.
10
- C.
5
- D.
11
- 5.What does S(20) equal to?
- A.
18
- B.
20
- C.
21
- D.
25
- 6.What is another name for the successor function?
- A.
Implementation
- B.
Zeration
- C.
Zeroth functions
- D.
Geometric functions
- 7.Which kind of functions is the successor function used for?
- A.
Recurrence function
- B.
Recursive function
- C.
Reorganized function
- D.
Inordinate function
- 8.How do we define the successor function in the context of zeroth hyperoperation?
- A.
H0 (a, b) = 1 + a
- B.
H0 (a, b) = 1 + b
- C.
H1 (a, b) = a + b
- D.
H2 (a, b) = a * b
- 9.In which of these axioms do we apply the successor function?
- A.
Peano axioms
- B.
Richardson axioms
- C.
Patt axioms
- D.
Corolla axioms
- 10.n stands for?
- A.
Real number
- B.
Whole number
- C.
Integer
- D.
Natural number
Back to top