Prime numbers – a number that can Flashcards
What is a prime number?
A number that can only be divided by itself and 1 without remainders. It is not a product of two smaller natural numbers.
What is a composite number?
Numbers that have more than two factors and can be formed by multiplying two smaller positive integers.
What is a rule of inference?
A logical form or guide consisting of premises (or hypotheses) that draws a conclusion.
What is a conjecture?
A mathematical statement which appears to be true, but has not yet been rigorously proved.
Example: The Goldbach Conjecture: Every even integer greater than 2 can be expressed as the sum of two primes.
What is an axiom (or postulate)?
A statement that is assumed to be true without proof. A postulate is true based on geometry principles.
Example: In geometry, ‘Through any two points, there is exactly one line.’
What is a theorem?
A statement that has been or can be proven to be true based on known facts and mathematical operations.
Example: Pythagorean Theorem a^2 + b^2 = c^2 for a right triangle.
What is a lemma (or pre-theorem)?
A minor result whose sole purpose is to help in proving a theorem. It is a stepping stone on the path to proving a theorem.
What is a corollary (or post-theorem)?
A result in which the (usually short) proof relies heavily on a given theorem.
What is a proof?
A logical argument that shows a mathematical statement is true.
What does divisibility mean?
This means a number can be divided without leaving a remainder.
What is the greatest common divisor?
The greatest value that can divide two integers evenly.
What is the least common multiple?
The smallest positive multiple that two or more numbers share.
What are relatively prime integers?
There are no common factors other than 1, meaning no other integer could divide both numbers evenly.
What is a direct proof?
A method that involves proving a statement by assuming the hypothesis is true and demonstrating that the conclusion logically follows.
What is a proof of contrapositive?
Uses the contrapositive of a conditional statement to prove the statement itself.
Example: p → q is equivalent to ~q → ~p.