I've successfully proven $A(x,y)$ for some fixed x and any y with induction but I'm having a hard time proving this for any x and y. I think the next useful step would be proving $A(x,0)= 2[x]3-3 $ but I still having trouble proving it... The definition of $A(x,y)=$ $$\begin{eqnarray*} A(0,y) &=& y+1 \\ A(x+1,0) &=& A(x,1) \\ A(x+1,y+1) &=& A(x,A(x+1,y)) \end{eqnarray*}$$
2026-02-23 00:02:07.1771804927
Prove $A(x,y)= 2[x](y+3)-3$. Where A is the Ackermann-Peter function and [x] is x-th hyperoperator.
196 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INDUCTION
- Show that the sequence is bounded below 3
- Fake induction, can't find flaw, every graph with zero edges is connected
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
- Prove $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$ using binomial and induction
- Induction proof of Fibonacci numbers
- The Martian Monetary System
- How to format a proof by induction
- $x+\frac{1}{x}$ is an integer
- Help with induction proof please! For an integer $n, 3$ divides $n^3-n$
- Proving $\sum_{k=1}^n kk!=(n+1)!−1$
Related Questions in COMPUTABILITY
- Are all infinite sets of indices of computable functions extensional?
- Simple applications of forcing in recursion theory?
- Proof of "Extension" for Rice's Theorem
- How to interpret Matiyasevich–Robinson–Davis–Putnam in term of algebraic geometry or geometry?
- Does there exist a weakly increasing cofinal function $\kappa \to \kappa$ strictly below the diagonal?
- Why isn't the idea of "an oracle for the halting problem" considered self-contradictory?
- is there any set membership of which is not decidable in polynomial time but semidecidable in P?
- The elementary theory of finite commutative rings
- Is there any universal algorithm converting grammar to Turing Machine?
- Is the sign of a real number decidable?
Related Questions in RECURSION
- Solving discrete recursion equations with min in the equation
- Recognizing recursion relation of series that is solutions of $y'' + y' + x^2 y = 0$ around $x_0 = 0$.
- Ackermann Function for $(2,n)$
- Primitive recursive functions of bounded sum
- Ackermann Function for $f(2,n)$ as compared to $f(5,1)$
- Determinant of Block Tridiagonal Matrix
- In how many ways can the basketball be passed between four people so that the ball comes back to $A$ after seven passes? (Use recursion)
- Finding a recursive relation from a differential equation.
- A recursive divisor function
- Are these numbers different from each other?
Related Questions in ACKERMANN-FUNCTION
- Ackermann Function for $(2,n)$
- Ackermann Function for $f(2,n)$ as compared to $f(5,1)$
- Ackermann function proof by Induction
- Ackermann function property for positive $n$
- Is there an equation $f(k,m,n)=n$ where $n$ is the number of applications of the Ackermann function needed?
- Is it known for which pairs of integers Ackermann 's function is commutative?
- Tetration induction proof
- proof that Ackermannfunction is uniquely defined and finding algorithm without recursions to calculate its values
- Extending Knuth up-arrow/hyperoperations to non-positive values
- Just how slowly does $\alpha^*(n)$ grow?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
First, you may see that for all $x$, $2[x]2=4$ for all $x>0$
For $x=0$ $$2[0](y+3 )-3=y+4-3=y+1=A(0,y)$$
Now, by induction on $x$, I suppose this is true for $x$ : $A(x,y)=2[x](y+3 )-3$
For $x+1$
$$A(x+1,0)=A(x,1)=2[x]4-3=2[x](2[x]2)-3=2[x+1]3-3$$
(This is also true when $x=0$, because $A(1,0)=2=5-3=2[1]3-3$)
Now by induction on $y$ :
\begin{align} A(x+1,y+1)&=A(x,A(x+1,y))\\ &=2[x]\bigl(2[x+1](y+3 )-3+3\bigr)-3\\ &=2[x]\bigl(2[x+1](y+3 )\bigr)-3\\ &=2[x+1](y+4 )-3\\ \end{align}