[Aim of this article: This post propose a problem and gives an approach to solve it.]
Our problem will go like this:
Take any number , and then, take , where and . Find the number of possible choices for and when ? Order doesn’t matter, e.g. and is same as and .
To solve this problem, first lets tabulate the natural number and its sum as;
From the above pattern, we can say;
When is odd, number of possibilities is
When is even, number of possibilities is
And hence, the answer is 49 because is even.
If the pattern goes like this then, we can say these formulae are reliable. But if the pattern will break after some natural number then, it won’t work. This means we need a theorem! If anyone could find(or invent) the theorem in regards to this problem. Please do comment below! And also, if you have another method to solve it. Please let me know!
One can find a wonderful discussion on my(this) problem at Mathematics Stack Exchange:
Still, need to go further
Perhaps one may find this problem very simple. But, I have another similar but extended problem for you. And the problem states like this:
Take any number , and then, take where and . Find the number of possible choices for , and when ?
Order doesn’t matter, e.g. you can do: or or or or or . But you cannot do: or or or or or or or or soon.
Looks like we also need general theorem for which we can solve any extended problem. I’m leaving these problems to you on the behalf of willing to see its solution. Best of luck!
If you guys have some questions, comments, or insults then, please don’t hesitate to shot me an email or comment below.
Want to share this post?