Finding the value for rejection region using some kind of table

  • Thread starter Thread starter korr2221
  • Start date Start date
  • Tags Tags
    Table Value
korr2221
Messages
20
Reaction score
0
I'm lost no how to find the cutoff rejection region and which table to use?

This is an example,
Data

n 34
X-bar 10.3
s 3.1

98% Confidence Interval for µ is
10.3 ± 2.33 x 0.5316
= (9.0632 , 11.5368)

Hypothesis
H0: µ ≤ 9
H1: µ > 9

Tests Z-stat = 1.3 = 2.4452
Statistic 0.5316

Significance Level = 0.01

Rejection Region =
Tail = RIGHT
Cutt -Off = Z-alpha = 2.326
Decision = Reject H0

p-value = 0.0072

I understand how they reject H0, but I am lost how they got 2.326. I think it's in the Z-table but I'm not sure, can someone explain to me clearly. It would also help if you can tell me how to find 0.0072 for the p-value.
 
Physics news on Phys.org
I'm not sure how your Z table is set up - whether it gives only tail areas or cumulative probabilities.

If it gives tail areas (areas to the right of specific Z-values, do this: look through the AREAS for 0.01 - the associated Z-value will be 2.326

If your Z- table gives cumulative probabilities (areas of the form P(Z <=z)), look for the area that is closest to 0.99 (this is 1 - 0.01) - again, the Z-value should be 2.236.

Some tables only give the area between 0 and specified values of Z. If this is the case, look through the areas for the value closest to 0.49 - again, you should find Z = 2.236.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top