Lesson 7.01a-c
7.01a-c Existence problems, set notation and the pigeonhole principle Quiz: OCR Further Maths, Unit 4
20 questions
In partnership with Revision Ninja
Lesson 7.01a-c, Existence problems, set notation and the pigeonhole principle: 20 multiple choice questions for the OCR Further Maths (H245), Unit 4: Discrete Mathematics (Y544), written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
How many people must be in a room to guarantee at least two share a birth month?
- 366
- 13
- 12
- 24
-
Which mathematical symbol represents the power set, containing all subsets of a set A?
- A'
- P(A)
- A x A
- |A|
-
If a set A contains 4 elements, how many elements are in its power set P(A)?
- 16
- 24
- 4
- 8
-
Which set operation creates a set containing all elements that belong to set A, set B, or both?
- Intersection
- Set difference
- Union
- Cartesian product
-
What is the cardinality of the empty set, denoted by the symbol ∅?
- Infinite
- Undefined
- 1
- 0
-
Which standard mathematical symbol denotes that an element x belongs to set A?
- x ∈ A
- x ⊆ A
- x ⊂ A
- x = A
-
If set A has 3 elements and set B has 5 elements, what is |A x B|?
- 125
- 15
- 8
- 24
-
What term describes two sets whose intersection is equal to the empty set?
- Complementary
- Finite
- Disjoint
- Subset
-
Placing 10 items into 3 boxes guarantees at least one box contains at least how many items?
- 4
- 3
- 5
- 10
-
Which description correctly defines the set difference A \ B?
- Union of both sets
- Elements in both sets
- Elements in A not B
- Elements in B not A
-
If |A| = 10, |B| = 15, and |A ∩ B| = 4, what is |A ∪ B|?
- 19
- 21
- 29
- 25
-
What type of proof establishes that a mathematical object exists without explicitly constructing it?
- Proof by induction
- Non-constructive proof
- Constructive proof
- Direct proof
-
How many socks must be picked from 5 red and 5 blue socks to guarantee a matching pair?
- 6
- 11
- 2
- 3
-
What term describes a set of non-empty disjoint subsets whose union equals the original set?
- Partition
- Power set
- Complement
- Universal set
-
Which term refers to the set that contains all possible elements under consideration in a problem?
- Universal set
- Subset
- Power set
- Empty set
-
How many integers must be selected from {1, 2, ..., 10} to guarantee two sum to 11?
- 10
- 5
- 7
- 6
-
In set theory, what is the complement of the universal set U?
- Subset
- Power set
- Universal set
- Empty set
-
If set A is a proper subset of set B, which statement must be true?
- A ∩ B = B
- A ∪ B = A
- A ∩ B = A
- A \ B = A
-
How many people are needed to guarantee at least three share the same day of the week?
- 15
- 14
- 8
- 21
-
Which set operation represents elements that are in set A or set B, but not both?
- Symmetric difference
- Set intersection
- Relative complement
- Cartesian product
Related quizzes
- Arrangements, multiplicative principle and inclusion-exclusion Quiz · 7.01d-k · 20 questions
- Graph terminology, complete and bipartite graphs Quiz · 7.02a-e · 20 questions
- Eulerian and Hamiltonian graphs, isomorphism, digraphs, planarity and networks Quiz · 7.02g-p · 20 questions
- Algorithms, tracing and efficiency Quiz · 7.03a-e · 20 questions
- Sorting algorithms and bin packing Quiz · 7.03i-m · 20 questions
- Shortest paths, minimum spanning trees and nearest neighbour Quiz · 7.04a-c · 20 questions
- Route inspection and choosing a network algorithm Quiz · 7.04e-f · 20 questions
- Critical path analysis Quiz · 7.05a · 20 questions
- Formulating linear programming problems and slack variables Quiz · 7.06a-b · 20 questions
- Graphical solutions and the effect of changing constraints Quiz · 7.06c-e · 20 questions