Recursive relation using successor function

What is the recursive relation for H(m)=2^(m^2) using successor function recursive relation for multiplication: mult(x,0)=0; mult(x,S(y))=add(x,mult(x,y)) recursive relation for addition: add(x,0)=x; add(x,S(y))=S(add(x,y)) H function is a composite function, I want to come up with recursive relation for that function. Thanks much in advance!!!

edited Feb 3 at 15:53

asked Feb 3 at 15:01

Karapet
15●2

	This is more appropriate to ask a math.stackexchange, as this is not a research-level question. – Per Alexandersson Feb 3 at 17:19
	Hint: $(m+1)^2=m^2+2m+1$ – François G. Dorais♦ Feb 3 at 19:17

Browse other questions tagged recurrences computability-theory lambda-calculus or ask your own question.

question feed

Recursive relation using successor function

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Your Answer

Browse other questions tagged recurrences computability-theory lambda-calculus or ask your own question.

Welcome to MathOverflow

How to write math

Recursive relation using successor function

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Your Answer

Browse other questions tagged recurrences computability-theory lambda-calculus or ask your own question.

Welcome to MathOverflow

Related

How to write math