Let n E N. Prove that if |n − 1| + |n + 1| ≤ 1, then |n² − 1| ≤ 4.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

I have the following statement which is to be proven trivially or vacuously,

I attempted to prove it vacuously by looking at |n-1|+|n+1|≤1, further simplifying this we get |2n|≤1, which for any natural integer is false {taking into account that 0 does not count in the natural numbers}. Is this the right approach?, my book says this is trivial, Im just really puzzled here.

Let n € N. Prove that if |n − 1| + |n + 1| ≤ 1, then |n² − 1| ≤ 4.
Transcribed Image Text:Let n € N. Prove that if |n − 1| + |n + 1| ≤ 1, then |n² − 1| ≤ 4.
Expert Solution
Step 1: Concept used

Advanced Math homework question answer, step 1, image 1

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,