construct an isosceles triangle, Mathematics

Assignment Help:

1. Construct an isosceles triangle whose base is 7cm and altitude 4cm and then construct another similar triangle whose sides are 1/2 times the corresponding sides of the isosceles triangle.

2.  Draw a line segment AB of length 8cm. taking A as center, draw a circle of radius 4cm and taking B as centre, draw another circle of radius 3cm. Construct tangents to each circle from the center of the other circle.

 


Related Discussions:- construct an isosceles triangle

Algebra, 25 algebraic equations that equal 36

25 algebraic equations that equal 36

Explain multiplying-dividing negative fractions, Explain Multiplying/Dividi...

Explain Multiplying/Dividing Negative Fractions? There are 3 steps to multiplying or dividing fractions. 1. If any negative signs are present, place them next to the numerator

Complex root - fundamental set of solutions, Example : Back into the comple...

Example : Back into the complex root section we complete the claim that y 1 (t ) = e l t cos(µt)        and      y 2 (t) = e l t sin(µt) Those were a basic set of soluti

Minimizes the sum of the two distance, The value of y that minimizes the su...

The value of y that minimizes the sum of the two distances from (3,5) to (1,y) and from (1,y) to (4,9) can be written as a/b where a and b are coprime positive integers. Find a+b.

Fractions, what is the lowest term of 11/121

what is the lowest term of 11/121

Geometry, what is sin, cos, and tan?

what is sin, cos, and tan?

Geometric , a part of a line with two end points.

a part of a line with two end points.

Determines the first four derivatives of y = cos x, Example    determines t...

Example    determines the first four derivatives for following.                                                                  y = cos x Solution: Again, let's just do so

Find out the length of hamiltonian path, Find out the length of Hamiltonian...

Find out the length of Hamiltonian Path in a connected graph of n vertices. Ans: The length of Hamiltonian Path in a connected graph of n vertices is n-1.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd