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

Home > Numbers
Distinct Trapezoidal Decompositions? (Posted on 2025-02-03) Difficulty: 3 of 5
How many distinct trapezoidal decompositions (sum of consecutive positive integers) does n have?

For example, 15 = 7+8 = 4+5+6 = 1+2+3+4+5 has three.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
No SubjectCharlie2025-02-04 10:22:17
SolutionSolutionBrian Smith2025-02-03 13:15:13
Some ThoughtsNot a closed form, but ...Larry2025-02-03 10:39:28
Solutioncomputer-aided solutionCharlie2025-02-03 08:34:28
 Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:

blackjack

flooble's webmaster puzzle

Copyright © 2002 - 2025 by Animus Pactum Consulting. All rights reserved. Privacy Information