Good problem
-
sourav das
- Posts:461
- Joined:Wed Dec 15, 2010 10:05 am
- Location:Dhaka
- Contact:
1.1. Determine the number of functions $f : \{1, 2, . . . , 1999\} \mapsto \{2000, 2001, 2002, 2003\}$ satisfying the condition that $f(1)+ f(2)+. . . + f(1999)$ is odd.
You spin my head right round right round,
When you go down, when you go down down......(-$from$ "$THE$ $UGLY$ $TRUTH$" )
When you go down, when you go down down......(-$from$ "$THE$ $UGLY$ $TRUTH$" )
Re: Good problem
The total number of functions without abiding the statement if the set was $\{ 1,2,3,...,1998 \}$ would be $4^{1998}$ and there is $2$ ways to pick $f(1999)$ so that the total sum is odd. So there is $2^{3997}$ functions.
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi