Mathematical Ideas (13th Edition) - Standalone book
13th Edition
ISBN: 9780321977076
Author: Charles D. Miller, Vern E. Heeren, John Hornsby, Christopher Heeren
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 5.3, Problem 30E
To determine
To calculate:
The even number 54 as the sum of two primes.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Problem 11 (a) A tank is discharging water through an orifice at a depth of T
meter below the surface of the water whose area is A m². The
following are the values of a for the corresponding values of A:
A 1.257 1.390
x 1.50 1.65
1.520 1.650 1.809 1.962 2.123 2.295 2.462|2.650
1.80 1.95 2.10 2.25 2.40 2.55 2.70
2.85
Using the formula
-3.0
(0.018)T =
dx.
calculate T, the time in seconds for the level of the water to drop
from 3.0 m to 1.5 m above the orifice.
(b) The velocity of a train which starts from rest is given by the fol-
lowing table, the time being reckoned in minutes from the start
and the speed in km/hour:
| † (minutes) |2|4 6 8 10 12
14 16 18 20
v (km/hr) 16 28.8 40 46.4 51.2 32.0 17.6 8 3.2 0
Estimate approximately the total distance ran in 20 minutes.
-
Let n = 7, let p = 23 and let S be the set of least positive residues mod p of the first (p − 1)/2
multiple of n, i.e.
n mod p, 2n mod p, ...,
p-1
2
-n mod p.
Let T be the subset of S consisting of those residues which exceed p/2.
Find the set T, and hence compute the Legendre symbol (7|23).
23
32
how come?
The first 11 multiples of 7 reduced mod 23 are
7, 14, 21, 5, 12, 19, 3, 10, 17, 1, 8.
The set T is the subset of these residues exceeding
So T = {12, 14, 17, 19, 21}.
By Gauss' lemma (Apostol Theorem 9.6),
(7|23) = (−1)|T| = (−1)5 = −1.
Let n = 7, let p = 23 and let S be the set of least positive residues mod p of the first (p-1)/2
multiple of n, i.e.
n mod p, 2n mod p, ...,
2
p-1
-n mod p.
Let T be the subset of S consisting of those residues which exceed p/2.
Find the set T, and hence compute the Legendre symbol (7|23).
The first 11 multiples of 7 reduced mod 23 are
7, 14, 21, 5, 12, 19, 3, 10, 17, 1, 8.
23
The set T is the subset of these residues exceeding
2°
So T = {12, 14, 17, 19, 21}.
By Gauss' lemma (Apostol Theorem 9.6),
(7|23) = (−1)|T| = (−1)5 = −1.
how come?
Chapter 5 Solutions
Mathematical Ideas (13th Edition) - Standalone book
Ch. 5.1 - Decide whether each statement is true or false
1....Ch. 5.1 - Decide whether each statement is true or false. If...Ch. 5.1 - Decide whether each statement is true or false....Ch. 5.1 - Prob. 4ECh. 5.1 - Prob. 5ECh. 5.1 - Prob. 6ECh. 5.1 - Decide whether each statement is true or false.
7....Ch. 5.1 - Prob. 8ECh. 5.1 - Prob. 9ECh. 5.1 - Find all natural number factors of each...
Ch. 5.1 - Find all natural number factors of each number. 28Ch. 5.1 - Find all natural number factors of each number. 72Ch. 5.1 - Use divisibility tests to decide whether the given...Ch. 5.1 - Use divisibility tests to decide whether the given...Ch. 5.1 - Use divisibility tests to decide whether the given...Ch. 5.1 - Prob. 16ECh. 5.1 - (a) In constructing the Sieve of Eratosthenes for...Ch. 5.1 - (a) Continue the Sieve of Eratosthenes in Table 1...Ch. 5.1 - In your list for Exercise 18(a). consider the six...Ch. 5.1 - Prob. 20ECh. 5.1 - Prob. 21ECh. 5.1 - Prob. 22ECh. 5.1 - Prob. 23ECh. 5.1 - Prob. 24ECh. 5.1 - Prob. 25ECh. 5.1 - Prob. 26ECh. 5.1 - Prob. 27ECh. 5.1 - Find the prime factorization of each composite...Ch. 5.1 - Prob. 29ECh. 5.1 - Prob. 30ECh. 5.1 - Here is a divisibility test for 7.
(a) Double the...Ch. 5.1 - Here is a divisibility test for 7. (a)Double the...Ch. 5.1 - Prob. 33ECh. 5.1 - Prob. 34ECh. 5.1 - Here is a divisibility test for 11. (a) Starting...Ch. 5.1 - Prob. 36ECh. 5.1 - Here is a divisibility test for 11.
(a) Starting...Ch. 5.1 - Prob. 38ECh. 5.1 - 39. Consider the divisibility test for the...Ch. 5.1 - 40. Give two factorizations of the number 75 that...Ch. 5.1 - Prob. 41ECh. 5.1 - Determine all possible digit replacements for x so...Ch. 5.1 - Determine all possible digit replacements for x so...Ch. 5.1 - Determine all possible digit replacements for x so...Ch. 5.1 - Prob. 45ECh. 5.1 - Prob. 46ECh. 5.1 - Prob. 47ECh. 5.1 - Prob. 48ECh. 5.1 - Prob. 49ECh. 5.1 - Prob. 50ECh. 5.1 - Leap years occur when the year number is divisible...Ch. 5.1 - Prob. 52ECh. 5.1 - Prob. 53ECh. 5.1 - Leap years occur when the year number is divisible...Ch. 5.1 - Prob. 55ECh. 5.1 - Prob. 56ECh. 5.1 - Prob. 57ECh. 5.1 - 58. Choose any 6-digit number consisting of three...Ch. 5.1 - One of the authors has three sons who were born....Ch. 5.1 -
Ore of the authors has three sons who were born,...Ch. 5.1 - Prob. 61ECh. 5.1 - Prob. 62ECh. 5.2 - In Exercises 1-6 decide whether each statement is...Ch. 5.2 - In Exercises 1-6 decide whether each statement is...Ch. 5.2 - In Exercises 1-6 decide whether each statement is...Ch. 5.2 - Prob. 4ECh. 5.2 - In Exercises 1-6 decide whether each statement is...Ch. 5.2 - Prob. 6ECh. 5.2 - Prob. 7ECh. 5.2 - Prob. 8ECh. 5.2 - Prob. 9ECh. 5.2 - Prob. 10ECh. 5.2 - Prob. 11ECh. 5.2 - Prob. 12ECh. 5.2 - Prob. 13ECh. 5.2 - Prob. 14ECh. 5.2 - 15. (a) Evaluate the Fermat number for .
(b) In...Ch. 5.2 - 16. (a) Verify the value given in the text for the...Ch. 5.2 - Prob. 17ECh. 5.2 - Prob. 18ECh. 5.2 - 19. Why do you suppose it normally takes up to a...Ch. 5.2 - Prob. 20ECh. 5.2 - Prob. 21ECh. 5.2 - 22. Explain n your own words the proof by Euclid...Ch. 5.2 - 23. For the composite number , find
Ch. 5.2 - Prob. 24ECh. 5.2 - Prob. 25ECh. 5.2 - Prob. 26ECh. 5.2 - Prob. 27ECh. 5.2 - Prob. 28ECh. 5.2 - Explain why large prime numbers are important in...Ch. 5.2 - 30. Describe the difference between Mersenne...Ch. 5.3 - In Exercises 1-10 decide whether each statement is...Ch. 5.3 - Prob. 2ECh. 5.3 - In Exercises 1-10 decide whether each statement is...Ch. 5.3 - In Exercises 1-10 decide whether each statement is...Ch. 5.3 - Prob. 5ECh. 5.3 - In Exercises 1-10 decide whether each statement is...Ch. 5.3 - In Exercises 1-10 decide whether each statement is...Ch. 5.3 - Prob. 8ECh. 5.3 - Prob. 9ECh. 5.3 - Prob. 10ECh. 5.3 - Prob. 11ECh. 5.3 - Prob. 12ECh. 5.3 - Prob. 13ECh. 5.3 - Prob. 14ECh. 5.3 - It has been proved that the reciprocals of all the...Ch. 5.3 - Prob. 16ECh. 5.3 - Prob. 17ECh. 5.3 - Prob. 18ECh. 5.3 - Prob. 19ECh. 5.3 - Prob. 20ECh. 5.3 - 21. There are four abundant numbers between 1 and...Ch. 5.3 - Prob. 22ECh. 5.3 - Prob. 23ECh. 5.3 - Prob. 24ECh. 5.3 - 25. The proper divisors of 1184 are 1.2. 4. 8, 16,...Ch. 5.3 - Prob. 26ECh. 5.3 - Prob. 27ECh. 5.3 - Prob. 28ECh. 5.3 - Prob. 29ECh. 5.3 - Prob. 30ECh. 5.3 - Prob. 31ECh. 5.3 - Prob. 32ECh. 5.3 - Prob. 33ECh. 5.3 - Prob. 34ECh. 5.3 - Prob. 35ECh. 5.3 - Prob. 36ECh. 5.3 - Prob. 37ECh. 5.3 - Prob. 38ECh. 5.3 - The first four perfect numbers were identified in...Ch. 5.3 - Prob. 40ECh. 5.3 - Prob. 41ECh. 5.3 - Prob. 42ECh. 5.3 - Prob. 43ECh. 5.3 - Prob. 44ECh. 5.3 - Prob. 45ECh. 5.3 - Prob. 46ECh. 5.3 - 47. Explain why the primorial formula does not...Ch. 5.3 - Prob. 48ECh. 5.3 - 49. Choose the correct completion: The primorial...Ch. 5.3 - Prob. 50ECh. 5.3 - Prob. 51ECh. 5.3 - Prob. 52ECh. 5.3 - Prob. 53ECh. 5.3 - Prob. 54ECh. 5.3 - Prob. 55ECh. 5.3 - Prob. 56ECh. 5.3 - Prob. 57ECh. 5.3 - Prob. 58ECh. 5.3 - Prob. 59ECh. 5.3 - Prob. 60ECh. 5.3 - Prob. 61ECh. 5.3 - Prob. 62ECh. 5.3 - Prob. 63ECh. 5.3 - Prob. 64ECh. 5.3 - Prob. 65ECh. 5.3 - Prob. 66ECh. 5.3 - Prob. 67ECh. 5.3 - Prob. 68ECh. 5.4 - Decide whether each statement is true or false. No...Ch. 5.4 - Decide whether each statement is true or false.
2....Ch. 5.4 - Decide whether each statement is true or false. If...Ch. 5.4 - Decide whether each statement is true or false.
4....Ch. 5.4 - Decide whether each statement is true or false....Ch. 5.4 - Decide whether each statement is true or false....Ch. 5.4 - Decide whether each statement is true or false....Ch. 5.4 - Decide whether each statement is true or false....Ch. 5.4 - Decide whether each statement is true or false.
9....Ch. 5.4 - Decide whether each statement is true or false....Ch. 5.4 - Use the prime factors method to find the greatest...Ch. 5.4 - Use the prime factors method to find the greatest...Ch. 5.4 - Use the prime factors method to find the greatest...Ch. 5.4 - Use the prime factors method to find the greatest...Ch. 5.4 - Use the prime factors method to find the greatest...Ch. 5.4 - Use the prime factors method to find the greatest...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the Euclidean algorithm to find the greatest...Ch. 5.4 - Use the Euclidean algorithm to find the greatest...Ch. 5.4 - Use the Euclidean algorithm to find the greatest...Ch. 5.4 - Use the Euclidean algorithm to find the greatest...Ch. 5.4 - Use the Euclidean algorithm to find the greatest...Ch. 5.4 - Use the Euclidean algorithm to find the greatest...Ch. 5.4 - Use the prime factors method to find the least...Ch. 5.4 - Use the prime factors method to find the least...Ch. 5.4 - Use the prime factors method to find the least...Ch. 5.4 - Use the prime factors method to find the least...Ch. 5.4 - Use the prime factors method to find the least...Ch. 5.4 - Use the prime factors method to find the least...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the method of dividing by prime factors to...Ch. 5.4 - Use the formula given in the text on page 203and...Ch. 5.4 - Use the formula given in the text on page 203 and...Ch. 5.4 - Use the formula given in the text on page 203 and...Ch. 5.4 - Use the formula given in the text on page 203 and...Ch. 5.4 - Use the formula given in the text on page 203 and...Ch. 5.4 - Use the formula given in the text on page 203 and...Ch. 5.4 - Explain in your own words how to find the greatest...Ch. 5.4 - 48, Explain in your own words how to find the...Ch. 5.4 - If p. q, and r and different primes, and a. b, and...Ch. 5.4 - Find (a) the greatest common factor and (b) the...Ch. 5.4 - Prob. 51ECh. 5.4 - Prob. 52ECh. 5.4 - Prob. 53ECh. 5.4 - It is possible to extend the Euclidean algorithm...Ch. 5.4 - Prob. 55ECh. 5.4 - Suppose that the least common multiple of p and q...Ch. 5.4 - Prob. 57ECh. 5.4 - Prob. 58ECh. 5.4 - Prob. 59ECh. 5.4 - Refer to Examples 9 and 10 to solve each problem....Ch. 5.4 - Refer to Examples 9 and 10 to solve each...Ch. 5.4 - Refer to Examples 9 and 10 to solve each...Ch. 5.4 - Prob. 63ECh. 5.4 - Refer to Examples 9 and 10 to solve each problem....Ch. 5.5 - Answer each question concerning the Fibonacci...Ch. 5.5 - Prob. 2ECh. 5.5 - Prob. 3ECh. 5.5 - Prob. 4ECh. 5.5 - Prob. 5ECh. 5.5 - Prob. 6ECh. 5.5 - Prob. 7ECh. 5.5 - Prob. 8ECh. 5.5 - Prob. 9ECh. 5.5 - Prob. 10ECh. 5.5 - Prob. 11ECh. 5.5 - Prob. 12ECh. 5.5 - Prob. 13ECh. 5.5 - Prob. 14ECh. 5.5 - Prob. 15ECh. 5.5 - It has been shown that if m divides n, then Fm is...Ch. 5.5 - Prob. 17ECh. 5.5 - Prob. 18ECh. 5.5 - Prob. 19ECh. 5.5 - Prob. 20ECh. 5.5 - Prob. 21ECh. 5.5 - Prob. 22ECh. 5.5 - Prob. 23ECh. 5.5 - Prob. 24ECh. 5.5 - Prob. 25ECh. 5.5 - Prob. 26ECh. 5.5 - Prob. 27ECh. 5.5 - Recall (lie Pythagorean theorem from geometry: If...Ch. 5.5 - Recall (lie Pythagorean theorem from geometry: If...Ch. 5.5 - Prob. 30ECh. 5.5 - Prob. 31ECh. 5.5 - Prob. 32ECh. 5.5 - Prob. 33ECh. 5.5 - Prob. 34ECh. 5.5 - Prob. 35ECh. 5.5 - Prob. 36ECh. 5 - In Exercises 1-6, decide whether each statement is...Ch. 5 - In Exercises 1-6, decide whether each statement is...Ch. 5 - Prob. 3TCh. 5 - In Exercises 1-6, decide whether each statement is...Ch. 5 - Prob. 5TCh. 5 - Prob. 6TCh. 5 - Use divisibility tests to determine whether the...Ch. 5 - Prob. 8TCh. 5 - Prob. 9TCh. 5 - Prob. 10TCh. 5 - Prob. 11TCh. 5 - Prob. 12TCh. 5 - Give a pair of twin primes between 60 and 80.Ch. 5 - Prob. 14TCh. 5 - Prob. 15TCh. 5 - Prob. 16TCh. 5 - Prob. 17TCh. 5 - Prob. 18TCh. 5 - Prob. 19TCh. 5 - Prob. 20TCh. 5 - 21. Choose any term after the first in the...Ch. 5 - 22. Which one of the following is the exact value...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Shading a Venn diagram with 3 sets: Unions, intersections, and... The Venn diagram shows sets A, B, C, and the universal set U. Shade (CUA)' n B on the Venn diagram. U Explanation Check A- B Q Search 田arrow_forward3. A different 7-Eleven has a bank of slurpee fountain heads. Their available flavors are as follows: Mountain Dew, Mountain Dew Code Red, Grape, Pepsi and Mountain Dew Livewire. You fill five different cups full with each type of flavor. How many different ways can you arrange the cups in a line if exactly two Mountain Dew flavors are next to each other? 3.2.1arrow_forwardBusinessarrow_forward
- Please explain how come of X2(n).arrow_forwardNo chatgpt pls will upvotearrow_forwardFind all solutions of the polynomial congruence x²+4x+1 = 0 (mod 143). (The solutions of the congruence x² + 4x+1=0 (mod 11) are x = 3,4 (mod 11) and the solutions of the congruence x² +4x+1 = 0 (mod 13) are x = 2,7 (mod 13).)arrow_forward
- https://www.hawkeslearning.com/Statistics/dbs2/datasets.htmlarrow_forwardDetermine whether each function is an injection and determine whether each is a surjection.The notation Z_(n) refers to the set {0,1,2,...,n-1}. For example, Z_(4)={0,1,2,3}. f: Z_(6) -> Z_(6) defined by f(x)=x^(2)+4(mod6). g: Z_(5) -> Z_(5) defined by g(x)=x^(2)-11(mod5). h: Z*Z -> Z defined by h(x,y)=x+2y. j: R-{3} -> R defined by j(x)=(4x)/(x-3).arrow_forwardDetermine whether each function is an injection and determine whether each is a surjection.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
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
Propositional Logic, Propositional Variables & Compound Propositions; Author: Neso Academy;https://www.youtube.com/watch?v=Ib5njCwNMdk;License: Standard YouTube License, CC-BY
Propositional Logic - Discrete math; Author: Charles Edeki - Math Computer Science Programming;https://www.youtube.com/watch?v=rL_8y2v1Guw;License: Standard YouTube License, CC-BY
DM-12-Propositional Logic-Basics; Author: GATEBOOK VIDEO LECTURES;https://www.youtube.com/watch?v=pzUBrJLIESU;License: Standard Youtube License
Lecture 1 - Propositional Logic; Author: nptelhrd;https://www.youtube.com/watch?v=xlUFkMKSB3Y;License: Standard YouTube License, CC-BY
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY