All categories

3 years ago

How old would Abe linken if he was still alive

Mathematics

2 answers:

Anuta_ua [19.1K]3 years ago

8 0

He would be 208 years old

viva [34]3 years ago

6 0

If he were still alive (which would be impossible), Abraham Lincoln would be 208 years old. That's OLD!

I hope this helped! Please take the time to rate, pick the Brainliest answer (not necessarily mine!), and thank me if you feel I helped with this question! Thank you, it helps me a lot. :)

You might be interested in

FIND X PLEASEE I RLLY NEED HELP‼️‼️‼️‼️‼️‼️‼️

MaRussiya [10]

Answer:

x = 143

Step-by-step explanation:

The chord- chord angle x is half the sum of the measures of the arcs intercepted by the angle and its vertical angle, that is

x = $\frac{1}{2}$ (140 + 146) = 0.5 × 286 = 143

7 0

3 years ago

HELP i dont know how to do this

Korvikt [17]

Answer

Step-by-step explanation:

First, lets go through B-D and explain why they are correct.

B= f represents the number of flash drives. This means that the coefficient, 10, would be the cost per flash drive.

C= n represents the number of cases of paper. it says so in the question, so that one is a bit easier.

D= f represents the amount of packages of hanging folders. If the coefficient for B is the cost, then that would be the same case for D. Therefore it is correct because the coefficient is 13.

A would be incorrect because the coefficient represents the amount that one item costs. P is the packs of pencils, meaning that it would be $7 per pack of pencils.

Hope this helps!

3 0

4 years ago

Find the slope of a line that goes through the two points (-3, 6) and (2, -5).

irakobra [83]

Fbfbngngnhng bfbtyu 29

7 0

2 years ago

Read 2 more answers

Given that (-1, a) is the midpoint of the line segment joining (0, -2) and (b, 8) then find the values of a and b

Nikitich [7]

Answer: a=3 & b=-2

Step-by-step explanation:

6 0

3 years ago

Use the Euclidean Algorithm to demonstrate that 621 and 82 are relatively prime to each other. Explain.

8090 [49]

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 a and b 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:

Given integers a, b find $d=gcd(a,b)$

The Euclidean algorithm provides a fast way to determine d without knowing the prime factors of a or b. Here is an outline of the steps:

Let $a=x$ , $b=y$
Given x, y, use the division algorithm to write $x=yq+r, \quad 0\leq r\leq |y|$ .
If r = 0, stop and output y; this is the gcd of a, b.
If $r \neq 0$ , replace (x, y) by (y, r). 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,

$621-82=539\\539-82=457\\457-82=375\\375-82=293\\293-82=211\\211-82=129\\129-82=47\\\\621=82\cdot7+47$

$621 = 82\cdot 7 + 47\\ 82 = 47\cdot 1 + 35\\ 47 = 35\cdot1 + 12\\ 35 = 12\cdot2 + 11\\ 12 = 11\cdot1 + 1\\ 11 = 1\cdot11 + 0$

The gcd(621, 82) is 1. Therefore, 621 and 82 are relatively prime.

5 0

3 years ago