📐

Discrete Mathematics & Math MCQ

Test your Discrete Mathematics & Math knowledge with 100 multiple choice questions covering fundamentals to advanced concepts, with instant feedback and explanations.

100 Questions 40 Beginner 40 Intermediate 20 Advanced
1

What is the Chinese Remainder Theorem (CRT)?

2

What is Fermat's Little Theorem?

3

What is Euler's totient function φ(n)?

4

What is a partial order?

5

What is the Master Theorem?

6

What is strong induction vs weak induction?

7

What is the inclusion-exclusion principle for derangements?

8

What is the Stirling number of the second kind S(n,k)?

9

What is Cayley's formula?

10

What is Kirchhoff's matrix tree theorem?

11

What is a formal language in discrete mathematics?

12

What is the Principle of Mathematical Induction and Well-Ordering?

13

What is a graph's chromatic polynomial?

14

What is the Ramsey number R(m,n)?

15

What is the difference between countable and uncountable infinity?

16

What is a generating function approach to Fibonacci numbers?

17

What is Zorn's Lemma?

18

What is the handshaking lemma in graph theory?

19

What is the four color theorem?

20

What is the Fundamental Theorem of Arithmetic?

21

What is a Boolean function and its normal forms?

22

What is Stirling's approximation?

23

What is a poset and what is Dilworth's theorem?

24

How many distinct ways can you arrange the letters of the word "LEVEL"?

25

Using proof by contradiction, what assumption do you start with to prove "√2 is irrational"?

26

In a connected simple graph with 7 vertices, what is the minimum number of edges required for the graph to remain connected?

27

What does it mean for a relation R on set A to be antisymmetric?

28

How many different committees of 4 people can be formed from a group of 10 people, if two specific people refuse to serve together?

29

What is the chromatic number of a cycle graph C₅ (a 5-vertex cycle)?

30

Using the Euclidean algorithm, what is gcd(252, 105)?

31

What technique is typically used to solve a linear homogeneous recurrence relation like a_n = 5a_{n-1} - 6a_{n-2}?

32

In propositional logic, what is the contrapositive of "If it rains, then the ground is wet"?

33

How many onto (surjective) functions are there from a 4-element set to a 2-element set?

34

Which of the following degree sequences could NOT belong to any simple graph?

35

What is the value of C(n,0) + C(n,1) + C(n,2) + ... + C(n,n)?

36

Which proof technique would you use to show that every integer greater than 1 has a prime factor, by assuming a smallest counterexample exists?

37

In how many ways can 5 distinct books be distributed among 3 distinct shelves, if each shelf may hold any number of books (including zero)?

38

What does Kruskal's algorithm compute, and what greedy rule does it follow?

39

What is the multiplicative inverse of 3 modulo 7?

40

What is the negation of the statement "For all x, there exists a y such that x + y = 0"?