Two groups of tourist fly to Japan. It takes the first group 4 hours less than the second to fly
1 answer:
You might be interested in
The usual expectation for this kind of experiment is that the peas would yield green and yellow peas in a 3:1 ratio, or 75% green to 25% yellow. So your null hypothesis is that the proportion of yellow peas is 
.
You're testing the claim that 26% of the offspring will be yellow, which means the alternative hypothesis is that the proportion of yellow peas is actually 0.26, or more generally that the expected proportion is greater than 0.25, or
.
The test statistic in this case will be
where
is the proportion assumed under the null hypothesis, 
is the measured proportion, and 
is the sample size. You have 
, 
, and 
, so the test statistic is
Because you're testing
, this is a right-tailed test, so the P-value is
The critical value for a right-tail test at a 0.05 significance level is
, which means the rejection region is any test statistic that is larger than this critical value. Since 
in this case, we reject the null hypothesis.
So the conclusion for this test is that the sample proportion is indeed statistically significantly different from the proportion suggested by the null hypothesis.
You're testing the claim that 26% of the offspring will be yellow, which means the alternative hypothesis is that the proportion of yellow peas is actually 0.26, or more generally that the expected proportion is greater than 0.25, or
The test statistic in this case will be
where
Because you're testing
The critical value for a right-tail test at a 0.05 significance level is
So the conclusion for this test is that the sample proportion is indeed statistically significantly different from the proportion suggested by the null hypothesis.
First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.
We have
130 = 2 • 5 • 13
231 = 3 • 7 • 11
so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.
To verify the claim, we try to solve the system of congruences
Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:
130 = 7 • 17 + 11
17 = 1 • 11 + 6
11 = 1 • 6 + 5
6 = 1 • 5 + 1
⇒ 1 = 23 • 17 - 3 • 130
Then
23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)
so that x = 23.
Repeat for 231 and 17:
231 = 13 • 17 + 10
17 = 1 • 10 + 7
10 = 1 • 7 + 3
7 = 2 • 3 + 1
⇒ 1 = 68 • 17 - 5 • 231
Then
68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)
so that y = 68.