Ask question

Ask question

All categories

schepotkina [342]

2 years ago

9

A package of 4 pairs of insulated gloves cost 35.96

1 answer:

tino4ka555 [31]2 years ago

6 0

Answer:

You need to add more to this question but I am assuming you want to know how much each pair of gloves is?

Step-by-step explanation:

Divide 35.96 by 4

35.96÷4= $8.99 per pair of insulated gloves

You might be interested in

When making a fruit salad, a chef chooses 7 fruits from 10 that are in season. how many different fruit salads can the chef crea

Furkat [3]

For this example, we must combine not permutate; this because a salad in which you first use apple then tomato is the same as the one in which you use first tomato then apple, so order does not matter.

Me must do "10 combine 7" which is written by the binomial coefficient $(_{7} ^{10})$ ; in general a binomial coefficient is written by:
$(_{k} ^{n})= \frac{n!}{k!(n-k)!}$

In which $n$ and $k$ are positive integers, such that $n\ \textgreater \ k$ .

So, for this problem:
$(_{7} ^{10})= \frac{10!}{7!(10-7)!}=\frac{10!}{7!3!}= \frac{10*9*8}{3*2}=10*3*4=120$

Hence, there are 120 different ways to make the fruit salad.

5 0

2 years ago

Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496

coldgirl [10]

Answer:

(a) $gcd(20, 12)=4$

(b) $gcd(100, 36)=4$

(c) $gcd(496,207 )=1$

Step-by-step explanation:

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 </em> $a, b$ <em>, find </em> $d=gcd(a,b)$ <em />

Here is an outline of the steps:

Let $a=x$ , $b=y$ .
Given $x, y$ , use the division algorithm to write $x=yq+r$ .
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.

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.

(a) To find $gcd(20, 12)$ we apply the Euclidean algorithm:

$20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(20, 12)=4$ .

(b) To find $gcd(100, 36)$ we apply the Euclidean algorithm:

$100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(100, 36)=4$ .

(c) To find $gcd(496,207 )$ we apply the Euclidean algorithm:

$496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0$

The process stops since we reached 0, and we obtain $gcd(496,207 )=1$ .

3 0

2 years ago

PLEASE HELP ME SOLVE WILL MARK AS BRAINLIEST IF ANSWERED CORRECTLY AMND SERIOUSLY

noname [10]

We can simplify this equation and find the value of k.

k ÷ 2 + 1 - 1k = -2k
k ÷ 2 + 1 = -k
k + 1 = -2k
1 = -3k
k = -1/3

6 0

2 years ago

Read 2 more answers

Our garden is full of flowers this year. We have 3 dandelions, 8 sunflower plants, and 15 petunias. What is the ratio of petunia

LUCKY_DIMON [66]

15:3, 15 to 3, 15/3 = 5

5 0

2 years ago

Read 2 more answers

(69 points!) Some1 please solve. (69 points!)

MAVERICK [17]

Answer:

for the second questio it is certainly The last choice D

Step-by-step explanation:

5 0

3 years ago