number of function

Question

How many functions are there from the set {1, 2, . . . , n}, where n is a positive integer, to the set {0, 1}
a)  that assign 1 to exactly one of the positive integers less than n?

Comments

A small doubt understanding the question... Why 1 can be assigned to n ?

Isn't the question says that 1 can only be assigned to exactly one number between 1 to n-1 ?

Plz help

Answer 1

The domain set has $n$ elements and co-domain set has 2 elements. So, each of the $n$ elements from domain has 2 choices in the function and thus we get $2^n$ total functions.

Now, we are given a condition that exactly 1 positive integer less than $n$ maps to 1. So, all others less than $n$ must map to 0. We can find this number in $^{n-1}C_1$ ways (all the mappings for these $n-1$ elements are fixed)  and $n$ can be mapped to either 0 or 1, thus we get $2. (n-1)$ possible functions.

Comments

thanks i got now:)

---

arjun sir why r u multiplying  plz explain..

it should be (n-1) + 2.. plz correct me if iam wrong

---

but in this way overall 1 is getting assigned two times .................

Answer 2

according to me answer is as out of n-1 elwments only is mapped to 1 sp remaining n-2 elements + nth element make it n-1 element which will be mapped to 0 so n-1C1 +n-1C1 =2(n-1)C1 so 2(n-1)

Comments

No, you are doing wrong. Because the question allows $n$ to be mapped to either 0 or 1. Also, you select one out of $n-1$ elements first. Then how you get ${}^{n-1}C_1$ again?