1050 = 52.7.2.3
So basically we need to divide the 2 fives 1 seven 1two and 1 three into four groups... (each term separately i.e. 2 fives into 4 grps, 1 seven into four grps .....)
So, the no. of ways is:
5C2.4C1.4C1.4C1
Can anybody show the solution to this question.....
total no. of integral solution to abcd=1050
1050 = 52.7.2.3
So basically we need to divide the 2 fives 1 seven 1two and 1 three into four groups... (each term separately i.e. 2 fives into 4 grps, 1 seven into four grps .....)
So, the no. of ways is:
5C2.4C1.4C1.4C1
for integral solution, you have missed the answer asishi..
the answer will be based on -ves as well....
also, the pwer fo 2 can be used in 4 ways, 3 in 4 ways and 7 in 4 ways..
we have a 5 power 2 which needs to be distributed among 4 slots...
this can be done in 4+6-10 ways
Moreover for each solution, there can be + or - too
The number of +Ve solutions will be 10x4x4x4=640
No of all integer solutions will be given by 640x(1+1+6)
1 for all +ve, 1 for all -ves, 4C2 for 2 positives and 2 -ves...
A simpler logic would probably have been that the first three can be + or -, the last (d) has to be be such that it has to give a +ve product..
so for a, b and c we have 2 choices each.. for d we have one unique choice (in terms of the power of -1)
So you can mulitply 640 by 8
thnx nishant byah and ashish......... but nobody pointed out a method to solve it by mutinomila theorem!!!