HARRISON'S 3 FRIENDS

Level pending

Harrison has 3 friends. If N is the number of ways he can invite one friend everyday for dinner on 6 successive nights so that no friend is invited more than 3 times, the what is the value of (N/170) ?

×

Problem Loading...

Note Loading...

Set Loading...