All categories

3 years ago

What would be themost approriate cudtormy unit to measure the weight of a paper clip. ounces or pounds?

Mathematics

1 answer:

Dmitrij [34]3 years ago

6 0

Ounces would be the most accurate/appropriate to use with such a small item

You might be interested in

1.Consider the system of equations. x-5y=2

JulijaS [17]

1.Consider the system of equations. x-5y=2
3x-10y=11

(a) Jamar rewrote the first equation as –2x + 10y = –4. What justification did he have for doing this?

(b)Jamar combined the equation in Part (a) with the second equation in the system to get x = 7. Explain Jamar’s reasoning.

(c) What is the solution of the system? (d) How do you know, without graphing, that the graph of 4x – 15y = 13 passes through the point whose coordinates are the solution of the system?

8 0

2 years ago

Mr. Butler is playing a game with the pictured spinner. He wins the amount of money shown if he spins green. He loses the amount

masha68 [24]

Answer: He is more likely to win more money than lose money, but he has a equal chance of winning/losing.

The answer is number B

4 0

2 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

2 years ago

What is an written expression for 20+5×9

BartSMP [9]

Answer:

Five times nine plus twenty

Step-by-step explanation:

Just remember the order of operations... multiplication and division are done first before adding and subtracting.

7 0

3 years ago

True or False. 43 = 62

strojnjashka [21]

False...............

7 0

2 years ago