Here's an incorrect theorem with an incorrect proof. Theorem: All people are the same age. Proof: Let P(n) be the statement "any set of n people all have the same age". If we can prove P(n) for all n, then the theorem is true. We prove P(n) by induction. Base case: Given any one person, that person has the same age as himself/herself. So P(1) is true. Inductive step: Suppose n > 2 and P(n − 1) is true. Take a set of n people: {P1, P2, ..., Pn}. Because P(n-1) is true, people P₁, P2, ..., Pn-1 all have the same age. Also because P(n-1) is true, people P2, P3, ..., Pn all have the same age. Therefore people p₁, P2, ..., Pn all have the same age. This works for any set of n people, so P(n) is true. So P(n) is true for all n. Explain in a few sentences what's wrong with the proof.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.2: Mathematical Induction
Problem 39E
icon
Related questions
Question
Here's an incorrect theorem with an incorrect proof.
Theorem: All people are the same age.
Proof: Let P(n) be the statement "any set of n people all have the same age". If we can prove P(n) for all n, then the theorem is true.
We
prove P(n) by induction.
Base case: Given any one person, that person has the same age as himself/herself. So P(1) is true.
Inductive step: Suppose n > 2 and P(n − 1) is true. Take a set of n people:
{P₁, P2, ..., Pn}.
-
Because P(n − 1) is true, people p₁, P2, ..., Pn-1 all have the same age. Also because P(n − 1) is true, people P2, P3, ..., Pn all have the
same age. Therefore people p₁, P2, …, Pn all have the sa ne age. This works for any set of n people, so P(n) is true.
So P(n) is true for all n.
Explain in a few sentences what's wrong with the proof.
Transcribed Image Text:Here's an incorrect theorem with an incorrect proof. Theorem: All people are the same age. Proof: Let P(n) be the statement "any set of n people all have the same age". If we can prove P(n) for all n, then the theorem is true. We prove P(n) by induction. Base case: Given any one person, that person has the same age as himself/herself. So P(1) is true. Inductive step: Suppose n > 2 and P(n − 1) is true. Take a set of n people: {P₁, P2, ..., Pn}. - Because P(n − 1) is true, people p₁, P2, ..., Pn-1 all have the same age. Also because P(n − 1) is true, people P2, P3, ..., Pn all have the same age. Therefore people p₁, P2, …, Pn all have the sa ne age. This works for any set of n people, so P(n) is true. So P(n) is true for all n. Explain in a few sentences what's wrong with the proof.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning