You are testing the claim that the mean GPA of night students is different from the mean GPA of day students. You sample 30 night students, and the sample mean GPA is 2.35 with a standard deviation of 0.46. You sample 25 day students, and the sample mean GPA is 2.58 with a standard deviation of 0.47. Test the claim using a 5% level of significance. Assume the sample standard deviations are unequal and that GPAs are normally distributed. Give answer to exactly 4 decimal places. Hypotheses:sub(H,0):sub(μ,1) = sub(μ,2)sub(H,1):sub(μ,1) ≠ sub(μ,2)**I'm not sure how to calculate this in excel***Enter the test statistic - round to 4 decimal places. A=Enter the p-value - round to 4 decimal places. A=

Step-by-step explanation:

This is a test of 2 independent groups. The population standard deviations are not known. Let μ1 be the mean GPA of night students and μ2 be the mean GPA of day students.

The random variable is μ1 - μ2 = difference in the mean GPA of night students and the mean GPA of day students.

We would set up the hypothesis.

The null hypothesis is

H0 : μ1 = μ2 H0 : μ1 - μ2 = 0

The alternative hypothesis is

H1 : μ1 ≠ μ2 H1 : μ1 - μ2 ≠ 0

This is a two tailed test.

Since sample standard deviation is known, we would determine the test statistic by using the t test. The formula is

(x1 - x2)/√(s1²/n1 + s2²/n2)

From the information given,

μ1 = 2.35

μ2 = 2.58

s1 = 0.46

s2 = 0.47

n1 = 30

n2 = 25

t = (2.35 - 2.58)/√(0.46²/30 + 0.47²/25)

t = - 1.8246

The formula for determining the degree of freedom is

df = [s1²/n1 + s2²/n2]²/(1/n1 - 1)(s1²/n1)² + (1/n2 - 1)(s2²/n2)²

df = [0.46²/30 + 0.47²/25]²/[(1/30 - 1)(0.46²/30)² + (1/25 - 1)(0.47²/25)²] = 0.00025247091/0.00000496862

df = 51

We would determine the probability value from the t test calculator. It becomes

p value = 0.0746

Since alpha, 0.05 < than the p value, 0.0746, then we would fail to reject the null hypothesis.

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol