5 items are filed under this topic.








Partitions into distinct parts 
20150919 

From Brian: Looking for a formula where I can type in a number, 17 for example, and using the numbers 1 through 17 (1, 2, 3, 4 etc....), to come up with all possible combinations, when added, that will equal 17. And each number can only be used once. I've tried a few search engines but my computer stares at me blankly and scratches its head :/. Answered by Chris Fisher. 





Restricted partitions 
20130325 

From vidya: I am having a series of numbers eg.( 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15)
I can take any 5 digits eg(15,10,8,6,5) and it should not repeat and the summation should be any predefined static value . eg(44)
That is (15+10+8+6+5=44) . How many summation series will result 44 ?
My problem is how to find this using a formula or any other simpler automation method is there instead of checking one by one all the combinations.
Plz do help me... Thnks in advance Answered by Chris Fisher. 





Partitioning a clock face 
20071219 

From Kim: Using a clock with a regular circular faced dial, draw two straight lines such that the sum
of the numbers in each of the three areas is equal. Answered by The team at Math Central. 





Dividing a circle 
20071123 

From matt: hi. can you please send me a diagram of how to draw 3 lines in a circle to get 8 sections. Answered by Stephen La Rocque. 





Two problems 
20021014 

From Eva:
a) How many different equivalence relations can be defined on the set X={a,b,c,d}? b)Show that 6 divides the product of any 3 consecutive integers. I know it is true that 6 divides the product of any 3 consecutive integers. However, i have problem showing the proof. Answered by Leeanne Boehm and Penny Nom. 


