Let 1 = a1 < a2 < a3 < … < ak = n be the positive divisors of n in increasing order.  For example, if n = 12, we have a1 = 1, a2 = 2, a3 = 3, a4 = 4, a5 = 6, a7 = 12. If n = (a3)3 – (a2)3, what is n?

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.4: Prime Factors And Greatest Common Divisor
Problem 24E: Let (a,b)=1. Prove that (a,bn)=1 for all positive integers n.
icon
Related questions
Question

Let 1 = a1 < a2 < a3 < … < ak = n be the positive divisors of n in increasing order.  For example, if n = 12, we have a1 = 1, a2 = 2, a3 = 3, a4 = 4, a5 = 6, a7 = 12.

If n = (a3)3 – (a2)3, what is n?

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Relations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning