Write the sum of intercepts cut off by the plane r.(2i+j-k)-2=0 on the three axes
Answers
Answered by
1
You are given some denominations of coins in an array (int denom[])and infinite supply of all of them. Given an amount (int amount), find the minimum number of coins required to get the exact amount. What is the method called?
Answered by
1
Step-by-step explanation:
Put r vector = xi^ + yj^ + zk^
2x+y-z=2
x/1 + y/2 + z/-2 = 1
a= 1, b = 2, c = - 2
SUM of intercepts = 1+2-2 = 1
Similar questions