The Heart of Mathematics: An Invitation to Effective Thinking
4th Edition
ISBN: 9781118156599
Author: Edward B. Burger, Michael Starbird
Publisher: Wiley, John & Sons, Incorporated
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 5.3, Problem 27MS
Unknotting pictures (S). Suppose you are given a picture of a complicated knot. Show that you can always change that knot to the unknot if you are allowed to switch as many crossings as you wish. How would you proceed systematically?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Route Planning. A city engineer needs to inspect the traffic signs at each streetintersection of a neighborhood. The engineer has drawn a graph to represent theneighborhood, where the edges represent the streets and the vertices correspond tostreet intersections. Would the most efficient route to drive correspond to an Eulercircuit, a Hamiltonian circuit, or neither? (The engineer must return to the starting
location when finished.) Explain your answer.
Discrete math problemConstruct a directed network whose vertices represent the numbers:11,12,13,15,17and whose weights tell how much you must add to get from one vertex to another. Include only edges of positive weight.
In a park, Camila is creating two designs for a fenced-in region so that dogs have a safe place to play. Camila designs each region using a coordinate grid where each unit on the grid represents one foot.
Part A
Camila’s first design is triangular-shaped. On the coordinate grid, she identifies two of the vertices to be (0, 0) and (0, 35). The third vertex is labeled as (x, 42). What is the positive x-coordinate of the third vertex if the area of the region will cover 700 square feet?
Part B
Camila’s second design is a six-sided region using the coordinates (0, 0), (0, 35), (30, 0), (40, 48), (35, 48), and (5, 35). How many feet of fencing material will Camila need for this region (rounded to the nearest whole number) ?
Chapter 5 Solutions
The Heart of Mathematics: An Invitation to Effective Thinking
Ch. 5.1 - Describing distortion. What does it mean to say...Ch. 5.1 - Your last sheet. Youre in your bathroom reading...Ch. 5.1 - Rubber polygons. Find a large rubber band and...Ch. 5.1 - Out, out red spot. Remove the red spot from the...Ch. 5.1 - That theta (S). Does there exist a pair of points...Ch. 5.1 - Your ABCs (H). Consider the following letters made...Ch. 5.1 - Half dollar and a straw. Suppose we drill a hole...Ch. 5.1 - Drop them. Is it possible to take off your...Ch. 5.1 - Coffee and doughnuts (H). Is a standard coffee mug...Ch. 5.1 - Lasting ties. Tie a thin rope around a friends...
Ch. 5.1 - Will you spill? (S). Suppose you rest a glass of...Ch. 5.1 - Grabbing the brass ring. Suppose a string attached...Ch. 5.1 - Hair care. Is a regular comb equivalent by...Ch. 5.1 - Three two-folds. Take three pieces of paper and...Ch. 5.1 - Equivalent objects. Group the objects in this...Ch. 5.1 - Clips. Is a paper clip equivalent to a circle? If...Ch. 5.1 - Pennies plus. Consider the two objects pictured...Ch. 5.1 - Starry-eyed. Consider the two stars below. Are...Ch. 5.1 - Learning the ropes. Pictured below are two ropes,...Ch. 5.1 - HoIy spheres. Consider the two spheres shown. Each...Ch. 5.1 - From sphere to torus. The following sequence of...Ch. 5.1 - Half full, half empty. One glass is half filled...Ch. 5.1 - Male versus female. Consider the male and female...Ch. 5.1 - Holey tori. Are these two objects equivalent by...Ch. 5.1 - More holey tori (H). Are these two objects...Ch. 5.1 - Last holey tori. Are these two objects equivalent...Ch. 5.1 - Beyond the holey inner tube. Suppose you are given...Ch. 5.1 - Heavy metal. Carefully examine this picture of a...Ch. 5.1 - The disk and the inner tube (ExH). Suppose you...Ch. 5.1 - Building a torus (S). Suppose you are given a...Ch. 5.1 - Lasso that hole. Consider the first two tori on...Ch. 5.1 - Knots in dougtnuts. We are given two solid...Ch. 5.1 - From knots to glasses (ExH). Take the thickened...Ch. 5.1 - More Jell-O. Suppose we take a cube of Jell-O,...Ch. 5.1 - Fixed spheres (H). We are given two spheres made...Ch. 5.1 - Holes. Is a torus equivalent to a two-holed torus?...Ch. 5.1 - More holes. Is a two-holed torus equivalent to a...Ch. 5.1 - Here we celebrate the power of algebra as a...Ch. 5.1 - Here we celebrate the power of algebra as a...Ch. 5.1 - Here we celebrate the power of algebra as a...Ch. 5.1 - Here we celebrate the power of algebra as a...Ch. 5.1 - Here we celebrate the power of algebra as a...Ch. 5.2 - One side to every story. What is a Mobius band?Ch. 5.2 - Maybe Mobius. How can you look at a loop of paper...Ch. 5.2 - Singin the blues. Take an ordinary strip of white...Ch. 5.2 - Whos blue now? Take an ordinary strip of white...Ch. 5.2 - Twisted sister. Your sister holds a strip of...Ch. 5.2 - Two twists. Take a strip of paper, put two half...Ch. 5.2 - Two twists again. Take a strip of paper, put two...Ch. 5.2 - Three twists (H). Take a strip of paper, put three...Ch. 5.2 - Prob. 11MSCh. 5.2 - Möbius lengths. Use the edge identification...Ch. 5.2 - Squash and cut. Take a Möbius band and squash it...Ch. 5.2 - Two at once. Take two strips of paper and put them...Ch. 5.2 - Parallel Möbius. Is it possible to have two...Ch. 5.2 - Puzzling. Suppose you have a collection of jigsaw...Ch. 5.2 - Möbius triangle. Make a 1-inch-wide Möbius band,...Ch. 5.2 - Thickened Möbius. Imagine a Möbius band...Ch. 5.2 - Thickened faces. How many faces (sides) does a...Ch. 5.2 - Thick then thin. Suppose we take a Môbius band,...Ch. 5.2 - Drawing the band (ExH). Imagine you have a Möbius...Ch. 5.2 - Tubing (H). Suppose we take two Möbius bands and...Ch. 5.2 - Bug out (ExH). Suppose you are a ladybug on the...Ch. 5.2 - Open cider. Consider the Klein bottle half filled...Ch. 5.2 - Rubber Klein (S). Suppose you have a rectangular...Ch. 5.2 - One edge. Using the method on page 347 for...Ch. 5.2 - Twist of fate (S). Using the edge-identification...Ch. 5.2 - Linked together. Using the edge-identification...Ch. 5.2 - Count twists. Using the edge-identification...Ch. 5.2 - Dont cross. Can you draw a curve that does not...Ch. 5.2 - Twisted up (H). Suppose you are given a band of...Ch. 5.2 - Prob. 32MSCh. 5.2 - Find a band. Find a Möbius band on the surface of...Ch. 5.2 - Holy Klein. Show that the figure on the left is...Ch. 5.2 - Möbius Möbius. Show that the Klein bottle is two...Ch. 5.2 - Attaching tubes. Consider a Möbius band with two...Ch. 5.2 - Möbius map (H). Using felt-tip color pens that...Ch. 5.2 - Thick slices. Thicken a Môbius band and then...Ch. 5.2 - Bagel slices. If we take a bagel and slice it in...Ch. 5.2 - Gluing and cutting. Consider a rectangular sheet...Ch. 5.2 - Here we celebrate the power of algebra as a...Ch. 5.2 - Here we celebrate the power of algebra as a...Ch. 5.2 - Here we celebrate the power of algebra as a...Ch. 5.2 - Here we celebrate the power of algebra as a...Ch. 5.2 - Here we celebrate the power of algebra as a...Ch. 5.3 - Knotty start. Which of the followign knots are...Ch. 5.3 - The not knot. What is the unknot?Ch. 5.3 - Crossing count. Count the crossings in each knot...Ch. 5.3 - Tangled up. Is the figure below a knot or a link?Ch. 5.3 - Ringing endorsement. What are the Borromean rings?Ch. 5.3 - Human trefoil. What is the minimum number of...Ch. 5.3 - Human figure eight. What is the minimum number of...Ch. 5.3 - Stick number (ExH). What is the smallest number...Ch. 5.3 - More Möbius. Make a Möbius band with three half...Ch. 5.3 - Slinky (H). Take a Slinky, lengthen one of its...Ch. 5.3 - More slink. Take a Slinky, and this time weave an...Ch. 5.3 - Make it. Use a piece of string or an extenstion...Ch. 5.3 - Knotted (S). Take an unknotted loop. Tie a knot in...Ch. 5.3 - Slip. Take an unknotted loop and put a slip knot...Ch. 5.3 - Dollar link. Take two paper clips and a dollar and...Ch. 5.3 - Prob. 18MSCh. 5.3 - Unknotting knots (H). In each of the two knots at...Ch. 5.3 - Alternating. A picture of a knot is alternating...Ch. 5.3 - Making it alternating. Consider the knot on the...Ch. 5.3 - Prob. 22MSCh. 5.3 - One cross (H). Prove that any loop with exactly...Ch. 5.3 - Two loops (S). Is there a picture of two linked...Ch. 5.3 - Hold the phone. Disconnect the wire from the phone...Ch. 5.3 - More unknotting knots. In these two knots, find...Ch. 5.3 - Unknotting pictures (S). Suppose you are given a...Ch. 5.3 - Twisted. Suppose we are given a figure consisting...Ch. 5.3 - More alternating. First reread Mindscape 20. For...Ch. 5.3 - Crossing numbers. Suppose you are given pictures...Ch. 5.3 - Lots of crossings. Suppose you arc given a picture...Ch. 5.3 - Torus knots (H). Can you draw a trefoil knot on a...Ch. 5.3 - Two crosses. Prove that any loop with exactly two...Ch. 5.3 - Hoop it up. Show that every knot can be positioned...Ch. 5.3 - The switcheroo. Pictured below is a way of...Ch. 5.3 - 4D washout. Why is the study of knots and links...Ch. 5.3 - Brunnian links (H). Link four loops together in...Ch. 5.3 - Fire drill (ExH). A fire starts in your...Ch. 5.3 - Fixed spheres again. We are given two spheres that...Ch. 5.3 - Here we celebrate the power of algebra as a...Ch. 5.3 - Here we celebrate the power of algebra as a...Ch. 5.3 - Here we celebrate the power of algebra as a...Ch. 5.3 - Here we celebrate the power of algebra as a...Ch. 5.3 - Here we celebrate the power of algebra as a...Ch. 5.4 - Fixed things first. What does the Brouwer Fixed...Ch. 5.4 - Say cheese. Youre making an open-faced cheese...Ch. 5.4 - Fixed flapjacks. Youre making pancakes and...Ch. 5.4 - Prob. 4MSCh. 5.4 - Loop around. What does the Hot Loop Theorem...Ch. 5.4 - Fixed on a square. Does the Brouwer Fixed Point...Ch. 5.4 - Fixed on a circle. Does the Brouwer Fixed Point...Ch. 5.4 - Winding arrows. In each drawing below we have a...Ch. 5.4 - Prob. 10MSCh. 5.4 - Prob. 11MSCh. 5.4 - Home heating (H). Prove that there are two points...Ch. 5.4 - Prob. 13MSCh. 5.4 - Prob. 14MSCh. 5.4 - Prob. 15MSCh. 5.4 - Lining up (H). Suppose we have two line segments...Ch. 5.4 - A nice temp. Must there be two antipodal points on...Ch. 5.4 - Prob. 18MSCh. 5.4 - Diet drill. Suppose someone weighs 160 lbs. and...Ch. 5.4 - Speedy (S). You enter a tollway and are given a...Ch. 5.4 - The cut core. Suppose we have the red and blue...Ch. 5.4 - Fixed without boundary. Do you think that the...Ch. 5.4 - Take a hike (ExH). A hiker decides to climb up...Ch. 5.4 - Here we celebrate the power of algebra as a...Ch. 5.4 - Here we celebrate the power of algebra as a...Ch. 5.4 - Here we celebrate the power of algebra as a...Ch. 5.4 - Here we celebrate the power of algebra as a...Ch. 5.4 - Here we celebrate the power of algebra as a...
Additional Math Textbook Solutions
Find more solutions based on key concepts
When converting resistances connected in a formation to a ∆ formation as shown in Fig. P2.21. the resistance ...
Introductory Mathematics for Engineering Applications
The total number of hours, measured in units of 100 hours, that a family runs a vacuum cleaner over a period of...
Probability and Statistics for Engineers and Scientists
In Exercises 7-14, determine the range and standard deviation of the set of data. When appropriate, round stand...
A Survey of Mathematics with Applications (10th Edition) - Standalone book
In each of Problems 22 through 27, verify that the given functions y1 and y2 satisfy the corresponding homogene...
Differential Equations: An Introduction to Modern Methods and Applications
CHECK POINT I You deposit $3000 in s savings account at Yourtown Bank, which has rate of 5%. Find the interest ...
Thinking Mathematically (6th Edition)
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
- Touching all edges in a graph without repeating or picking up your pencil and starting and stopping at same spot. A.) Euler Trail B.) Euler Tour C.) Hamilton Cycle D.) Hamilton Patharrow_forward4. ***Picture*** Find any Hamiltonian circuit on the graph above. Give your answer as a list of vertices, starting and ending at the same vertex. Example: ABCA =___________arrow_forwardUsing Euler’s formula on vertices, regions and edges, confirm the number of edges in the attached graph. Can you label them?arrow_forward
- Touching all vertices in a graph without repeating or picking up your pencil and starting and stopping at different spot. B) Euler Tour C) Hamilton Cycle A) Euler Trail D) Hamilton Patharrow_forwardOther Math A simple graph G has 10 vertices and 38 edges. (b) Prove that G must have a Hamilton circuit. (Hint: You will need Ore’s Theorem.)arrow_forwardTrapezoid EFGH has vertices E(-5, -6), F(-2, 2), G(1, 2), and H(4, -6). Which vertex is in Quandrant III? A. Vertex E B. Vertex F C. Vertex G D. Vertex Harrow_forward
- Consider the uncapacitated network flow problem shown in the following image. The label next to each arc is its cost. Solve this problem using the network simplex problem. Start with the tree indicated by the dashed arcs in the figure.arrow_forwarda) Can you conjecture a new formula for V −E+ F for graphs with exactly two pieces? Try various examplesfirst and show at least 3 example graphs.b) Can you conjecture a new formula for V − E+ F for graphs with exactly three pieces? Try variousexamples first and show at least 3 example graphs.c) Can you conjecture a new formula for V − E + F for graphs with exactly n pieces? Search for a patternarrow_forward(a.) the number of edges in the graph (b.) give the number of vertices in the graph (c.) determine the number of vertices that are of odd degree (d.) determine whether the graph is connected.arrow_forward
- A floor plan of a museum is shown. Draw a graph that represents the floor plan, where each vertex represents a room and an edge connects two vertices if there is a doorway between the two rooms. Is it possible to walk through the museum and pass through each doorway without going through any doorway twice? Does it depend on whether you return to the room you started at? Justify your conclusion.arrow_forwardThe class is discrete mathematics. I am stuck on a question that wants me to "prove that for any graph G, either G is connected or G compliment is connected". I understand that "connected" means a walk from any one point on a graph to another, and I think the direction I should go is either prove a theorem about the set of edges or break it into cases.arrow_forwardDiscrete Maths Oscar Levin 3rd eddition 4.1.15: Prove that any graph with at least two vertices must have two vertices of the same degree. ps: I'd be so glad if you include every detail of the solution.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Graph Theory: Euler Paths and Euler Circuits; Author: Mathispower4u;https://www.youtube.com/watch?v=5M-m62qTR-s;License: Standard YouTube License, CC-BY
WALK,TRIAL,CIRCUIT,PATH,CYCLE IN GRAPH THEORY; Author: DIVVELA SRINIVASA RAO;https://www.youtube.com/watch?v=iYVltZtnAik;License: Standard YouTube License, CC-BY