A real number s that is irrational is called algebraic if it is the root of a polynomial equation with integer coefficents. For example, s = v2 is alge- braic since it is a root of r2-2 0. Numbers that are irrational but not algebraic are called transcendental. (a) Show that the set of all algebraic numbers is countable. Hint: show that there are countably many polynomials with integer coeffi- cients. You may assume that a polynomial of degree n has n roots. You may also assume class theorems, and that if A is a countable set, then for n > 1, the set of n-tuples of elements of A, A" = {(a1, a2, .., a„) : each a, E A} is also countable. (b) Show that the set of all transcendental numbers is uncountable.

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter4: Polynomial And Rational Functions
Section4.5: Zeros Of Polynomial Functions
Problem 79E
icon
Related questions
icon
Concept explainers
Question
Need a and b
A real number s that is irrational is called algebraic if it is the root of a
polynomial equation with integer coefficents. For example, s = v2 is alge-
braic since it is a root of r2 - 2 = 0. Numbers that are irrational but not
algebraic are called transcendental.
(a) Show that the set of all algebraic numbers is countable.
Hint: show that there are countably many polynomials with integer coeffi-
cients. You may assume that a polynomial of degree n has n roots. You may
also assume class theorems, and that if A is a countable set, then for n > 1,
the set of n-tuples of elements of A, A" = {(a1, a2, ..., a,) : each a; € A} is
also countable.
(b) Show that the set of all transcendental numbers is uncountable.
Transcribed Image Text:A real number s that is irrational is called algebraic if it is the root of a polynomial equation with integer coefficents. For example, s = v2 is alge- braic since it is a root of r2 - 2 = 0. Numbers that are irrational but not algebraic are called transcendental. (a) Show that the set of all algebraic numbers is countable. Hint: show that there are countably many polynomials with integer coeffi- cients. You may assume that a polynomial of degree n has n roots. You may also assume class theorems, and that if A is a countable set, then for n > 1, the set of n-tuples of elements of A, A" = {(a1, a2, ..., a,) : each a; € A} is also countable. (b) Show that the set of all transcendental numbers is uncountable.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Points, Lines and Planes
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
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
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
Trigonometry (MindTap Course List)
Trigonometry (MindTap Course List)
Trigonometry
ISBN:
9781337278461
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell