Course outline
Module 1
Module 1: The Riemann Hypothesis
Module 2
Module 2: Goldbach's Conjecture
Goldbach's Conjecture
Knowledge check
Q1. What does Goldbach's Conjecture state?
- A. Every even integer greater than 2 can be expressed as the sum of two prime numbers. ✓
- B. Every odd integer greater than 3 can be expressed as the sum of two prime numbers.
- C. Every prime number can be expressed as the sum of two even numbers.
- D. Every integer greater than 1 can be expressed as the sum of two prime numbers.
Why: Goldbach's Conjecture specifically refers to even integers greater than 2 and their representation as the sum of two primes.
Q2. Who proposed Goldbach's Conjecture?
- A. Leonhard Euler
- B. Christian Goldbach ✓
- C. Carl Friedrich Gauss
- D. Pierre de Fermat
Why: Christian Goldbach first proposed the conjecture in a letter to Leonhard Euler in 1742.
Q3. What is the smallest even number that Goldbach's Conjecture applies to?
Why: Goldbach's Conjecture applies to every even integer greater than 2, with 4 being the smallest such number.
Q4. Which of the following is a valid example of Goldbach's Conjecture?
- A. 4 = 2 + 2 ✓
- B. 5 = 2 + 3
- C. 7 = 3 + 4
- D. 9 = 5 + 4
Why: 4 = 2 + 2 is a valid example since 2 is a prime number and 4 is an even number greater than 2.
Q5. What is the current status of Goldbach's Conjecture?
- A. Proven true for all even numbers.
- B. Proven false.
- C. Unproven but verified for very large numbers. ✓
- D. Irrelevant to modern mathematics.
Why: Goldbach's Conjecture has not been proven or disproven, but it has been verified for even numbers up to very large values using computational methods.
Module 3
Module 3: P vs NP Problem
P vs NP Problem
Knowledge check
Q1. What does P stand for in the P vs NP problem?
- A. Polynomial
- B. Polynomial time ✓
- C. Perfect problems
- D. Provable problems
Why: P stands for Polynomial time, which refers to the class of decision problems that can be solved by a deterministic Turing machine in polynomial time.
Q2. What does NP stand for in the P vs NP problem?
- A. Non-deterministic Polynomial ✓
- B. Non-Perfect Problems
- C. Non-Polynomial
- D. Non-Probabilistic Problems
Why: NP stands for Non-deterministic Polynomial, which refers to the class of decision problems for which a solution can be verified in polynomial time by a deterministic Turing machine.
Q3. Which of the following is true about the P vs NP problem?
- A. It is proven that P equals NP
- B. It is proven that P does not equal NP
- C. It remains one of the biggest unsolved problems in computer science ✓
- D. It was solved in 2020
Why: The P vs NP problem remains one of the biggest unsolved problems in computer science, with no consensus on whether P equals NP or not.
Q4. Which of the following problems is known to be in NP?
- A. Finding the shortest path in a graph
- B. Solving a system of linear equations
- C. Finding a Hamiltonian cycle in a graph ✓
- D. Sorting a list of numbers
Why: Finding a Hamiltonian cycle in a graph is known to be in NP because a solution can be verified in polynomial time, even though finding one may be computationally intensive.
Q5. What is the significance of the P vs NP problem?
- A. It determines the efficiency of all algorithms
- B. It determines whether all problems can be solved in polynomial time
- C. It determines whether all problems can be verified in polynomial time
- D. It determines the relationship between deterministic and non-deterministic algorithms ✓
Why: The P vs NP problem determines the relationship between deterministic and non-deterministic algorithms, which has profound implications for the field of computer science.
Module 4
Module 4: The Collatz Conjecture
The Collatz Conjecture
Knowledge check
Q1. What is the Collatz Conjecture commonly referred to as?
- A. The 3n + 1 problem ✓
- B. The Goldbach Conjecture
- C. The Riemann Hypothesis
- D. The P vs NP problem
Why: The Collatz Conjecture is often called the 3n + 1 problem because of the rule used in the sequence.
Q2. Who is the conjecture named after?
- A. John Nash
- B. Paul Erdős
- C. Lothar Collatz ✓
- D. Alan Turing
Why: The conjecture is named after Lothar Collatz, who first proposed it in the 1930s.
Q3. What is the starting number in the Collatz sequence that is often used as an example?
- A. 10 ✓
- B. 12
- C. 16
- D. 24
Why: The number 10 is often used as an example to demonstrate how the Collatz sequence works.
Q4. What happens if the starting number is 1 in the Collatz sequence?
- A. It goes into an infinite loop
- B. It reaches 1 and stops ✓
- C. It increases indefinitely
- D. It decreases to 0
Why: If the starting number is 1, the sequence immediately stops because 1 is the base case.
Q5. Which of the following is a key feature of the Collatz Conjecture?
- A. It is proven to be true for all positive integers
- B. It is proven to be false for all positive integers
- C. It remains unproven despite extensive research ✓
- D. It is only applicable to even numbers
Why: The Collatz Conjecture remains unproven despite extensive research and is one of the famous unsolved problems in mathematics.
Module 5
Module 5: Twin Prime Conjecture
Twin Prime Conjecture
Knowledge check
Q1. What is the Twin Prime Conjecture?
- A. A conjecture that there are infinitely many pairs of primes that differ by 2 ✓
- B. A conjecture that there are finitely many pairs of primes that differ by 2
- C. A conjecture that there are no pairs of primes that differ by 2
- D. A conjecture that all primes are twin primes
Why: The Twin Prime Conjecture states that there are infinitely many pairs of primes that differ by 2.
Q2. What is a twin prime pair?
- A. A pair of primes that differ by 1
- B. A pair of primes that differ by 3
- C. A pair of primes that differ by 4
- D. A pair of primes that differ by 2 ✓
Why: A twin prime pair consists of two primes that differ by 2.
Q3. Which of the following is an example of a twin prime pair?
- A. (3, 5) ✓
- B. (4, 6)
- C. (7, 9)
- D. (11, 13)
Why: (3, 5) is a twin prime pair because both numbers are prime and differ by 2.
Q4. What is the significance of the Twin Prime Conjecture in mathematics?
- A. It has been proven and is no longer a conjecture
- B. It is one of the most famous unsolved problems in number theory ✓
- C. It has no significance in mathematics
- D. It is only relevant to cryptography
Why: The Twin Prime Conjecture is one of the most famous unsolved problems in number theory and has significant implications for understanding the distribution of prime numbers.
Q5. Who is credited with first proposing the Twin Prime Conjecture?
- A. Leonhard Euler
- B. Carl Friedrich Gauss
- C. No one specifically; it is considered a classical problem ✓
- D. Bernhard Riemann
Why: The Twin Prime Conjecture is considered a classical problem in number theory and is not credited to any specific individual.
Module 6
Module 6: Navier-Stokes Equations
Navier-Stokes Equations
Knowledge check
Q1. What is the primary subject of the Navier-Stokes equations?
- A. Quantum mechanics
- B. Fluid dynamics ✓
- C. Relativity
- D. Electromagnetism
Why: The Navier-Stokes equations describe the motion of fluid substances and are central to the field of fluid dynamics.
Q2. Which of the following best describes the Navier-Stokes equations?
- A. A set of equations for predicting the motion of solid objects
- B. A set of equations for predicting the motion of fluids ✓
- C. A set of equations for predicting the behavior of light
- D. A set of equations for predicting the behavior of particles in a vacuum
Why: The Navier-Stokes equations are used to model the motion of fluids, including both liquids and gases.
Q3. What is one of the main challenges in solving the Navier-Stokes equations?
- A. They are too simple to solve
- B. They can exhibit chaotic and turbulent behavior ✓
- C. They are only applicable to solids
- D. They are not used in real-world applications
Why: The Navier-Stokes equations can describe turbulent flows, which are highly complex and difficult to predict accurately.
Q4. Which of the following is a key application of the Navier-Stokes equations?
- A. Designing buildings
- B. Designing airplanes ✓
- C. Designing musical instruments
- D. Designing bridges
Why: The Navier-Stokes equations are crucial in aerodynamics, which is essential for designing airplanes.
Q5. What is the significance of the Navier-Stokes equations in mathematics?
- A. They are a solved problem in mathematics
- B. They are one of the Millennium Prize Problems ✓
- C. They are only used in engineering
- D. They have no mathematical significance
Why: The Navier-Stokes equations are one of the seven Millennium Prize Problems, highlighting their importance and difficulty in mathematics.
Module 7
Module 7: The Poincaré Conjecture
The Poincaré Conjecture
Knowledge check
Q1. Who formulated the Poincaré Conjecture?
- A. Henri Poincaré ✓
- B. Grigori Perelman
- C. John Nash
- D. David Hilbert
Why: Henri Poincaré formulated the conjecture in 1904.
Q2. What does the Poincaré Conjecture relate to?
- A. Algebraic geometry
- B. Topology ✓
- C. Number theory
- D. Differential equations
Why: The Poincaré Conjecture is a statement in topology about the characterization of the 3-sphere.
Q3. In which year was the Poincaré Conjecture proven?
- A. 1982
- B. 2002
- C. 2003 ✓
- D. 2006
Why: Grigori Perelman provided a proof of the conjecture in 2003.
Q4. Who was awarded the Millennium Prize for solving the Poincaré Conjecture?
- A. Henri Poincaré
- B. Grigori Perelman ✓
- C. John Milnor
- D. Richard Hamilton
Why: Grigori Perelman was awarded the Millennium Prize for solving the Poincaré Conjecture, though he declined it.
Q5. What is the Poincaré Conjecture primarily concerned with?
- A. The classification of 2-dimensional surfaces
- B. The classification of 3-dimensional manifolds ✓
- C. The classification of algebraic curves
- D. The classification of prime numbers
Why: The Poincaré Conjecture is primarily concerned with the classification of 3-dimensional manifolds.