
Discrete Mathematics with Graph Theory
3rd Edition
ISBN: 9780131679955
Author: Edgar G. Goodaire
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Question
Chapter 6.3, Problem 19E
To determine
To prove: At least two flowers are not more than 30 cm apart.
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 6 Solutions
Discrete Mathematics with Graph Theory
Ch. 6.1 - Prob. 1TFQCh. 6.1 - Prob. 2TFQCh. 6.1 - Prob. 3TFQCh. 6.1 - Prob. 4TFQCh. 6.1 - Prob. 5TFQCh. 6.1 - Prob. 6TFQCh. 6.1 - Prob. 7TFQCh. 6.1 - Prob. 8TFQCh. 6.1 - True/False Questions
9. When three sets are...Ch. 6.1 - Prob. 10TFQ
Ch. 6.1 -
In a group of 15 pizza experts, ten like...Ch. 6.1 - Prob. 2ECh. 6.1 - Among the 30 students registered for a course in...Ch. 6.1 - Prob. 4ECh. 6.1 - The owner of a corner store stocks popsicles, gum,...Ch. 6.1 - 6. (a) In a group of 82 students, 59 are taking...Ch. 6.1 - Prob. 7ECh. 6.1 - Prob. 8ECh. 6.1 - The owner of a convenience store reports that of...Ch. 6.1 - Prob. 10ECh. 6.1 - Prob. 11ECh. 6.1 - Prob. 12ECh. 6.1 - Prob. 13ECh. 6.1 - Prob. 14ECh. 6.1 - Find the number of integers between 1 and 10,000...Ch. 6.1 - 16. How many integers between 1 and (inclusive)...Ch. 6.1 - Prob. 17ECh. 6.1 - Prob. 18ECh. 6.1 - Prob. 19ECh. 6.1 - Prob. 20ECh. 6.1 - Prob. 21ECh. 6.1 - Prob. 22ECh. 6.1 - Prove the Principle of Inclusion-Exclusion by...Ch. 6.2 - Prob. 1TFQCh. 6.2 - Prob. 2TFQCh. 6.2 - Prob. 3TFQCh. 6.2 - Prob. 4TFQCh. 6.2 - Prob. 5TFQCh. 6.2 - Prob. 6TFQCh. 6.2 - Prob. 7TFQCh. 6.2 - Prob. 8TFQCh. 6.2 - Prob. 9TFQCh. 6.2 - Prob. 10TFQCh. 6.2 - Prob. 1ECh. 6.2 - Prob. 2ECh. 6.2 - 3. In how many of the three-digit numbers 000-999...Ch. 6.2 - How many numbers in the range 100-999 have no...Ch. 6.2 - Prob. 5ECh. 6.2 - 6. In Mark Salas, the 1991 Detroit Tigers had...Ch. 6.2 - Prob. 7ECh. 6.2 - Prob. 8ECh. 6.2 - Prob. 9ECh. 6.2 - How many possible telephone numbers consist of...Ch. 6.2 - Prob. 11ECh. 6.2 - 12. In how many ways can two adjacent squares be...Ch. 6.2 - Prob. 13ECh. 6.2 - Prob. 14ECh. 6.2 - How many three-digit numbers contain the digits 2...Ch. 6.2 -
16. You are dealt four cards from a standard deck...Ch. 6.2 - Prob. 17ECh. 6.2 - Prob. 18ECh. 6.2 - In how many ways can two dice land? In how many...Ch. 6.2 - Prob. 20ECh. 6.2 - How many five-digit numbers can be formed using...Ch. 6.2 - Prob. 22ECh. 6.2 - The complete menu from a local gourmet restaurant...Ch. 6.2 - Prob. 24ECh. 6.2 - Prob. 25ECh. 6.2 - Prob. 26ECh. 6.3 - True/False Questions If A and B are finite...Ch. 6.3 - Prob. 2TFQCh. 6.3 - True/False Questions
3. In a group of 15 people,...Ch. 6.3 - Prob. 4TFQCh. 6.3 - True/False Questions If two integers lie in the...Ch. 6.3 - Prob. 6TFQCh. 6.3 - Prob. 7TFQCh. 6.3 - Prob. 8TFQCh. 6.3 - Prob. 9TFQCh. 6.3 - Prob. 10TFQCh. 6.3 - Prob. 1ECh. 6.3 - Write down any six natural numbers. Verify that...Ch. 6.3 - Prob. 3ECh. 6.3 - Prob. 4ECh. 6.3 - Prob. 5ECh. 6.3 - Prob. 6ECh. 6.3 - 7. (a) If 20 processors are interconnected and...Ch. 6.3 - Prob. 8ECh. 6.3 - Prob. 9ECh. 6.3 - Prob. 10ECh. 6.3 - 11. Brad has five weeks to prepare for his...Ch. 6.3 - Linda has six weeks to prepare for an examination...Ch. 6.3 - Prob. 13ECh. 6.3 - Prob. 14ECh. 6.3 - Prob. 15ECh. 6.3 - Prob. 16ECh. 6.3 - Prob. 17ECh. 6.3 - Prob. 18ECh. 6.3 - Prob. 19ECh. 6.3 - Let S={2,3,5,7,11,13,17,19} be the set of prime...Ch. 6.3 - Given any positive integer n, show that some...Ch. 6.3 - 22. Show that some multiple of 2002 consists of a...Ch. 6.3 - Prob. 23ECh. 6.3 - Prob. 24ECh. 6.3 - In a room where there are more than 50 people with...Ch. 6.3 - 26. (a) Let A be a set of seven (distinct) natural...Ch. 6.3 - Prob. 27ECh. 6.3 - 28. Suppose are 10 integers between 1 and 100...Ch. 6.3 - Prob. 29ECh. 6.3 - 30. Given any 52 integers, show that there exist...Ch. 6 - Suppose A and B are nonempty finite sets and ....Ch. 6 - Using the Principle of Inclusion-Exclusion, find...Ch. 6 - John Sununu was once the governor of New...Ch. 6 - 4. Two Math 2320 students are arguing about the...Ch. 6 - Prob. 5RECh. 6 -
6. Seventy cars sit on a parking lot. Thirty have...Ch. 6 - State the strong form of the Pigeonhole Principle.Ch. 6 - 8. Show that among 18 arbitrarily chosen integers...Ch. 6 - Use the Pigeonhole Principle and the definition of...Ch. 6 - Show that, of any ten points chosen within an...Ch. 6 - Five hermits live on a rectangular island 6...Ch. 6 - 12. (a) Suppose the positive integer is written...
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
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,Elementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher: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 MCDOUGALGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill

Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,

Elementary Geometry For College Students, 7e
Geometry
ISBN:9781337614085
Author:Alexander, Daniel C.; Koeberlein, Geralyn M.
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


Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Quadrilaterals: Missing Angles and Sides; Author: rhornfeck;https://www.youtube.com/watch?v=knVj1O0L2TM;License: Standard YouTube License, CC-BY
STD IX | State Board | Types of Quadrilateral; Author: Robomate;https://www.youtube.com/watch?v=wh0KQ4UB0EU;License: Standard YouTube License, CC-BY