Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
8th Edition
ISBN: 9781259676512
Author: Kenneth H Rosen
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 11.2, Problem 6E
How many weighings of a balance scale are needed to find a lighter coin among four coins? Describe an algorithm to find the lighter coin using this number of weighings.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The systolic blood pressure of individuals is thought to be related to both age and weight. Let the systolic blood pressure, age, and weight be represented by the variables x1, x2, and x3, respectively. Suppose that Minitab was used to generate the following descriptive statistics, correlations, and regression analysis for a random sample of 15 individuals.
Descriptive Statistics
Variable
N
Mean
Median
TrMean
StDev
SE Mean
x 1
15
154.14
154.34
154.14
3.842
0.992000
x 2
15
59.69
60.19
59.69
1.462
0.377487
x 3
15
205.55
204.75
205.55
4.558
1.176871
Variable
Minimum
Maximum
Q1
Q3
x 1
125
178
141.803
167.244
x 2
41
80
47.754
78.415
x 3
126
240
140.395
224.008
Correlations (Pearson)
x 1
x 2
x 2
0.892
x 3
0.839
0.567
Regression Analysis
The regression equation is
x 1 = 0.883 + 1.257x2 + 0.871x3
Predictor
Coef
StDev
T
P
Constant
0.883
0.635
1.39
0.095
x 2
1.257
0.635
1.98
0.036
x 3
0.871
0.419
2.08
0.030
S = 0.428
R-sq = 92.7 %…
According to health professionals, a person’s weight is expected to increase with age. To examine that statement, a nutritionist collected data from 11 random females from different age categories between the ages of 21 and 43. In the following table, x is the age of a person and y is the weight in pounds.
x, age
21
24
27
29
31
33
35
38
40
42
43
y, weight in lb
121.4
122.3
130.3
131.7
133.3
134.6
136.7
138.4
140.3
142.0
145.1
Select the correct graph of the least-squares line on a scatter diagram.
Good Day,
Would appreciate any assistance with this query.
Regards,
Chapter 11 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Ch. 11.1 - Prob. 1ECh. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3ECh. 11.1 - Prob. 4ECh. 11.1 - Prob. 5ECh. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Prob. 8ECh. 11.1 - Prob. 9ECh. 11.1 - Prob. 10E
Ch. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.1 - Prob. 13ECh. 11.1 - Prob. 14ECh. 11.1 - Let G he a simple graph with n vertices. Show that...Ch. 11.1 - Prob. 16ECh. 11.1 - Prob. 17ECh. 11.1 - Prob. 18ECh. 11.1 - Prob. 19ECh. 11.1 - Prob. 20ECh. 11.1 - Prob. 21ECh. 11.1 - A chain letter starts when a person sends a letter...Ch. 11.1 - A chain letter starts with a person sending a...Ch. 11.1 - Prob. 24ECh. 11.1 - Prob. 25ECh. 11.1 - Prob. 26ECh. 11.1 - Prob. 27ECh. 11.1 - Prob. 28ECh. 11.1 - Prob. 29ECh. 11.1 - Prob. 30ECh. 11.1 - Prob. 31ECh. 11.1 - Prob. 32ECh. 11.1 - Prob. 33ECh. 11.1 - Prob. 34ECh. 11.1 - Prob. 35ECh. 11.1 - Prob. 36ECh. 11.1 - Letnbe a power of 2. Show thatnnumbers can be...Ch. 11.1 - Prob. 38ECh. 11.1 - Prob. 39ECh. 11.1 - Prob. 40ECh. 11.1 - Prob. 41ECh. 11.1 - Prob. 42ECh. 11.1 - Prob. 43ECh. 11.1 - Prob. 44ECh. 11.1 - Draw the first seven rooted Fibonacci trees.Ch. 11.1 - Prob. 46ECh. 11.1 - Prob. 47ECh. 11.1 - Show that the average depth of a leaf in a binary...Ch. 11.2 - Build a binary search tree for the...Ch. 11.2 - Build a binary search tree for the words oenology,...Ch. 11.2 - How many comparisons are needed to locate or to...Ch. 11.2 - How many comparisons are needed to locate or to...Ch. 11.2 - Using alphabetical order, construct a binary...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - One of four coins may be counterfeit. If it is...Ch. 11.2 - Find the least number of comparisons needed to...Ch. 11.2 - Prob. 12ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 15ECh. 11.2 - Prob. 16ECh. 11.2 - Prob. 17ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 21ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 23ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 25ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - Suppose thatmis a positive integer with m>2An...Ch. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Suppose that m is a positive integer withm= 2. An...Ch. 11.2 - Suppose thatmis a positive integer withm= 2....Ch. 11.2 - Prob. 33ECh. 11.2 - Prob. 34ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 36ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 39ECh. 11.2 - Suppose that m is a positive integer withm= 2. An...Ch. 11.2 - Prob. 41ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 43ECh. 11.2 - Prob. 44ECh. 11.3 - Prob. 1ECh. 11.3 - Prob. 2ECh. 11.3 - Prob. 3ECh. 11.3 - Prob. 4ECh. 11.3 - Suppose that the vertex with the largest address...Ch. 11.3 - Prob. 6ECh. 11.3 - Prob. 7ECh. 11.3 - Prob. 8ECh. 11.3 - Prob. 9ECh. 11.3 - Prob. 10ECh. 11.3 - Prob. 11ECh. 11.3 - Prob. 12ECh. 11.3 - Prob. 13ECh. 11.3 - Prob. 14ECh. 11.3 - Prob. 15ECh. 11.3 - Prob. 16ECh. 11.3 - Prob. 17ECh. 11.3 - a) Represent the compound propositionsandusing...Ch. 11.3 - a) Represent(AB)(A(BA))using an ordered rooted...Ch. 11.3 - In how many ways can the stringbe fully...Ch. 11.3 - In how many ways can the stringbe fully...Ch. 11.3 - Draw the ordered rooted tree corresponding to each...Ch. 11.3 - What is the value of each of these prefix...Ch. 11.3 - What is the value of each of these postfix...Ch. 11.3 - Prob. 25ECh. 11.3 - Prob. 26ECh. 11.3 - Prob. 27ECh. 11.3 - Prob. 28ECh. 11.3 - Prob. 29ECh. 11.3 - Prob. 30ECh. 11.3 - Show that any well-formed formula in prefix...Ch. 11.3 - Prob. 32ECh. 11.3 - Prob. 33ECh. 11.3 - Prob. 34ECh. 11.4 - How many edges must be removed from a connected...Ch. 11.4 - Prob. 2ECh. 11.4 - Prob. 3ECh. 11.4 - Prob. 4ECh. 11.4 - Prob. 5ECh. 11.4 - Prob. 6ECh. 11.4 - Prob. 7ECh. 11.4 - Prob. 8ECh. 11.4 - Prob. 9ECh. 11.4 - Prob. 10ECh. 11.4 - Prob. 11ECh. 11.4 - Prob. 12ECh. 11.4 - Prob. 13ECh. 11.4 - Prob. 14ECh. 11.4 - Prob. 15ECh. 11.4 - Prob. 16ECh. 11.4 - Prob. 17ECh. 11.4 - Prob. 18ECh. 11.4 - Prob. 19ECh. 11.4 - Prob. 20ECh. 11.4 - Prob. 21ECh. 11.4 - Describe the tree produced by breadth-first search...Ch. 11.4 - Prob. 23ECh. 11.4 - Explain how breadth-first search or depth-first...Ch. 11.4 - Prob. 25ECh. 11.4 - Prob. 26ECh. 11.4 - Prob. 27ECh. 11.4 - Use backtracking to find a subset, if it exists,...Ch. 11.4 - Explain how backtracking can be used to find a...Ch. 11.4 - Prob. 30ECh. 11.4 - Prob. 31ECh. 11.4 - A spanning forest of a graphGis a forest that...Ch. 11.4 - Prob. 33ECh. 11.4 - Prob. 34ECh. 11.4 - Prob. 35ECh. 11.4 - A spanning forest of a graphGis a forest that...Ch. 11.4 - Prob. 37ECh. 11.4 - Prob. 38ECh. 11.4 - Prob. 39ECh. 11.4 - Prob. 40ECh. 11.4 - Prob. 41ECh. 11.4 - Prob. 42ECh. 11.4 - Prob. 43ECh. 11.4 - Prob. 44ECh. 11.4 - Prob. 45ECh. 11.4 - Prob. 46ECh. 11.4 - Prob. 47ECh. 11.4 - Prob. 48ECh. 11.4 - Prob. 49ECh. 11.4 - Prob. 50ECh. 11.4 - Prob. 51ECh. 11.4 - Prob. 52ECh. 11.4 - Prob. 53ECh. 11.4 - Prob. 54ECh. 11.4 - Prob. 55ECh. 11.4 - Prob. 56ECh. 11.4 - Prob. 57ECh. 11.4 - Prob. 58ECh. 11.4 - Prob. 59ECh. 11.4 - Prob. 60ECh. 11.4 - Prob. 61ECh. 11.5 - The roads represented by this graph are all...Ch. 11.5 - Prob. 2ECh. 11.5 - Prob. 3ECh. 11.5 - Prob. 4ECh. 11.5 - Prob. 5ECh. 11.5 - Prob. 6ECh. 11.5 - Prob. 7ECh. 11.5 - Prob. 8ECh. 11.5 - Prob. 9ECh. 11.5 - Prob. 10ECh. 11.5 - Prob. 11ECh. 11.5 - Prob. 12ECh. 11.5 - Prob. 13ECh. 11.5 - Prob. 14ECh. 11.5 - Prob. 15ECh. 11.5 - Prob. 16ECh. 11.5 - Prob. 17ECh. 11.5 - Prob. 18ECh. 11.5 - Prob. 19ECh. 11.5 - Prob. 20ECh. 11.5 - Prob. 21ECh. 11.5 - Prob. 22ECh. 11.5 - Express the algorithm devised in Exercise 22 in...Ch. 11.5 - Prob. 24ECh. 11.5 - Prob. 25ECh. 11.5 - Prob. 26ECh. 11.5 - Prob. 27ECh. 11.5 - Prob. 28ECh. 11.5 - Prob. 29ECh. 11.5 - Prob. 30ECh. 11.5 - Prob. 31ECh. 11.5 - Prob. 32ECh. 11.5 - Prob. 33ECh. 11.5 - Prob. 34ECh. 11.5 - Prob. 35ECh. 11 - Prob. 1RQCh. 11 - Prob. 2RQCh. 11 - Prob. 3RQCh. 11 - Prob. 4RQCh. 11 - Prob. 5RQCh. 11 - Prob. 6RQCh. 11 - Prob. 7RQCh. 11 - a) What is a binary search tree? b) Describe an...Ch. 11 - Prob. 9RQCh. 11 - Prob. 10RQCh. 11 - a) Explain how to use preorder, inorder, and...Ch. 11 - Show that the number of comparisons used by a...Ch. 11 - a) Describe the Huffman coding algorithm for...Ch. 11 - Draw the game tree for nim if the starting...Ch. 11 - Prob. 15RQCh. 11 - Prob. 16RQCh. 11 - a) Explain how backtracking can be used to...Ch. 11 - Prob. 18RQCh. 11 - Prob. 19RQCh. 11 - Show that a simple graph is a tree if and Only if...Ch. 11 - Prob. 2SECh. 11 - Prob. 3SECh. 11 - Prob. 4SECh. 11 - Prob. 5SECh. 11 - Prob. 6SECh. 11 - Prob. 7SECh. 11 - Prob. 8SECh. 11 - Prob. 9SECh. 11 - Prob. 10SECh. 11 - Prob. 11SECh. 11 - Prob. 12SECh. 11 - Prob. 13SECh. 11 - Prob. 14SECh. 11 - Prob. 15SECh. 11 - Prob. 16SECh. 11 - Prob. 17SECh. 11 - Prob. 18SECh. 11 - Prob. 19SECh. 11 - Prob. 20SECh. 11 - Prob. 21SECh. 11 - Prob. 22SECh. 11 - Prob. 23SECh. 11 - The listing of the vertices of an ordered rooted...Ch. 11 - The listing of the vertices of an ordered rooted...Ch. 11 - Prob. 26SECh. 11 - Prob. 27SECh. 11 - Prob. 28SECh. 11 - Prob. 29SECh. 11 - Show that if every circuit not passing through any...Ch. 11 - Prob. 31SECh. 11 - Prob. 32SECh. 11 - Prob. 33SECh. 11 - Prob. 34SECh. 11 - Prob. 35SECh. 11 - Prob. 36SECh. 11 - Prob. 37SECh. 11 - Prob. 38SECh. 11 - Prob. 39SECh. 11 - Prob. 40SECh. 11 - Prob. 41SECh. 11 - Prob. 42SECh. 11 - Prob. 43SECh. 11 - Prob. 44SECh. 11 - Prob. 45SECh. 11 - Show that a directed graphG= (V,E) has an...Ch. 11 - In this exercise we will develop an algorithm to...Ch. 11 - Prob. 1CPCh. 11 - Prob. 2CPCh. 11 - Prob. 3CPCh. 11 - Prob. 4CPCh. 11 - Prob. 5CPCh. 11 - Prob. 6CPCh. 11 - Prob. 7CPCh. 11 - Given an arithmetic expression in prefix form,...Ch. 11 - Prob. 9CPCh. 11 - Given the frequency of symbols, use Huffman coding...Ch. 11 - Given an initial position in the game of nim,...Ch. 11 - Prob. 12CPCh. 11 - Prob. 13CPCh. 11 - Prob. 14CPCh. 11 - Prob. 15CPCh. 11 - Prob. 16CPCh. 11 - Prob. 17CPCh. 11 - Prob. 18CPCh. 11 - Prob. 1CAECh. 11 - Prob. 2CAECh. 11 - Prob. 3CAECh. 11 - Prob. 4CAECh. 11 - Prob. 5CAECh. 11 - Prob. 6CAECh. 11 - Prob. 7CAECh. 11 - Prob. 8CAECh. 11 - Prob. 1WPCh. 11 - Prob. 2WPCh. 11 - Prob. 3WPCh. 11 - DefineAVL-trees(sometimes also known...Ch. 11 - Prob. 5WPCh. 11 - Prob. 6WPCh. 11 - Prob. 7WPCh. 11 - Prob. 8WPCh. 11 - Prob. 9WPCh. 11 - Prob. 10WPCh. 11 - Discuss the algorithms used in IP multicasting to...Ch. 11 - Prob. 12WPCh. 11 - Describe an algorithm based on depth-first search...Ch. 11 - Prob. 14WPCh. 11 - Prob. 15WPCh. 11 - Prob. 16WPCh. 11 - Prob. 17WPCh. 11 - Prob. 18WP
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
- Let x be a random variable that represents the percentage of successful free throws a professional basketball player makes in a season. Let y be a random variable that represents the percentage of successful field goals a professional basketball player makes in a season. A random sample of n = 6 professional basketball players gave the following information. x 82 69 73 84 74 64 y 42 48 46 46 46 42 Verify that ∑x =446, ∑y =270, ∑x2 =33,442, ∑y2 =12,180, ∑xy =20,070, and r = 0, and find the critical value for a test using a 5% level of significance claiming that ρis not equal than zero. Round your answer to three decimal places.arrow_forwardLet x be a random variable that represents the percentage of successful free throws a professional basketball player makes in a season. Let y be a random variable that represents the percentage of successful field goals a professional basketball player makes in a season. A random sample of n = 6 professional basketball players gave the following information. x 75 72 75 81 74 81 y 46 39 42 47 49 50 Verify that Se ࣈ 3.591,a ࣈ –10.145, bࣈ0.729, and , and find the predicted percentage of successful field goals for a player with x= 88%successful free throws. Round your answer to the nearest tenth of a percentarrow_forwardAn editor wants to analyze if there is a significant difference in the ratings of books in four different genres. Random samples of book ratings were collected for four different genres. The editor recorded ratings in a 0 to 10 scale in the following table. Fiction Novel Biography Science&Technology 8.5 8.4 6.2 9.1 5.3 5.3 5.5 4.3 7.7 4.2 7.0 9.7 5.1 9.8 9.3 5.2 6.9 8.6 6.7 7.9 4.8 7.1 6.9 8.4 Shall we reject or not reject the claim that there are no differences among the population means of book ratings for the different genres? Use.arrow_forward
- The same final exam of the astronomy course was given to two groups of students. The maximum number of points that a student can score is 100. The first group consisted of a random sample of 10 students who were taught by Professor A. Students from the first group obtained the following results: 87 88 91 88 86 92 81 93 73 99 The second group consisted of a random sample of 9 students who were taught by Professor B. Students from the second group obtained the following results: 74 74 79 97 67 88 86 83 78 Compute the mean squares of between-group variability, MSBET. Round your answer to two decimal places.arrow_forwardQ3 3 Points 1 0 2 4 0 6 01 5 - -1 0 10 00 0 0 1 1 The reduced row echelon form of the augmented matrix of a linear system is given above. Describe the solution set of this linear system in parametric vector form. Please select file(s) Select file(s) Save Answerarrow_forward3. Suppose you have 12 professors in a department and you have to chose members of departmental committees. (a) How many ways can you pick members for one 4 people committee? (b) How many ways can you pick members for two different 4 people committees if no-one can serve on both committees? (c) How many ways can you pick members for two different 4 people committees if people can serve on both committees? (d) How about if you need members for a 4 person, a 5 person, and a 3 person committee, people cannot serve on more than one committee? (e) How about if you need members for a 4 person, a 5 person, and a 3 person committee, people can serve on more than one committee? (f) How about if you need members for a 4 person, a 5 person, and a 3 person committee, people cannot serve on more than one committee, and the first person chosen for each committee serves as chair?arrow_forward
- Peggy conducted a study to identify the randomness of rainy days in fall. For 15 days, she recorded whether it rained that day or not. They denoted a rainy day with the letter R, a day without rain with the letter N. R N N R R N N R R N N R R R R Test the sequence for randomness. Use .arrow_forwardConsider the grades for the math and history exams for 10 students on a scale from 0 to 12 in the following table. Student Math History 1 4 8 2 5 9 3 7 9 4 12 10 5 10 8 6 8 5 7 9 6 8 9 6 9 11 9 10 7 10 Compute the Spearman correlation coefficient. Round your answer to three decimal places.arrow_forwardQ4 3 Points 1 Let A = 2 3 7 5 11 Give one nontrivial solution X of the homogeneous system Ax = 0. (Your vector x should have explicit numbers as its entries, as opposed to variables/parameters). Show your work for how you found it. Please select file(s) Select file(s) Save Answerarrow_forward
- To compare two elementary schools regarding teaching of reading skills, 12 sets of identical twins were used. In each case, one child was selected at random and sent to school A, and his or her twin was sent to school B. Near the end of fifth grade, an achievement test was given to each child. The results follow: Twin Pair 1 2 3 4 5 6 School A 169 157 115 99 119 113 School B 123 157 112 99 121 122 Twin Pair 7 8 9 10 11 12 School A 120 121 124 145 138 117 School B 153 90 124 140 142 102 Suppose a sign test for matched pairs with a 1% level of significance is used to test the hypothesis that the schools have the same effectiveness in teaching reading skills against the alternate hypothesis that the schools have different levels of effectiveness in teaching reading skills. Let p denote portion of positive signs when the scores of school B are subtracted from the corresponding scores of school…arrow_forwardA horse trainer teaches horses to jump by using two methods of instruction. Horses being taught by method A have a lead horse that accompanies each jump. Horses being taught by method B have no lead horse. The table shows the number of training sessions required before each horse performed the jumps properly. Method A 25 23 39 29 37 20 Method B 41 21 46 42 24 44 Method A 45 35 27 31 34 49 Method B 26 43 47 32 40 Use a rank-sum test with a5% level of significance to test the claim that there is no difference between the training sessions distributions. If the value of the sample test statistic R, the rank-sum, is 150, calculate the P-value. Round your answer to four decimal places.arrow_forwardA data processing company has a training program for new salespeople. After completing the training program, each trainee is ranked by his or her instructor. After a year of sales, the same class of trainees is again ranked by a company supervisor according to net value of the contracts they have acquired for the company. The results for a random sample of 11 salespeople trained in the last year follow, where x is rank in training class and y is rank in sales after 1 year. Lower ranks mean higher standing in class and higher net sales. Person 1 2 3 4 5 6 x rank 8 11 2 4 5 3 y rank 7 10 1 3 2 4 Person 7 8 9 10 11 x rank 7 9 10 1 6 y rank 8 11 9 6 5 Using a 1% level of significance, test the claim that the relation between x and y is monotone (either increasing or decreasing). Verify that the Spearman rank correlation coefficient . This implies that the P-value lies between 0.002 and 0.01. State…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
Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,
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
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
The Fundamental Counting Principle; Author: AlRichards314;https://www.youtube.com/watch?v=549eLWIu0Xk;License: Standard YouTube License, CC-BY
The Counting Principle; Author: Mathispower4u;https://www.youtube.com/watch?v=qJ7AYDmHVRE;License: Standard YouTube License, CC-BY