Construction 11: Book I, Proposition 42

Similar documents
Polygons POLYGONS.

Designing A Concrete Arch Bridge

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

EE1000 Project 4 Digital Volt Meter

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Instructions for Section 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Planar Upward Drawings

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

Geometry of the Circle - Chords and Angles. Geometry of the Circle. Chord and Angles. Curriculum Ready ACMMG: 272.

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

IIT JEE MATHS MATRICES AND DETERMINANTS

Proving the Pythagorean Theorem

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

MCQ For Geometry. Similarity

TOPIC 5: INTEGRATION

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

COMP108 Algorithmic Foundations

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

1 Introduction to Modulo 7 Arithmetic

12. Traffic engineering

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Basic Angle Rules 5. A Short Hand Geometric Reasons. B Two Reasons. 1 Write in full the meaning of these short hand geometric reasons.

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Present state Next state Q + M N

Trigonometry and Constructive Geometry

QUESTIONS BEGIN HERE!

GEOMETRY OF THE CIRCLE TANGENTS & SECANTS

Outline. Binary Tree

LESSON 11: TRIANGLE FORMULAE

Aquauno Video 6 Plus Page 1

MATHEMATICS PAPER IB COORDINATE GEOMETRY(2D &3D) AND CALCULUS. Note: This question paper consists of three sections A,B and C.

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Garnir Polynomial and their Properties

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

Limits Indeterminate Forms and L Hospital s Rule

Binomials and Pascal s Triangle

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

2008 AP Calculus BC Multiple Choice Exam

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

GM1 Consolidation Worksheet

Section 1.3 Triangles

SOLVED EXAMPLES. Ex.1 If f(x) = , then. is equal to- Ex.5. f(x) equals - (A) 2 (B) 1/2 (C) 0 (D) 1 (A) 1 (B) 2. (D) Does not exist = [2(1 h)+1]= 3

Last time: introduced our first computational model the DFA.

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS

Linear Algebra Existence of the determinant. Expansion according to a row.

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

UNIT # 08 (PART - I)

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

MCH T 111 Handout Triangle Review Page 1 of 3

Pythagoras Theorem PYTHAGORAS THEOREM.

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Parallel Projection Theorem (Midpoint Connector Theorem):

MATHEMATICS FOR MANAGEMENT BBMP1103

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Fundamental Algorithms for System Modeling, Analysis, and Optimization

Comparing the Pre-image and Image of a Dilation

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

0.1. Exercise 1: the distances between four points in a graph

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION

( ) Differential Equations. Unit-7. Exact Differential Equations: M d x + N d y = 0. Verify the condition

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

VTU NOTES QUESTION PAPERS NEWS RESULTS FORUMS

Decimals DECIMALS.

5. Every rational number have either terminating or repeating (recurring) decimal representation.

Lecture 4. Conic section

Lecture 6: Coding theory

Algebra & Functions (Maths ) opposite side

UNCORRECTED PAGE PROOFS

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Want to go a-courtin but not allowed to dance? Well then, try this once popular party game as a way to get to know each other.

Chem 107: Inorganic Chemistry (40720)

Constructive Geometric Constraint Solving

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Transcription:

Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r.

74 Constrution # 11 Th Visul Construtions of Euli I.42:3. Lt BC th givn tringl, n D th givn rtilinl ngl; D B C I.42:8. Lt BC ist t E, ([I.10]) WNTED Rll. GOSUB I.10.4 B C

Th Visul Construtions of Euli Constrution #11 75 Lt th quiltrl tringl onstrut on it, [I.1] WNTED GOSUB I.1. I.1:7. With ntr n istn lt th irl sri; [Post. 3]

76 Constrution # 11 Th Visul Construtions of Euli I.1:10. gin, with ntr n istn lt th irl sri; [Post. 3] Not: In C#5 (I.10) thr r svrl inssntil stps t this point. Now w omit thm. RETURN to I.10 t lin 4. lt join.

Th Visul Construtions of Euli Constrution #11 77 I.10:8. Th stright lin hs n ist t th point. RETURN to I.42 t lin 9. Rll, lnup. I.42:9. n lt E join, [tully, this lin will not us.] D B E C

78 Constrution # 11 Th Visul Construtions of Euli I.42:10. on th stright lin EC, n t th point E on it, lt th ngl CEF onstrut qul to th ngl D; [I.23] D F WNTED GOSUB I.23 Rll. B E C I.23:8. On th stright lins, rsptivly lt th points, tkn t rnom;

Th Visul Construtions of Euli Constrution #11 79 I.23:10. lt join, I.23:11. (Prphrs) Mov th tringl so th s gos to th lin with th ngl t t th n,. ol s GOSUB I.22P. W follow th summry. Extn th lin.

80 Constrution # 11 Th Visul Construtions of Euli (Mov th rm.) Lot th point so tht is qul to. ([ivirs]) ol s (Mov th s.) Lot th point so tht is qul to. ([Divirs]) ol s

Th Visul Construtions of Euli Constrution #11 81 (Mov th ol rm.) Lot th point i so tht i is qul to. ([Divirs]) ol s i I.22:24. Swing th rm.

82 Constrution # 11 Th Visul Construtions of Euli I.22:26. Swing th ol rm. I.22:28. Join th point whr th two rms mt, f, to th ns of th (mov) s. RETURN to I.23 t lin 11. I.23:18. Th ngl is qul to th ngl f. RETURN to I.42 t lin 10. f

Th Visul Construtions of Euli Constrution #11 83 Extn th si, f. f Clnu. RETURN to I.42 t lin10. I.42:14. Through lt G rwn prlll to EC, [I.31] WNTED D F G GOSUB I.31. W will tk BC s th givn lin, so it is not nssry to rll. W tk th point D of I.31 s B, s not in C#10. D = B is lry join. W tk up I.31 t lin 8. B E C

84 Constrution # 11 Th Visul Construtions of Euli I.31:8. On th stright lin B n t th point on it, lt th ngl onstrut qul to th ngl BC [I.23]; WNTED D F GOSUB I.23 W must mov tringl nlosing th ngl BC, ut BC is lry tringl. Joining I.23 t lin 12, whih is whr I.22 is ll to mov th tringl, ut w must us th Prolus Vrition, I.22P. s usul, w follow th summry, in trms of th s n th two rms, n ol. This tim, w will furthr shortn tht routin y swinging h rm s soon s it is mov. Th intrpolt stp (xtning th trgt lin) is thn unnssry. E B E C I.22P. Mov th rm to th n of th trgt lin B n swing it. (Compss, [Post. 3]) D F s ol B C

Th Visul Construtions of Euli Constrution #11 85 I.22P. Mov th ol rm to th ol n B of th trgt lin B n swing it. D F s ol B ol C I.22P. Connt th mting point E of th n ol irls - th on on th si of th s opposit to th sour tringl - to th n of th trgt lin B. W n not mov th whol tringl BC, s this lin, th mov rm, is th only on n hr. So, RETURN to I.31 t lin 8. Clnup. E F ol B C

86 Constrution # 11 Th Visul Construtions of Euli I.1:11. n lt th stright lin G prou in stright lin with. F G Clnup n RETURN to I.42 t lin 14. B E C I.42:14. n through C lt CG rwn prlll to EF. WNTED D F G GOSUB I.31 Rll. B E C

Th Visul Construtions of Euli Constrution #11 87 I.31:7. Lt point tkn t rnom on, n lt join. I.31:8. On th stright lin, n t th point on it, lt th ngl onstrut qul to th ngl [I.23]; WNTED

88 Constrution # 11 Th Visul Construtions of Euli GOSUB I.23 s w hv lry th lin, w GOSUB I.22P t on, to mov th tringl. Swing th rm roun th n of th trgt lin. ol s Swing th ol rm roun th ol n of th trgt lin. ol

Th Visul Construtions of Euli Constrution #11 89 Connt th mting point, on th si of th trgt lin opposit to th sour tringl, to th n points of th trgt lin. Th tringl hs n mov. RETURN from I.22P to I.23. W hv th ngl qul to th ngl. Rll n RETURN to I.31 t lin 8. Now w xtn th nw lin whih is prlll to, rll, n RETURN to I.42 t lin 14.

90 Constrution # 11 Th Visul Construtions of Euli I.42:29. Thrfor th prlllogrm FECG hs n onstrut qul to th givn tringl BC, in th ngl CEF whih is qul to D. D F G Q.E.F. B E C