Question

1xy" - dx dy
T(m)(n)
h"+" Over D
T(1 + m + n)​

Answer 1

Answer:

Pranay wants to stack few one-rupee coins and some five-rupee coins in such a way that:

a. Each stack has the same number of coins.

b. There is least number of stacks.

c. Each stack either has one rupee or five-rupee coins.

d. No coins are left over after creating stacks.

His first step to find the number of coins that should be in each stack is 195=1(180) +15. Given that he

has more of five-rupee coins than one-rupee coins, how many one-rupee coins stack can he make?

Answer 2

Answer:

plz in which class this question is related?????