All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Recursive Definition (Posted on 2005-09-09) Difficulty: 4 of 5
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: ( Back to comment list | You must be logged in to post comments.)
    Puzzle Thoughts Comment 8 of 8 |
    H(n, n) = |S(n)|
      Posted by K Sengupta on 2023-07-16 01:15:38
    Please log in:
    Login:
    Password:
    Remember me:
    Sign up! | Forgot password


    Search:
    Search body:
    Forums (1)
    Newest Problems
    Random Problem
    FAQ | About This Site
    Site Statistics
    New Comments (6)
    Unsolved Problems
    Top Rated Problems
    This month's top
    Most Commented On

    Chatterbox:
    Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information