query: How prove: for every convex polygon there exist three consecutive vertices which their circumcircle include all polygon?
positive_passages.docid: 142142
positive_passages.text: Show that a convex polygon is contained within the largest circle determined by three consecutive vertices
negative_passages.docid: 59644
negative_passages.text: Proof of Cartesian product intersection
negative_passages.docid: 4061
negative_passages.text: Proving there are infinitely many pairs of square-full consecutive integers
negative_passages.docid: 109767
negative_passages.text: Prove that three points are enough to draw/define one and only one circle
negative_passages.docid: 17786
negative_passages.text: Existence of Consecutive Quadratic residues
negative_passages.docid: 124425
negative_passages.text: A geometry question: Let $ABCD$ be a convex quadrilateral. Prove that AD is parallel to BC.
negative_passages.docid: 63240
negative_passages.text: Every two consecutive integers are coprime.
negative_passages.docid: 126060
negative_passages.text: Proving that a Euler Circuit has a even degree for every vertex
negative_passages.docid: 155926
negative_passages.text: Prove there are k consecutive non-squarefree integers
negative_passages.docid: 59831
negative_passages.text: How to relate combinatorial proof to bipartite graphs?
negative_passages.docid: 4240
negative_passages.text: The proof of Triple Vector Products
negative_passages.docid: 71990
negative_passages.text: Prove there always exists a partition such that vertices in each part have even degree
negative_passages.docid: 154564
negative_passages.text: Prove that the sum of minimum edge cover and maximum matching is the vertex count
negative_passages.docid: 64052
negative_passages.text: Among any three consecutive positive integers one is a multiple of 3
negative_passages.docid: 148147
negative_passages.text: Three circles having centres on the three sides of a triangle
negative_passages.docid: 83449
negative_passages.text: Proof with 3D vectors
negative_passages.docid: 99781
negative_passages.text: Proof that any simple connected graph has at least 2 non-cut vertices.