Prove: 1. There exists an integer n, so that n³ - n is odd. 2. For all a, b E Z†, if a > 1 and b > 1, then gcd (a, b) < gcd (a³,b³) (if false, prove by negation)

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter3: Functions And Graphs
Section3.5: Graphs Of Functions
Problem 56E
icon
Related questions
Question
Prove:
1. There exists an integer n, so that n³ - n is odd.
2. For all a, b E Z†, if a > 1 and b > 1, then gcd (a, b) < gcd
(a³,b³)
(if false, prove by negation)
Transcribed Image Text:Prove: 1. There exists an integer n, so that n³ - n is odd. 2. For all a, b E Z†, if a > 1 and b > 1, then gcd (a, b) < gcd (a³,b³) (if false, prove by negation)
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning