Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

In the proof of Lemma 1 we mentioned that many incorrect methods for finding a vertex such that the line segment is an interior diagonal of have been published. This exercise presents some of the incorrect ways has been chosen in these proofs. Show, by considering one of the polygons drawn here, that for each of these choices of , the line segment is not necessarily an interior diagonal of .

a) p is the vertex of P such that the angleabpis smallest.

b) p is the vertex of P with the least -coordinate (other than ).

c) p is the vertex of P that is closest to .

Short Answer

Expert verified

(a) The line segmentbp is not necessarily an interior diagonal ofP as it lies outside of the polygon.

(b) The line segmentbp is not necessarily an interior diagonal ofP as it lies outside of the polygon.

(c) The line segmentbp is not necessarily an interior diagonal ofP as it lies outside of the polygon.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Identification of given data

The given data can be listed below as:

  • The name of the line segment is .
  • The name of the vertex is p.
  • The name of the polygon is P .
02

Significance of the polygon 

A polygon is described as a plane figure which consist of three angles and straight sides. Moreover, a polygon can also contain more than five sides also.

03

(a) Determination of the first choice of p

The diagram of the polygon P has been drawn below:

Here, the point P is described as the vertex of the polygon P where is the smallest angle. Taking an example, in the above diagram, all the angles such as abq,abr,absandabc are greater than the angle abp. Moreover , which is the line segment, is not considered as the polygon’s interior diagonal, as the line segment’s part lies outside the polygon.

Thus, the line segmentbp is not necessarily an interior diagonal of P as it lies outside of the polygon.

04

(b) Determination of the second choice of p

The diagram of the polygonp has been drawn below:

Here, the point p is described as the vertex of the polygonp that consists of the smallest coordinate of x, which is other than the pointb . Thex coordinate is the left-most point of the polygon. Taking an example, in the above diagram, the left most point is other than the point b. Moreover bd, which is the line segment, is not considered as the polygon’s interior diagonal, as the line segment’s part lies outside the polygon.

Thus, the line segmentbp is not necessarily an interior diagonal ofp as it lies outside of the polygon.

05

(c) Determination of the third choice of p

The diagram of the polygon has been drawn below:

Here, the pointp is described as the vertex of the polygon that is closest to the point b. Taking an example, in the above diagram, the left most point is other than the point b and both the points are close to each other. Moreover bd, which is the line segment, is not considered as the polygon’s interior diagonal, as the line segment’s part lies outside the polygon.

Thus, the line segment bp is not necessarily an interior diagonal p of as it lies outside of the polygon.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Prove that 11!+22!++nn!=(n+1)!1 whenever nis a positive integer

The well-ordering property can be used to show that there is a unique greatest common divisor of two positive integers. Let a and be positive integers, and let S be the set of positive integers of the form as+bt, where s and t are integers.

a) Show that s is nonempty.

b) Use the well-ordering property to show that s has a smallest element .

c) Show that if d is a common divisor of a and b, then d is a divisor of c.

d) Show that c I a and c I b. [Hint: First, assume that cXa. Then a=qc+r, where 0<r<c. Show that rS, contradicting the choice of c.]

e) Conclude from (c) and (d) that the greatest common divisor of a and b exists. Finish the proof by showing that this greatest common divisor is unique.

LetE(n) be the statement that in a triangulation of a simple polygon with sides, at least one of the triangles in the triangulation has two sides bordering the exterior of the polygon.

a) Explain where a proof using strong induction thatE(n) is true for all integersn4 runs into difficulties.

b) Show that we can prove thatE(n) is true for all integersn4 by proving by strong induction the stronger statementT(n) for all integers n4, which states that in every triangulation of a simple polygon, at least two of the triangles in the triangulation have two sides bordering the exterior of the polygon.

Use strong induction to show that all dominoes fall in an infinite arrangement of dominoes if you know that the first three dominoes fall, and that when a domino falls, the domino three farther down in the arrangement also falls.

Describe a recursive algorithm for multiplying two nonnegative integers x and y based on the fact that xy = 2 (x . (y / 2)) when y is even and xy = 2 (x . [y / 2]) + x when y is odd, together with the initial condition xy = 0 when y = 0 .

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free