(05.05 LC)

The map ratio of a map is 1: 50000. find the length on the ground represented by 6.4cm on the map

luda_lava [24]

Answer:

320,000

Step-by-step explanation:

6.4cm on the map would be 320,000 (ft I'm assuming) and I found that by multiplying 50,000x6.4.

3 0

3 years ago

A voter polling research group determined that 41% of the voters in a country would vote for the democratic candidate with a 4%

Soloha48 [4]

Answer:b will be the answer

Step-by-step explanatio

8 0

3 years ago

Read 2 more answers

Calculate the area of the circle with radius of 4.5 leave Answer in terms of pi

aleksklad [387]

A=pi r^2
= 20.25 pi is the answer

8 0

3 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:

Given integers $a, b$ , find $d=gcd(a,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$ .
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

3 years ago

Manufacturers are testing a die to make sure that it is fair (has a uniform distribution). They roll the die 66 times and record

steposvetlana [31]

Answer:

We should reject H0

At the 5% significance level, there is sufficient evidence to conclude that the die is not fair.

Step-by-step explanation:

Null hypothesis is a statement that is to be tested against the alternative hypothesis and then decision is taken whether to accept or reject the null hypothesis. The critical value is 15.091 and test statistic is 11.070. The null hypothesis is rejected or accepted on the basis of level of significance. When the p-value Test statistics is greater than level of significance we fail to reject the null hypothesis and null hypothesis is then accepted. In the given case p-value is less than critical value then we should reject the null hypothesis.

6 0

3 years ago