Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Problem
Problem
A person is permitted to select atleast one and almost
n
n
n
coins from a collection of
(
2
n
+
1
)
(2n + 1)
(
2
n
+
1
)
distinct coins. If the total number of ways in which he can select coins is 255, then
n
n
n
equals a. 4 b. 8 c. 16 d. 32
Browse the problem library