Length in units:
Use phytogoras theorem or measure it by a ruler if your using a graph paper
AB = 5.65 units
AC = 5.83 units
CB = 1.41 units
Perimeter =5.65 + 5.83 + 1.41 = 12.89 units
Area = 1/2 * 1.41 * 5.65 = 3.98units
One bread recipe calls before 2 1/3 cups of flour. another bread recipe calls for 2 1/2 cups of flour. tim has 5 cups of flour.
1 answer:
You might be interested in
Answer:
621 and 82 are relatively prime.
Step-by-step explanation:
Two integers are relatively prime (or coprime) if there is no integer greater than one that divides them both (that is, their greatest common divisor is one).
The greatest common divisor of two integers <em>a</em> and <em>b</em> is the largest integer that divides them both.
The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.
The Euclidean algorithm solves the problem:
<em>Given integers a, b find </em><em />
The Euclidean algorithm provides a fast way to determine <em>d</em> without knowing the prime factors of <em>a</em> or <em>b</em>. Here is an outline of the steps:
- Let
,
- Given <em>x</em>, <em>y</em>, use the division algorithm to write
.
- If r = 0, stop and output <em>y</em>; this is the gcd of a, b.
- If
, replace (<em>x, y</em>) by (<em>y, r</em>). Go to step 2.
The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.
Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:
Step 1: Subtract D from N repeatedly until we get a result that lies between 0 (inclusive) and D (exclusive) and is the smallest non-negative number obtained by repeated subtraction.
Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.
Applying the above steps,
The gcd(621, 82) is 1. Therefore, 621 and 82 are relatively prime.