Glanz: aiMOOC über GPT aiMOOC Action erstellt

2026-08-28T06:55:25Z

aiMOOC über GPT aiMOOC Action erstellt

Neue Seite

{{T}}
[[Category:English]]
[[Category:Proof and Mathematical Reasoning]]

{{BR}}
= Introduction =

Mathematics is not only about obtaining answers. It is also about explaining '''why''' a claim must be true, identifying when a claim is false, and communicating reasoning so clearly that another person can check every step. A [[English:Mathematical proof|mathematical proof]] is a logically valid argument that begins from accepted definitions, assumptions, axioms, or previously established results and reaches a stated conclusion.

In this aiMOOC for Grades 11–13, you will learn how to read, plan, write, test, and improve proofs. You will work with [[English:Mathematical logic|mathematical logic]], [[English:Direct proof|direct proof]], [[English:Proof by contradiction|proof by contradiction]], [[English:Contraposition|contraposition]], [[English:Mathematical induction|mathematical induction]], [[English:Counterexample|counterexamples]], and geometric reasoning. The aim is not to memorize proof templates mechanically. The aim is to develop habits of precise thinking that transfer to algebra, geometry, number theory, calculus, computer science, and scientific argumentation.

[[File:Mathematical implication diagram.svg|500px|frameless|center]]

{{BR}}
== Learning Goals ==

By the end of the course, you should be able to distinguish a conjecture from a theorem, translate verbal statements into logical form, recognize necessary and sufficient conditions, negate quantified statements correctly, choose a suitable proof method, construct valid arguments, find counterexamples, diagnose gaps in reasoning, and explain a proof in clear mathematical English.

You should also be able to judge the role of examples, diagrams, calculations, and computer experiments. These can provide evidence, reveal patterns, and suggest conjectures, but a universal mathematical statement normally requires an argument that covers every permitted case.

{{BR}}
= Statements, Definitions, and Logical Structure =

{{BR}}
== Propositions and Implications ==

A '''proposition''' is a statement that has a definite truth value. For example, “17 is prime” is true, while “15 is prime” is false. An open sentence such as “x is prime” does not yet have a fixed truth value until a domain and a value or quantifier for x are supplied.

Many theorems have the form “If P, then Q,” written <math>P \rightarrow Q</math>. Here P is the hypothesis and Q is the conclusion. The implication is false only in the situation where P is true and Q is false. In a proof, you do not prove an implication by assuming that Q is already true. Instead, you start from P and use valid reasoning to reach Q.

The '''converse''' of <math>P \rightarrow Q</math> is <math>Q \rightarrow P</math>. The '''inverse''' is <math>\neg P \rightarrow \neg Q</math>. The '''contrapositive''' is <math>\neg Q \rightarrow \neg P</math>. An implication and its contrapositive are logically equivalent, but the converse and inverse need not be equivalent to the original statement.

{{#ev:youtube|https://www.youtube.com/watch?v=YFZzLQN5qOU|500|center}}

{{BR}}
== Necessary and Sufficient Conditions ==

If <math>P \rightarrow Q</math>, then P is '''sufficient''' for Q and Q is '''necessary''' for P. If both <math>P \rightarrow Q</math> and <math>Q \rightarrow P</math> are true, then P and Q are equivalent, written <math>P \leftrightarrow Q</math>, and each is necessary and sufficient for the other.

For example, for an integer n, “n is divisible by 6” is sufficient for “n is divisible by 3.” Divisibility by 3 is necessary for divisibility by 6, but it is not sufficient because 9 is divisible by 3 and not by 6.

[[File:Necessary and sufficient venn (set) diagram.svg|500px|frameless|center]]

{{BR}}
== Quantifiers and Their Negations ==

The universal quantifier <math>\forall</math> means “for every,” while the existential quantifier <math>\exists</math> means “there exists.” Order matters. Over the real numbers, <math>\forall x\,\exists y\,(y>x)</math> is true because for any x you can choose a larger y. In contrast, <math>\exists y\,\forall x\,(y>x)</math> is false because there is no greatest real number.

To negate a universal claim, replace “for every” by “there exists” and negate the property: <math>\neg(\forall x\,P(x))</math> is equivalent to <math>\exists x\,\neg P(x)</math>. To negate an existential claim, replace “there exists” by “for every” and negate the property: <math>\neg(\exists x\,P(x))</math> is equivalent to <math>\forall x\,\neg P(x)</math>.

[[File:Logical connectives table.svg|500px|frameless|center]]

{{BR}}
= From Conjecture to Proof =

A '''conjecture''' is a statement believed to be true on the basis of patterns, examples, intuition, or preliminary reasoning. A '''theorem''' is a statement established by proof. A '''lemma''' is a proved result used mainly to support another result. An '''axiom''' or postulate is accepted as a starting point within a formal system.

Examples are extremely useful during discovery. If you suspect that the sum of two odd integers is even, checking 3 + 5, 7 + 9, and 11 + 13 may suggest the correct statement. But a finite list of examples does not prove a claim about all integers. A proof explains why no valid case can fail.

A single counterexample, however, is enough to disprove a universal statement. For instance, the conjecture “<math>n^2+n+41</math> is prime for every non-negative integer n” fails at <math>n=41</math>, where the expression equals <math>41^2</math>.

{{BR}}
== Reading a Theorem Before Proving It ==

Before writing, identify the domain, hypotheses, conclusion, definitions, and quantifiers. Ask which facts are given and which are to be shown. Then restate technical words in usable form. If “n is even” appears, write <math>n=2k</math> for some integer k. If two sets are equal, plan to show both inclusions. If an “if and only if” statement appears, plan to prove both directions.

A strong proof is not merely a sequence of algebraic lines. Every transformation must preserve truth under the stated assumptions, and every newly introduced object must be allowed by the definitions or earlier results.

{{BR}}
== A Proof-Writing Checklist ==

{| class="wikitable"
! Stage
! Question to ask yourself
|-
| Interpret
| What exactly is the claim, and what is the domain?
|-
| Unpack
| Which definitions translate the words into mathematical conditions?
|-
| Plan
| Would direct proof, cases, contraposition, contradiction, induction, or a counterexample fit the logical form?
|-
| Justify
| Why is each step valid, and have I used every assumption correctly?
|-
| Review
| Did I prove the stated conclusion for every required case without circular reasoning?
|-
| Communicate
| Can another reader follow the argument without guessing hidden steps?
|}

{{BR}}
= Core Proof Methods =

{{BR}}
== Direct Proof ==

A direct proof begins with the hypotheses and moves toward the conclusion through definitions, algebra, known theorems, and valid inference.

'''Example:''' Prove that the sum of two even integers is even. Let <math>a</math> and <math>b</math> be even. Then <math>a=2m</math> and <math>b=2n</math> for integers m and n. Therefore
<math>a+b=2m+2n=2(m+n)</math>.
Because <math>m+n</math> is an integer, <math>a+b</math> has the form twice an integer and is therefore even.

Notice the structure: arbitrary valid inputs were chosen, the definition of “even” was used, and the conclusion was rewritten in the exact form required by the same definition.

{{BR}}
== Proof by Cases ==

Proof by cases divides the domain into exhaustive possibilities and proves the conclusion in each one.

'''Example:''' For every integer n, the product <math>n(n+1)</math> is even. Every integer is either even or odd. If n is even, then the product has an even factor. If n is odd, then <math>n+1</math> is even, so the product again has an even factor. These cases cover all integers, so the claim follows.

A case split is valid only if the cases really cover every possibility. Overlapping cases are acceptable, but missing cases leave a gap.

{{BR}}
== Proof by Contraposition ==

To prove <math>P \rightarrow Q</math> by contraposition, prove the equivalent statement <math>\neg Q \rightarrow \neg P</math>. This is especially useful when the negation of the conclusion gives a concrete algebraic form.

'''Example:''' Prove that if <math>n^2</math> is even, then n is even. Instead, assume n is odd. Then <math>n=2k+1</math> for some integer k, so
<math>n^2=(2k+1)^2=4k^2+4k+1=2(2k^2+2k)+1</math>,
which is odd. Thus “n is odd” implies “<math>n^2</math> is odd,” the contrapositive of the original claim. Therefore the original claim is true.

{{#ev:youtube|https://www.youtube.com/watch?v=X-hJ7krLBn0|500|center}}

{{BR}}
== Proof by Contradiction ==

In a proof by contradiction, assume the statement you want to prove is false. Then derive an impossibility, such as a statement and its negation both being true, a violation of a known theorem, or a conflict with an initial assumption.

'''Example:''' To prove that <math>\sqrt{2}</math> is irrational, suppose instead that <math>\sqrt{2}=a/b</math> for integers a and b with no common factor and <math>b\neq 0</math>. Squaring gives <math>2b^2=a^2</math>, so <math>a^2</math> is even and therefore a is even. Write <math>a=2k</math>. Substitution gives <math>b^2=2k^2</math>, so b is also even. Then a and b share the factor 2, contradicting the choice of the fraction in lowest terms. Therefore <math>\sqrt{2}</math> is irrational.

{{#ev:youtube|https://www.youtube.com/watch?v=sRDwsfNDXak|500|center}}

{{BR}}
== Mathematical Induction ==

[[English:Mathematical induction|Mathematical induction]] proves a statement <math>P(n)</math> for all integers from a starting value onward. The basic structure has two logically connected parts. The '''base case''' establishes the first required value. The '''inductive step''' assumes <math>P(k)</math> for an arbitrary valid k and proves <math>P(k+1)</math>.

'''Example:''' Prove <math>1+2+\cdots+n=\frac{n(n+1)}{2}</math> for every positive integer n. For <math>n=1</math>, both sides equal 1. Now assume
<math>1+2+\cdots+k=\frac{k(k+1)}{2}</math>.
Then
<math>1+2+\cdots+k+(k+1)=\frac{k(k+1)}{2}+(k+1)=\frac{(k+1)(k+2)}{2}</math>,
which is the required formula with <math>k+1</math> in place of k. Therefore the statement holds for every positive integer n.

The inductive hypothesis is not a guess that the theorem is always true. It is a conditional assumption used only to prove the next case.

{{#ev:youtube|https://www.youtube.com/watch?v=wblW_M_HVQ8|500|center}}

{{BR}}
== Existence and Uniqueness ==

An existence proof shows that at least one object satisfies specified conditions. It may be '''constructive''', by exhibiting or building such an object, or '''non-constructive''', by showing that an object must exist without explicitly finding it.

A uniqueness proof shows that at most one such object can exist. A common pattern is to suppose two objects satisfy the same defining conditions and then prove they are equal.

For example, if <math>a\neq 0</math>, the equation <math>ax=b</math> has a solution <math>x=b/a</math>, proving existence. If both x and y satisfy the equation, then <math>ax=ay</math>. Since <math>a\neq0</math>, division by a gives <math>x=y</math>, proving uniqueness.

{{BR}}
== Disproof by Counterexample ==

To disprove a universal claim, find one valid case where it fails. Suppose someone claims, “For every real number x, <math>\sqrt{x^2}=x</math>.” Choosing <math>x=-3</math> gives <math>\sqrt{(-3)^2}=3</math>, not -3. The corrected identity is <math>\sqrt{x^2}=|x|</math> for real x.

A counterexample must satisfy all hypotheses of the claim. An example outside the stated domain does not disprove anything.

{{BR}}
= Geometry, Diagrams, and Visual Reasoning =

Diagrams can reveal structure, suggest auxiliary constructions, and make relationships easier to see. But a drawing is not automatically a proof. A diagram may be inaccurate, may represent only one special case, or may make an unproved property look obvious. In rigorous geometry, every conclusion must follow from definitions, axioms, established theorems, or justified constructions.

The Pythagorean theorem is especially useful for comparing proof styles because it has many different proofs, including rearrangement arguments, similarity arguments, and Euclid’s area-based reasoning.

[[File:Pythagorean Theorem Proof.gif|500px|frameless|center]]

The animation can help you see an area rearrangement, while the next diagram shows the structure of Euclid’s classical geometric reasoning. Your task as a mathematician is to translate what the picture suggests into explicit statements about congruence, similarity, area, or parallel lines.

[[File:Illustration to Euclid's proof of the Pythagorean theorem.svg|500px|frameless|center]]

Thales’ theorem provides another example in which a geometric transformation can reveal why a right angle appears in a semicircle. A visual argument becomes a proof only when the invariant relationships created by the construction are stated and justified.

[[File:Thales proof by rotation diagram.svg|500px|frameless|center]]

{{BR}}
= Proof Debugging: Common Errors =

A proof can fail even when its final answer is correct. Learning to diagnose flawed reasoning is therefore a central mathematical skill.

'''Using examples as proof:''' Testing many cases can support a conjecture but does not establish a universal statement.

'''Proving the converse by mistake:''' From “If a number is divisible by 6, then it is divisible by 3,” you cannot conclude the converse. The number 9 is a counterexample.

'''Circular reasoning:''' You may not assume the statement you are trying to prove, even in disguised form.

'''Dividing by a quantity that might be zero:''' Algebraic cancellation requires a non-zero divisor. A proof must either justify non-zero status or split into cases.

'''Taking square roots without considering sign:''' From <math>x^2=y^2</math>, the conclusion is <math>x=\pm y</math>, not automatically <math>x=y</math>.

'''Ignoring quantifier order:''' “For every student there is a book they like” does not mean “There is one book every student likes.”

'''Hidden domain changes:''' A step valid over positive real numbers may fail over all real numbers, and a step valid for integers may fail for rational or complex numbers.

{{BR}}
== How to Repair a Proof ==

When a proof seems suspicious, identify the earliest step that is not justified. Ask whether a definition was used correctly, whether an operation is reversible, whether every case was covered, and whether a variable still belongs to the required domain. Then either repair the step or modify the claim.

Proof debugging is closely related to debugging a program. In both activities, a global failure may come from one local transition that does not preserve the intended conditions.

{{BR}}
= Mathematical Reasoning Beyond Pure Proof =

Proof and reasoning support problem solving in many fields. In [[English:Computer science|computer science]], correctness arguments explain why an algorithm produces the required output for every allowed input. In [[English:Calculus|calculus]], proof clarifies why limit rules and derivative theorems work. In [[English:Statistics|statistics]], logical structure helps distinguish assumptions from conclusions. In the sciences, mathematical models require careful attention to what is deduced from a model and what is observed experimentally.

Computer algebra systems, dynamic geometry tools, and numerical experiments can help you explore patterns, generate examples, and search for counterexamples. They are powerful assistants, but the role of proof remains distinct: a proof explains why the result follows for all cases covered by its assumptions.

{{BR}}
== Communication and Mathematical Rigor ==

A proof should be correct, complete enough for its intended audience, and readable. Rigor does not mean writing every trivial arithmetic detail. It means making the logical dependencies clear enough that no essential step depends on guesswork.

For Grades 11–13, good proof writing usually includes a clear statement of arbitrary variables, correct use of definitions, explicit justification for the main transitions, appropriate mathematical notation, and a concluding sentence that connects the argument back to the original claim.

{{BR}}
= Interactive Tasks =

{{BR}}
== Quiz: Test Your Knowledge ==

{{MC}}

'''Which statement is logically equivalent to an implication?'''
(Its contrapositive)
(!Its converse)
(!Its inverse)
(!Its hypothesis)

{{E}}
<br>

{{MC}}

'''What is enough to disprove a universal mathematical claim?'''
(One valid counterexample)
(!Ten supporting examples)
(!A diagram that looks different)
(!A numerical approximation)

{{E}}
<br>

{{MC}}

'''What is the first required part of a standard induction proof?'''
(A verified base case)
(!A contradiction)
(!A counterexample)
(!A converse)

{{E}}
<br>

{{MC}}

'''Which proof method starts by assuming the negation of the desired conclusion and deriving an impossibility?'''
(Proof by contradiction)
(!Direct proof)
(!Proof by cases)
(!Construction)

{{E}}
<br>

{{MC}}

'''If P implies Q, which condition is necessary for P?'''
(Q)
(!P)
(!Not Q)
(!Neither condition)

{{E}}
<br>

{{MC}}

'''What does a uniqueness proof establish?'''
(At most one object satisfies the conditions)
(!At least two objects satisfy the conditions)
(!Every object satisfies the conditions)
(!No object satisfies the conditions)

{{E}}
<br>

{{MC}}

'''Why is checking many examples usually not a proof of a universal claim?'''
(Unchecked cases may still fail)
(!Examples cannot contain numbers)
(!Universal claims are always false)
(!Proofs cannot use computation)

{{E}}
<br>

{{MC}}

'''What should you prove when using contraposition on an implication?'''
(The negation of the conclusion implies the negation of the hypothesis)
(!The conclusion implies the hypothesis)
(!The hypothesis implies its negation)
(!The conclusion implies its negation)

{{E}}
<br>

{{MC}}

'''Which statement best describes a lemma?'''
(A proved result mainly used to support another result)
(!An untested numerical pattern)
(!A false theorem)
(!A diagram without justification)

{{E}}
<br>

{{MC}}

'''What is the strongest reason to state the domain of a variable?'''
(Validity of steps can depend on the domain)
(!It makes every proof shorter)
(!It removes the need for definitions)
(!It guarantees the converse)

{{E}}
<br>

{{BR}}
== Memory Game ==

<div class="memo-quiz">
{|
|-
| Theorem || Statement established by a valid mathematical argument
|-
| Lemma || Proven result used mainly to support a larger argument
|-
| Counterexample || Valid case that makes a universal claim fail
|-
| Contrapositive || Logically equivalent reformulation that negates and reverses an implication
|-
| Induction || Method using a base case and a step from one case to the next
|-
| Axiom || Starting statement accepted within a formal system
|-
| Quantifier || Logical expression specifying how many elements a statement concerns
|}
{{E}}
<br>

{{BR}}
== Drag and Drop ==

Create the matches by pairing each proof method with the description that best characterizes it.

<div class="lueckentext-quiz">

{| class="wikitable"
! Match the correct terms.
! Topic
|-
| '''Direct proof'''
| Starts from the hypotheses and derives the conclusion
|-
| '''Contraposition'''
| Proves an equivalent implication by reversing and negating
|-
| '''Contradiction'''
| Assumes the target statement is false and reaches an impossibility
|-
| '''Induction'''
| Proves a starting case and then a general next-case step
|-
| '''Counterexample'''
| Refutes a universal claim with one valid failing case
|}
{{E}}

<br>
...
<br />

{{BR}}
== Crossword Puzzle ==

<div class="kreuzwort-quiz">
{|
|-
| Axiom || What starting statement is accepted within a formal system?
|-
| Theorem || What do you call a mathematical statement established by proof?
|-
| Lemma || What proved statement is mainly used to help prove another result?
|-
| Induction || Which method links a base case to a general successor step?
|-
| Contrapositive || Which equivalent implication reverses and negates the original parts?
|-
| Counterexample || What single valid case can refute a universal claim?
|}
{{E}}
<br>

{{BR}}
== LearningApps ==

<iframe> https://learningapps.org/index.php?s=Proof+and+Mathematical+Reasoning </iframe>

{{BR}}
== Cloze Text ==

<quiz display=simple>
{'''Complete the text.'''<br>
|type="{}"}
A mathematical proof begins from accepted assumptions and uses valid { reasoning } to reach a conclusion. A universal claim can be disproved by one valid { counterexample }. The statement equivalent to an implication is its { contrapositive }. A proof by contradiction assumes the target statement is { false }. Mathematical induction begins with a verified { base case }. The inductive step proves a successor case from an { inductive hypothesis }. A necessary condition must hold whenever the original { hypothesis } holds. Quantifiers specify whether a statement concerns every element or at least one { element }. A diagram can guide discovery but still requires logical { justification }. Good proof writing makes important assumptions and transitions { explicit }.
</quiz>

<br>

{{BR}}
= Open-Ended Tasks =

{{BR}}
=== Easy ===
# [[English:Proof vocabulary map|Proof vocabulary map]]: Create a one-page concept map connecting theorem, conjecture, lemma, axiom, counterexample, hypothesis, and conclusion; add one original example for at least four terms.
# [[English:Implication cards|Implication cards]]: Write four everyday or mathematical if-then statements, then write the converse and contrapositive of each and decide which versions are true.
# [[English:Counterexample hunt|Counterexample hunt]]: Invent three plausible universal claims about integers, test them systematically, and either find a counterexample or explain why further proof would still be needed.
# [[English:Proof narration|Proof narration]]: Record a two-minute audio or video explanation of the direct proof that the sum of two even integers is even, emphasizing where the definition of even is used.

{{BR}}
=== Standard ===
# [[English:Proof method comparison|Proof method comparison]]: Solve one implication using a direct proof and a second implication using contraposition, then compare why each chosen method fits its statement.
# [[English:Geometry proof poster|Geometry proof poster]]: Use a dynamic geometry tool or hand-drawn construction to present a proof of a familiar geometric theorem, labeling every fact that is assumed, constructed, or proved.
# [[English:Interview about proof|Interview about proof]]: Interview a mathematics, computer science, engineering, or science teacher about how proof or rigorous reasoning is used in their field, then summarize the interview and identify two transferable habits.
# [[English:Induction investigation|Induction investigation]]: Use a spreadsheet or short program to test a sequence formula for many values, formulate a conjecture, and then write a full induction proof that explains why the pattern continues.

{{BR}}
=== Advanced ===
# [[English:Flawed proof laboratory|Flawed proof laboratory]]: Collect or invent three incorrect proofs involving division by zero, converse confusion, or an unjustified square-root step; diagnose the first invalid step in each and produce corrected versions.
# [[English:Existence and uniqueness project|Existence and uniqueness project]]: Choose a problem involving a linear equation, geometric construction, or function and write separate arguments for existence and uniqueness; explain why proving only one part is insufficient.
# [[English:Formalization challenge|Formalization challenge]]: Translate five verbal mathematical claims into symbolic logic with quantifiers, negate each statement correctly, and discuss how changing quantifier order changes meaning in at least two cases.
# [[English:Mini proof conference|Mini proof conference]]: Prepare a five-minute presentation of a non-trivial theorem from number theory, combinatorics, geometry, or calculus, defend each step during peer questions, and revise the proof after receiving critique.

{{:Open Task - Create a MOOC}}

{{BR}}
= Learning Assessment =

# [[English:Proof selection assessment|Proof selection assessment]]: Given four unfamiliar statements, choose an appropriate method for each, justify the choice from the logical structure, and outline the proof before carrying it out.
# [[English:Reasoning error analysis|Reasoning error analysis]]: Analyze a flawed proof line by line, identify the earliest unjustified step, explain why it fails, and repair the argument without changing the original theorem.
# [[English:Quantifier transfer task|Quantifier transfer task]]: Convert a real-world claim into quantified mathematical language, negate it precisely, and explain how a counterexample would differ from a full proof.
# [[English:Multiple-method proof|Multiple-method proof]]: Prove one theorem in two different ways, such as directly and by contradiction, then compare clarity, assumptions, and efficiency.
# [[English:Evidence versus proof|Evidence versus proof]]: Evaluate a table of numerical results and a computer-generated graph for a proposed universal formula, state what the evidence does and does not establish, and design a rigorous proof or disproof strategy.
# [[English:Communication assessment|Communication assessment]]: Rewrite a technically correct but poorly explained proof for a peer audience, preserving validity while making the logical dependencies and use of definitions explicit.

<br>
<br>

{{BR}}
= Evidence of Learning =

Strong evidence of learning combines mathematical knowledge with reasoning, communication, and transfer.

{| class="wikitable"
! Evidence type
! What successful work shows
|-
| Knowledge
| You correctly use concepts such as implication, converse, contrapositive, quantifier, theorem, lemma, axiom, counterexample, existence, and uniqueness.
|-
| Skills
| You can unpack definitions, choose proof methods, construct valid arguments, negate quantified statements, test claims, and debug reasoning.
|-
| Products
| You can produce complete written proofs, annotated diagrams, proof presentations, logical formalizations, corrected flawed proofs, and exploratory computational work.
|-
| Communication
| You state assumptions and domains clearly, justify essential transitions, use notation accurately, and adapt explanations to an intended audience.
|-
| Transfer
| You can apply proof habits to unfamiliar problems in algebra, geometry, number theory, calculus, algorithms, modeling, and scientific reasoning.
|-
| Reflection
| You can distinguish evidence from proof, compare alternative arguments, recognize limits of a method, and explain how feedback improved your reasoning.
|}

<br>
<br>

{{BR}}
= OERs on the Topic =

The English Wikipedia article on [[English:Mathematical proof|Mathematical proof]] provides a broad overview of proof concepts, methods, history, and related terminology.

<iframe> https://en.m.wikipedia.org/wiki/Mathematical_proof </iframe>

<br>

For further open study, follow the internal links in this course to [[English:Mathematical logic|Mathematical logic]], [[English:Proof by contradiction|Proof by contradiction]], [[English:Mathematical induction|Mathematical induction]], [[English:Contraposition|Contraposition]], [[English:Counterexample|Counterexample]], [[English:Axiom|Axiom]], and [[English:Theorem|Theorem]]. The embedded Wikimedia Commons diagrams and educational YouTube videos can be revisited when you compare verbal, symbolic, visual, and procedural explanations.

{{BR}}
= Linked Learning Areas =

{| align=center
{{:D-Tab}}
'''[[English:Proof and Mathematical Reasoning|Proof and Mathematical Reasoning]]'''
# [[English:Mathematical proof|Mathematical proof]]
# [[English:Mathematical logic|Mathematical logic]]
# [[English:Direct proof|Direct proof]]
# [[English:Proof by contradiction|Proof by contradiction]]
# [[English:Contraposition|Contraposition]]
# [[English:Mathematical induction|Mathematical induction]]
# [[English:Counterexample|Counterexample]]
# [[English:Quantifier (logic)|Quantifiers]]
# [[English:Necessary and sufficient condition|Necessary and sufficient condition]]
# [[English:Geometry|Geometry]]
# [[English:Number theory|Number theory]]
# [[English:Discrete mathematics|Discrete mathematics]]
# [[English:Computer science|Computer science]]
|}

{{BR}}
= aiMOOC Projects =
[[Category:English]]
[[Category:Proof and Mathematical Reasoning]]
[[Category:Mathematics]]
[[Category:Mathematical logic]]
[[Category:Proof]]
[[Category:Grades 11-13]]
[[Category:Secondary education]]
[[Category:AI_MOOC]]
[[Category:GPT aiMOOC]]
{{MT}}

English:Proof and Mathematical Reasoning - Versionsgeschichte

Glanz: aiMOOC über GPT aiMOOC Action erstellt