Sign in
Please select an account to continue using cracku.in
↓ →
The number of strictly increasing functions f from the set {1, 2, 3, 4, 5, 6} to the set {1, 2, 3, ... , 9} such that $$f(i)\neq i \text{ for }1\leq i\leq 6$$, is equal to:
Create a FREE account and get:
Educational materials for JEE preparation