perplexus.info :: Numbers : Recursive Definition

Home > Numbers

Recursive Definition (Posted on 2005-09-09)

Define H(m,n) for m≥n≥0 by

H(m,n)=1, if n≤1

H(m,n)=Σ_i=1..nH(m-i,minimum(i,m-i)), if n>1

For any integer k>0, what do you think H(k,k) represents?

See The Solution Submitted by Bractals

No Rating

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
Puzzle Thoughts	K Sengupta	2023-07-16 01:15:38
re(2): But can I prove it? -- Visualization-- informal proof	Charlie	2005-09-10 13:35:16
re: But can I prove it?	Tristan	2005-09-10 04:33:17
But can I prove it?	Jer	2005-09-09 16:52:56
just a little resume to think later	pcbouhid	2005-09-09 15:56:09
Looking at Charlie´s posting..	pcbouhid	2005-09-09 15:23:06
No Subject	pcbouhid	2005-09-09 15:19:00
Some Numbers	Charlie	2005-09-09 15:07:15

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info