EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Relations & Functions · Question 114 of 125

Question 114

MediumOriginal question

How many onto functions f:{1,2,3,4}→{p,q}f : \{1, 2, 3, 4\} \to \{p, q\} have f(1)=pf(1) = p?

Options for question 114

Show the answer and explanation
CorrectNot quiteAnswer B

Correct answer: B

Explanation

  1. With f(1)=pf(1) = p, each of 2, 3 and 4 goes to pp or qq: 23=82^{3} = 8 ways.

  2. Onto needs qq to be reached, so drop the one way that sends all three to pp: 8−1=78 - 1 = 7.

Worth noting

8 keeps the function that sends every element to pp, which misses qq.

Concept
Counting functions with a condition
Typical time
90 s
Your time
—
The rule this testsOnto and bijective functions
Practise this chapter →

Ten questions from Relations & Functions, at your own pace.

Practise this chapter →

Ten questions from Relations & Functions, at your own pace.