All categories

4 years ago

I don't understand this

Mathematics

2 answers:

Ilia_Sergeevich [38]4 years ago

8 0

Answer:

tytytytyt

Step-by-step explanation:

saw5 [17]4 years ago

7 0

Answer:

i don't either

Step-by-step explanation:

You might be interested in

Bas_tet [7]

Answer:

a) We reject H₀ We find difference between the mean of the two groups

b) we accept H₀ : There is no statistical difference ( in the scale of pain) when the difference in samples means is 1

Step-by-step explanation:

Group 1: Only with educational material

Sample size n₁ = 42

Sample mean x₁ = 3,2

Sample standard deviation s₁ = 2,3

Group 2: With exercises with the treatment of individuals

Sample size n₂ = 42

Sample mean x₂ = 5,2

Sample standard deviation s₂ = 2,3

Test Hypothesis

Null Hypothesis H₀ x₂ - x₁ = 0 or x₁ = x₂

Alternative Hypothesis Hₐ x₂ - x ₁ > 0 or x₂ > x₁

Significance level α = 0,01

Sample sizes are n₁ = n₂ > 30

We use z-test

for α = 0,01 z(c) ≈ 2,32

To calculate z(s)

z(s) = ( x₂ - x₁ ) / √ (2,3)²/42 + (2,3)²/42

z(s) = ( 5,2 - 3,2 )/ √0,2519

z(s) = 2 / 0,5

z(s) = 4

Comparing z(s) and z(c)

z(s) > z(c)

z(s) is in the rejection region. We reject H₀ the true average pain level for the control condition exceeds that for the treatment condition.

b) Does the true average pain level for the control condition exceed that for the treatment condition by more than 1.

In this case

z( s) = x₂ - x₁ / 0,5

z(s) = 1 /0,5

z(s) = 2

Comparing z(s) and z(c) now

z(s) < z(c) 2 < 2,32

And z(s) is in the acceptance region ( for the same significance level) and we should accept H₀ equivalent to say that the two groups statistical have the same mean

5 0

3 years ago

Use the principle of inclusion and exclusion to find the number of positive integers less than 1,000,000 that are not divisable

wel

This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.

∴N(c₁) = $\frac{999,999}{6} = 166666$
N(c₂) = $\frac{999,999}{4} = 250000$
∴N(c₁c₂) = $\frac{999,999}{24} = 41667$
∴ Number of positive integers that are not divisible by 4 or 6,

N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4

8 0

4 years ago

PLEASE HELP ASAP WILL MARK THE BRAINLEST

statuscvo [17]

Answer:

similar triangles

Step-by-step explanation:

First of all, what are similar shapes? Well, two shapes are similar if you can turn one into the other by moving, rotating, flipping, or scaling. That means you can make one shape bigger or smaller. In this case, we know that triangles ABC and DEF are mathematically similar. The area of triangles ABC is , so we need to know the area of triangle DEF.

From math, let's call the scaling factor, so we know that for any similar figures, the ratio of the areas of any are in proportion to . In other words, if is the area of triangle ABC, and is the area of triangle DEF, then we can write the following relationship:

4 0

3 years ago

Need help ()()()()()((;(;

Gwar [14]

Answer:

20%

Step-by-step explanation:

4/20 = x/100

100*4 =400

400/20 = 20

4/20 = 20/100

8 0

3 years ago

Read 2 more answers

HELPPPPP ITS DUE TODAY

siniylev [52]

Answer:

1) just make an equation (answer below)

SO the new bottle is 30 ounces

The old bottle was 25 percent more then the new one

So we can just find 25 percent of 30

And add it

That is the most simple way but I would just do

30*1.25 Its the same thing but if you think a bout ti, the new bottle can Only hold 30 ounces, 30 ounces is 100 percent of the new bottle, if you multiply 1.25 its adding 25 percent so it Turns a 2 step into a 1 step.

1.25*30=37.5

The larger bottle was 37.5 ounces

6 0

3 years ago

I don't understand this ​

I don't understand this