The values of OM, PN, ON and MN of the given square are;
OM = 46
PN = 23
ON = 32.5
MN = 32.5
<h3>Pythagorean theorem</h3>
We are given;
LN = 46
- Now, LN is the diagonal of the square and as such to get the sides of the square, we will make use of pythagoras theorem to get;
LO² + ON² = 46²
Since LO = ON, then;
2LO² = 46²
LO² = 46²/2
LO = √1058
LO = 32.5
Thus;
LO = ON = MN = 32.5
For the diagonals;
LN = OM = 46
Also; LP = PN = 46/2 = 23
Read more about pythagoras theorem at;brainly.com/question/3317136
Answer:
Step-by-step explanation:
Expression:
long division step
4
24
24
00
0
04
4
0
Answer:
80 Students are in the band class
Step-by-step explanation:
I did this mentally so sorry if it is bad
16 = 20%
+
16 = 20%
= 40% 32 students
40% +40% = 80%
32+ 32 = 64
80+20%
64+16
80 Students are in the band class
Answer:
Sample
Step-by-step explanation:
The term that represents the description in the question is called sample.
Take for instance:
- 40 students selected from a class of 100
- 1000 people selected from a population of 100000
In the above descriptions:
40 and 1000 represent the samples while 100 and 100000 represent the populations, respectively.
Another example is when 10 cats are picked from an animal farm in order to study their eating pattern.
All these and many more represent sample.
Answer:
(1a) 9.54e-07 (1b) 0.9437 (2) 
Step-by-step explanation:
We have n = 10 questions. For each question in the multiple choice exam, we can choose the correct answer with probability p = 0.25 or an incorrect answer with probability q = 0.75 (just by guessing). Besides is reasonable to believe that questions are independent. Let X be the random variable that represents the number of correct answers (just by guessing) observed during the n = 10 questions, so, X have a binomial distribution.
(a) The probability of getting a perfect score just by guessing is
(b) The probability of getting at least one question correct, just by guessing
2. Each RUID is 9-digits long, there are 10 digits, each of the nine positions for a digit of the RUID has 10 posibilities except the 4th and 5th positions which must be both 0. For the multiplication rule there can be 
different RUIDS.
