Finding the area of a triangle, Mathematics

Assignment Help:

Q. Finding the Area of a Triangle?

There are three commonly used methods to find the area of a triangle. The method you use to find the area depends on the information you know about the triangle.

Method: Base and Height are known.

746_Finding the Area of a Triangle.gif

This is the familiar method of finding the area of the triangle. Use the formula

Area = 1/2 bh

Where b is the base and h is the height.


Related Discussions:- Finding the area of a triangle

Binomial distribution, Binomial Distribution Consider a batch of N ligh...

Binomial Distribution Consider a batch of N light bulbs. Each bulb may be defective (S) or non-defective (F). The experiment involves selecting a light bulb and checking whethe

Find out the taylor series for f (x) = ex about x = 0, Find out the Taylor ...

Find out the Taylor Series for f (x) = e x about x = 0. Solution In fact this is one of the easier Taylor Series that we'll be asked to calculate.  To find out the Taylor

Initial value problems, Write a Matlab function MyIVP that solves an initia...

Write a Matlab function MyIVP that solves an initial-value problem (IVP) for a system of ordinary differential equations (ODEs) of the form x ?(t) = f (t, x(t)), where f : R × Rn ?

Union and intersection - set theory, Union and Intersection - Set theory ...

Union and Intersection - Set theory B ∩ C indicates the intersection of B and C. it is the set having all those elements that belong to both B and C If B = {5, 8, 11, 20, 2

Transforming the base of logarithms, Suppose that we know the logarit...

Suppose that we know the logarithms of all numbers which are expressed to base 'a' and we are required to find the logarithms of all these numbers to base 'b'. We

What is fibonacci sequence, what is Fibonacci Sequence? The most famous...

what is Fibonacci Sequence? The most famous sequence in mathematical history is called the Fibonacci sequence, discovered by the 12th-century mathematician Leonardo Fibonacci o

Prove - digraph of a partial order has no cycle more than 1, Prove that the...

Prove that the Digraph of a partial order has no cycle of length greater than 1. Assume that there exists a cycle of length n ≥ 2 in the digraph of a partial order ≤ on a set A

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