3 votes 3 votes In a country, there are coins of denominations ${$2}$, ${$3}$ and ${$7}$. How many different ways are there to pay exactly ${$10}$ ? Combinatory combinatory + – Akriti sood asked Nov 7, 2016 • retagged Jun 27, 2017 by Arjun Akriti sood 653 views answer comment Share Follow See 1 comment See all 1 1 comment reply dd commented Dec 22, 2016 reply Follow Share Different answers depending on order of giving coins of sum total 10.... and unordered collection of rs 10 1 votes 1 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes Actually no need of involving generating function here. Can be done simply by partitioning. But I did in the following way, dd answered Dec 22, 2016 • selected Dec 22, 2016 by Akriti sood dd comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Akriti sood commented Dec 22, 2016 reply Follow Share @kapil,can you tell me the approach for partitioning method..?? is it simply (7+3) ,(2+2+2+2+2), (2+2+3+3)..? is this the partitioning method?? 0 votes 0 votes Kapil commented Dec 22, 2016 reply Follow Share Yes, its for people who don't know generating functions, like me :) And then simply apply permutations . 1 votes 1 votes dd commented Dec 22, 2016 reply Follow Share Doing in short method for a particular problem at hand is always appreciated 0 votes 0 votes Please log in or register to add a comment.