Skip to content
The Lumenary

Practice · Grades 6–8

Set-builder notation, quantifiers and infinite sets

Set-builder notation, quantifiers and infinite sets

Warm-upHuman

List the elements of {n∈N:n2<30}\{n \in \N : n^2 < 30\}. (Remember that N={0,1,2,… }\N = \{0, 1, 2, \dots\}.)

Write elements separated by commas. Order and repeats don’t matter — just like in a set!

Set-builder notation, quantifiers and infinite sets

Warm-upHuman

Which sentence is the denial (negation) of “Every train from Mombasa arrived on time today”?

Choose one

Set-builder notation, quantifiers and infinite sets

CoreHuman

Is the statement “Every element of the empty set is greater than 100100” true or false?

Choose one

Set-builder notation, quantifiers and infinite sets

CoreHuman

Which of these statements are true? Choose all that apply.

Choose all that apply

Set-builder notation, quantifiers and infinite sets

CoreHuman

Let SS be the set of students in a class, and let M(t,s)M(t, s) mean “tt has met ss”. Which statement says “There is a student whom every student in the class has met”?

Choose one

Set-builder notation, quantifiers and infinite sets

CoreHuman

Which sentence is the denial of “Every country has a city with more than a million people”?

Choose one

Set-builder notation, quantifiers and infinite sets

CoreHuman

How many elements does the set {x∈Z:−3≤2x+1≤7}\{x \in \Z : -3 \le 2x + 1 \le 7\} have?

Set-builder notation, quantifiers and infinite sets

StretchHuman

Lena wants to prove that the even numbers are infinite. She is given a non-empty finite list of even natural numbers whose largest entry is MM. Which number is certainly an even number missing from the list, whatever the list is?

Choose one

Set-builder notation, quantifiers and infinite sets

CoreFormal

Which Lean statement says that there is no largest natural number?

Choose one

Set-builder notation, quantifiers and infinite sets

StretchComputational

Pierre de Fermat believed (around 1640) that every number 22k+12^{2^k} + 1 is prime. Write first_counterexample(prop, limit), which returns the first k in range(limit) for which prop(k) is False, or None if there is none. Then use it with the is_prime function provided to test Fermat's claim for k=0,1,…,5k = 0, 1, \dots, 5.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.