*******************************************************************
Problem: Enumerate the number of solutions of the equation
such that
Lets suppose
*************************
The flipside of this is simple. How many solutions with each
***********************************************************************
solution: Suppose
Let
(i) only one of the entries has size
(ii) For two,
and so on.
Summing up individually we get
Hence the number of solutions with the given restriction is
1 comment:
The final simple form hints a easy solution without all this circus ... anybody can think of a easy proof ?
Post a Comment