Answer:A polynomial with integer coefficients that cannot be factored into polynomials of lower degree , also with integer coefficients, is called an irreducible or prime polynomial . Example 1: x2+x+1.

Step-by-step explanation:

8 0

2 years ago

Read 2 more answers

In a study of computer use, 1000 randomly selected Canadian Internet users were asked how much time they spend using the Interne

Dvinal [7]

Answer:

b. Do not reject H0. We do not have convincing evidence that the mean weekly time spent using the Internet by Canadians is greater than 12.7 hours.

Step-by-step explanation:

Given that in a study of computer use, 1000 randomly selected Canadian Internet users were asked how much time they spend using the Internet in a typical week. The mean of the sample observations was 12.9 hours.

$H_0: \bar x =12.7\\H_a: \bar x >12,7$

(Right tailed test at 5% level)

Mean difference = 0.2

Std error = $\frac{6}{\sqrt{1000} } \\=0.1897$

Z statistic = 1.0540

p value = 0.145941

since p >alpha we do not reject H0.

b. Do not reject H0. We do not have convincing evidence that the mean weekly time spent using the Internet by Canadians is greater than 12.7 hours.

5 0

3 years ago