Mathematics All Around (6th Edition)
6th Edition
ISBN: 9780134434681
Author: Tom Pirnot
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 5.3, Problem 66E
To determine
To write:
The binary number
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
Mathematics All Around (6th Edition)
Ch. 5.1 - Write the Egyptian numerals using Hindu-Arabic...Ch. 5.1 - Write the Egyptian numerals using Hindu-Arabic...Ch. 5.1 - Prob. 3ECh. 5.1 - Write the Egyptian numerals using Hindu-Arabic...Ch. 5.1 - Write each Hindu-Arabic numeral using Egyptian...Ch. 5.1 - Write each Hindu-Arabic numeral using Egyptian...Ch. 5.1 - Prob. 7ECh. 5.1 - Write each Hindu-Arabic numeral using Egyptian...Ch. 5.1 - Prob. 9ECh. 5.1 - Perform each of the following addition problems...
Ch. 5.1 - Prob. 11ECh. 5.1 - Perform each of the following addition problems...Ch. 5.1 - Perform each of the following subtraction problems...Ch. 5.1 - Perform each of the following subtraction problems...Ch. 5.1 - Perform each of the following subtraction problems...Ch. 5.1 - Perform each of the following subtraction problems...Ch. 5.1 - Prob. 17ECh. 5.1 - Use the Egyptian method of doubling to calculate...Ch. 5.1 - Prob. 19ECh. 5.1 - Use the Egyptian method of doubling to calculate...Ch. 5.1 - Prob. 21ECh. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Write each Roman numeral using Hindu-Arabic...Ch. 5.1 - Prob. 31ECh. 5.1 - Write each numeral in Roman notation There may be...Ch. 5.1 - Prob. 33ECh. 5.1 - Write each numeral in Roman notation There may be...Ch. 5.1 - Prob. 35ECh. 5.1 - Write each numeral in Roman notation There may be...Ch. 5.1 - Prob. 37ECh. 5.1 - Write each numeral in Roman notation There may be...Ch. 5.1 - Write each Chinese numeral as a Hindu-Arabic...Ch. 5.1 - Write each Chinese numeral as a Hindu-Arabic...Ch. 5.1 - Write each Chinese numeral as a Hindu-Arabic...Ch. 5.1 - Write each Chinese numeral as a Hindu-Arabic...Ch. 5.1 - Write each Chinese numeral as a Hindu-Arabic...Ch. 5.1 - Write each Chinese numeral as a Hindu-Arabic...Ch. 5.1 - Write each numeral using Chinese numerals. 495Ch. 5.1 - Write each numeral using Chinese numerals. 726Ch. 5.1 - Write each numeral using Chinese numerals. 2,805Ch. 5.1 - Write each numeral using Chinese numerals. 3,926Ch. 5.1 - Write each numeral using Chinese numerals. 9,846Ch. 5.1 - Write each numeral using Chinese numerals. 8,054Ch. 5.1 - The Great Pyramid at Giza was completed in . Write...Ch. 5.1 - Cheops, the builder of the Great Pyramid at Giza,...Ch. 5.1 - An Egyptian merchant has a warehouse that contains...Ch. 5.1 - An ancient Egyptian merchant had on hand bushels...Ch. 5.1 - Using Egyptian notation, the number 100,...Ch. 5.1 - Using Egyptian notation, the number 100,...Ch. 5.1 - Using Egyptian notation, the number 100,...Ch. 5.1 - Using Egyptian notation, the number 100,...Ch. 5.1 - The emperor Aurelius Constantine, who lived from...Ch. 5.1 - By 285ad, the Roman Empire had become so vast that...Ch. 5.1 - Frequently, Roman numerals are used today in movie...Ch. 5.1 - Prob. 62ECh. 5.1 - Prob. 63ECh. 5.1 - Frequently, Roman numerals are used today in movie...Ch. 5.1 - The counting boards In Exercises 6568 show...Ch. 5.1 - The counting boards In Exercises 6568 show...Ch. 5.1 - The counting boards In Exercises 6568 show...Ch. 5.1 - The counting boards In Exercises 6568 show...Ch. 5.1 - The oldest discovery of Chinese written numerals...Ch. 5.1 - When Marco Polo visited China in 1274, he was...Ch. 5.1 - Explain two advantages of the Roman numeration...Ch. 5.1 - The Roman numeration system has symbols for 5,50,...Ch. 5.1 - The traditional Chinese numeration system had no...Ch. 5.1 - Research the Ionic Greek numeration system, which...Ch. 5.1 - In the Egyptian numeration system, whenever we...Ch. 5.1 - Suppose that Egyptian numeration was based on 5...Ch. 5.1 - Invent an Egyptian type of numeration system using...Ch. 5.1 - Write the number 1,999 in Roman numerals in as...Ch. 5.1 - Egyptian mathematics had a unique way of writing...Ch. 5.1 - Egyptian mathematics had a unique way of writing...Ch. 5.1 - Egyptian mathematics had a unique way of writing...Ch. 5.1 - Egyptian mathematics had a unique way of writing...Ch. 5.2 - Write the following Babylonian numerals as...Ch. 5.2 - Write the following Babylonian numerals as...Ch. 5.2 - Write the following Babylonian numerals as...Ch. 5.2 - Write the following Babylonian numerals as...Ch. 5.2 - Write each number using Babylonian notation. 8,235Ch. 5.2 - Write each number using Babylonian notation. 7,331Ch. 5.2 - Write each number using Babylonian notation....Ch. 5.2 - Write each number using Babylonian notation....Ch. 5.2 - Write each number using Babylonian notation....Ch. 5.2 - Write each number using Babylonian notation....Ch. 5.2 - Write each number using Babylonian notation....Ch. 5.2 - Write each number using Babylonian notation....Ch. 5.2 - Translate each of the following Mayan numerals to...Ch. 5.2 - Translate each of the following Mayan numerals to...Ch. 5.2 - Translate each of the following Mayan numerals to...Ch. 5.2 - Translate each of the following Mayan numerals to...Ch. 5.2 - Write each number using Mayan notation. 17Ch. 5.2 - Write each number using Mayan notation. 48Ch. 5.2 - Prob. 19ECh. 5.2 - Prob. 20ECh. 5.2 - Prob. 21ECh. 5.2 - Prob. 22ECh. 5.2 - Prob. 23ECh. 5.2 - Prob. 24ECh. 5.2 - Prob. 25ECh. 5.2 - Prob. 26ECh. 5.2 - Prob. 27ECh. 5.2 - Prob. 28ECh. 5.2 - Prob. 29ECh. 5.2 - Prob. 30ECh. 5.2 - Prob. 31ECh. 5.2 - Prob. 32ECh. 5.2 - Prob. 33ECh. 5.2 - Prob. 34ECh. 5.2 - Prob. 35ECh. 5.2 - Prob. 36ECh. 5.2 - Prob. 37ECh. 5.2 - Prob. 38ECh. 5.2 - Prob. 39ECh. 5.2 - Prob. 40ECh. 5.2 - Prob. 41ECh. 5.2 - Prob. 42ECh. 5.2 - Prob. 43ECh. 5.2 - Prob. 44ECh. 5.2 - Prob. 45ECh. 5.2 - Prob. 46ECh. 5.2 - Prob. 47ECh. 5.2 - Prob. 48ECh. 5.2 - Prob. 49ECh. 5.2 - Prob. 50ECh. 5.2 - Prob. 51ECh. 5.2 - Prob. 52ECh. 5.2 - Prob. 53ECh. 5.2 - Prob. 54ECh. 5.2 - Prob. 55ECh. 5.2 - Prob. 56ECh. 5.2 - Prob. 57ECh. 5.2 - Prob. 58ECh. 5.2 - Prob. 59ECh. 5.2 - Prob. 60ECh. 5.2 - Prob. 61ECh. 5.2 - Prob. 62ECh. 5.2 - Prob. 63ECh. 5.2 - Prob. 64ECh. 5.2 - Prob. 65ECh. 5.2 - Prob. 66ECh. 5.2 - Prob. 67ECh. 5.2 - Prob. 68ECh. 5.2 - Prob. 69ECh. 5.2 - Prob. 70ECh. 5.2 - Prob. 71ECh. 5.2 - Prob. 72ECh. 5.2 - Prob. 73ECh. 5.2 - Prob. 74ECh. 5.2 - Prob. 75ECh. 5.2 - Prob. 76ECh. 5.2 - Prob. 77ECh. 5.2 - Prob. 78ECh. 5.2 - Prob. 79ECh. 5.2 - Prob. 80ECh. 5.3 - Prob. 1ECh. 5.3 - Prob. 2ECh. 5.3 - Prob. 3ECh. 5.3 - Prob. 4ECh. 5.3 - Prob. 5ECh. 5.3 - Prob. 6ECh. 5.3 - Prob. 7ECh. 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 - Prob. 15ECh. 5.3 - Prob. 16ECh. 5.3 - Prob. 17ECh. 5.3 - Prob. 18ECh. 5.3 - Prob. 19ECh. 5.3 - Prob. 20ECh. 5.3 - Prob. 21ECh. 5.3 - Prob. 22ECh. 5.3 - Prob. 23ECh. 5.3 - Prob. 24ECh. 5.3 - Prob. 25ECh. 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 - Prob. 39ECh. 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 - Prob. 47ECh. 5.3 - Prob. 48ECh. 5.3 - Prob. 49ECh. 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.3 - Prob. 69ECh. 5.3 - Prob. 70ECh. 5.3 - Prob. 71ECh. 5.3 - Prob. 72ECh. 5.3 - Prob. 73ECh. 5.3 - Prob. 74ECh. 5.3 - Prob. 75ECh. 5.3 - Prob. 76ECh. 5.3 - Prob. 77ECh. 5.3 - Prob. 78ECh. 5.3 - Prob. 79ECh. 5.3 - Prob. 80ECh. 5.3 - Prob. 81ECh. 5.3 - Prob. 82ECh. 5.3 - Prob. 83ECh. 5.3 - Prob. 84ECh. 5.3 - Prob. 85ECh. 5.3 - Prob. 86ECh. 5.3 - Prob. 87ECh. 5.3 - Prob. 88ECh. 5.3 - Prob. 89ECh. 5.3 - Prob. 90ECh. 5.3 - Prob. 91ECh. 5.3 - Prob. 92ECh. 5.3 - Prob. 93ECh. 5.3 - Prob. 94ECh. 5.3 - Prob. 95ECh. 5.3 - Prob. 96ECh. 5.3 - Prob. 97ECh. 5.3 - Prob. 98ECh. 5.3 - Prob. 99ECh. 5.3 - Prob. 100ECh. 5.3 - Prob. 101ECh. 5.3 - Prob. 102ECh. 5.4 - Prob. 1ECh. 5.4 - Prob. 2ECh. 5.4 - Prob. 3ECh. 5.4 - Prob. 4ECh. 5.4 - Prob. 5ECh. 5.4 - Prob. 6ECh. 5.4 - Prob. 7ECh. 5.4 - Prob. 8ECh. 5.4 - Prob. 9ECh. 5.4 - Prob. 10ECh. 5.4 - Prob. 11ECh. 5.4 - Prob. 12ECh. 5.4 - Prob. 13ECh. 5.4 - Prob. 14ECh. 5.4 - Prob. 15ECh. 5.4 - Prob. 16ECh. 5.4 - Prob. 17ECh. 5.4 - Prob. 18ECh. 5.4 - Prob. 19ECh. 5.4 - Prob. 20ECh. 5.4 - Prob. 21ECh. 5.4 - Prob. 22ECh. 5.4 - Prob. 23ECh. 5.4 - Prob. 24ECh. 5.4 - Prob. 25ECh. 5.4 - Prob. 26ECh. 5.4 - Prob. 27ECh. 5.4 - Prob. 28ECh. 5.4 - Prob. 29ECh. 5.4 - Prob. 30ECh. 5.4 - Prob. 31ECh. 5.4 - Prob. 32ECh. 5.4 - Prob. 33ECh. 5.4 - Prob. 34ECh. 5.4 - Prob. 35ECh. 5.4 - Prob. 36ECh. 5.4 - Prob. 37ECh. 5.4 - Prob. 38ECh. 5.4 - Prob. 39ECh. 5.4 - Prob. 40ECh. 5.4 - Prob. 41ECh. 5.4 - Prob. 42ECh. 5.4 - Prob. 43ECh. 5.4 - Prob. 44ECh. 5.4 - Prob. 45ECh. 5.4 - Prob. 46ECh. 5.4 - Prob. 47ECh. 5.4 - Prob. 48ECh. 5.4 - Prob. 49ECh. 5.4 - Prob. 50ECh. 5.4 - Prob. 51ECh. 5.4 - Prob. 52ECh. 5.4 - Prob. 53ECh. 5.4 - Prob. 54ECh. 5.4 - Prob. 55ECh. 5.4 - Prob. 56ECh. 5.4 - a. Why are check digits important? Give an...Ch. 5.4 - Prob. 58ECh. 5.4 - Prob. 59ECh. 5.4 - Prob. 60ECh. 5.4 - Prob. 61ECh. 5.4 - Prob. 62ECh. 5.4 - Prob. 63ECh. 5.4 - Challenge Yourself When we do usual division of...Ch. 5.4 - Prob. 65ECh. 5.CR - Prob. 1CRCh. 5.CR - Prob. 2CRCh. 5.CR - Prob. 3CRCh. 5.CR - Prob. 4CRCh. 5.CR - Prob. 5CRCh. 5.CR - Prob. 6CRCh. 5.CR - Prob. 7CRCh. 5.CR - Prob. 8CRCh. 5.CR - Prob. 9CRCh. 5.CR - Prob. 10CRCh. 5.CR - Prob. 11CRCh. 5.CR - Prob. 12CRCh. 5.CR - Prob. 13CRCh. 5.CR - Prob. 14CRCh. 5.CR - Prob. 15CRCh. 5.CR - Prob. 16CRCh. 5.CR - Prob. 17CRCh. 5.CR - Prob. 18CRCh. 5.CR - Prob. 19CRCh. 5.CR - Prob. 20CRCh. 5.CR - Prob. 21CRCh. 5.CR - Prob. 22CRCh. 5.CR - Prob. 23CRCh. 5.CT - Write 3,685 in Roman notation.Ch. 5.CT - Prob. 2CTCh. 5.CT - Write 2647 and A3E16 as base-10 numerals.Ch. 5.CT - Prob. 4CTCh. 5.CT - Prob. 5CTCh. 5.CT - Prob. 6CTCh. 5.CT - Prob. 7CTCh. 5.CT - Prob. 8CTCh. 5.CT - Prob. 9CTCh. 5.CT - Prob. 10CTCh. 5.CT - Prob. 11CTCh. 5.CT - Prob. 12CTCh. 5.CT - Prob. 13CTCh. 5.CT - Prob. 14CTCh. 5.CT - Prob. 15CTCh. 5.CT - Prob. 16CTCh. 5.CT - Prob. 17CTCh. 5.CT - Prob. 18CTCh. 5.CT - Prob. 19CTCh. 5.CT - Prob. 20CTCh. 5.CT - Prob. 21CTCh. 5.CT - Prob. 22CT
Knowledge Booster
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
Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSON
Discrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education