Create a nest of 5 sets whose largest set in the set of all polygons. For each set but the largest set in the nest, write a deffinition that precisly describs the objects in that set in terms of the objects in the next larger level. my solution to this qesttion is: all polygons Quadrilalateral tarpezoid Isosceles Traingle Rectangle But i'm not sure about that. Also, i need their deffinitions?

joyoshibb 2022-08-03 Answered
Create a nest of 5 sets whose largest set in the set of all polygons. For each set but the largest set in the nest, write a deffinition that precisly describs the objects in that set in terms of the objects in the next larger level.
my solution to this qesttion is:
all polygons
Quadrilalateral
tarpezoid
Isosceles Traingle
Rectangle
But i'm not sure about that. Also, i need their deffinitions?
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

Addison Herman
Answered 2022-08-04 Author has 15 answers
all polygons
> quadrilaterals (all polygons with 4 sides)
> convex quadrilaterals (all quadrilaterals in which all internal angles are <180)
> trapezoid(all convex quadrilaterals with at least one pair of opposite sides parallel)
> quadrilateral parallelogram (all convex quadrilaterals with both pairs of opposite sides parallel)
> rectangle (all quadrilateral parallelograms with internal angles 90 degrees)
> square (all rectangles with adjacent sides equal)
etc

We have step-by-step solutions for your answer!

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-09-16
Least Squares Circumcenter of Polygons
It is well known that the circumcenter of a polygon exists if and only if the polygon is cyclic.
I would like to extend the definition of an circumcenter for noncyclic polygons. Namely, let us define the least squares circumcenter as the point A ( x 0 , y 0 ) such that the point A minimizes the sum of the squares of the residuals.
Let us consider the case for a noncyclic quadrilateral with vertices P ( x 1 , y 1 ), Q ( x 2 , y 2 ), R ( x 3 , y 3 ), and S ( x 4 , y 4 ). Let us also define the origin O(0,0).
How would we solve for the point A in this case? I was thinking of using matrices and solving A T A x ^ = A T b, although any methods are welcome.
asked 2022-07-21
How to use barycentric coordinates for polygons
Suppose we want to deal with the problems with a sided polygons then how can we proceed in barycentric coordinates,
That is how can we fame the coordinates of the hexagon in barycentric coordinates.
asked 2022-07-25
Find the lateral surface area of a regular hexagonal pyramid whose edge measures 20 cm and the radius of a circle inscribed in the base is 9 squareroot of 3 cm.
asked 2022-08-07
The area of a triangular sail for a boat is 176 square feel. If the base of the sail is 16 feet long, find its height.
asked 2022-07-18
Newton polygons
This question is primarily to clear up some confusion I have about Newton polygons.
Consider the polynomial x 4 + 5 x 2 + 25 Q 5 [ x ]. I have to decide if this polynomial is irreducible over Q 5
So, I compute its Newton polygon. On doing this I find that the vertices of the polygon are (0,2), (2,1) and (4,0). The segments joining (0,2) and (2,1), and (2,1) and (4,0) both have slope 1 2 , and both segments have length 2 when we take their projections onto the horizontal axis.
Am I correct in concluding that the polynomial x 4 + 5 x 2 + 25 factors into two quadratic polynomials over Q 5 , and so is not irreducible?
I am deducing this on the basis of the following definition of a pure polynomial given in Gouvea's P-adic Numbers, An Introduction (and the fact that irreducible polynomials are pure):
A polynomial is pure if its Newton polygon has one slope.
What I interpret this definition to mean is that a polynomial f ( x ) = a n x n + . . . + a 0 Q p [ x ] (with a n a 0 0) is pure, iff the only vertices on its Newton polygon are ( 0 , v p ( a 0 ) ) and ( n , v p ( a n ) ). Am I right about this, or does the polynomial x 4 + 5 x 2 + 25 also qualify as a pure polynomial?
asked 2022-08-05
The area of a triangular sail for a boat is 176 square feel. If the base of the sail is 16 feet long, find its height.
asked 2022-08-11
Scan line algorithm for intersecting polygons
Given two sets of polygons P 1 = { s 1 , . . . , s m } and P 2 = { s m + 1 , . . . , s n } with total number of n segments, the previous and next segment on it's polygon can be determined in O(1). Describe a scan-line algorithm that computes all points of P 1 P 2 in O(n).

New questions