Want this question answered?

Q: If the numbers 79 86 81 80 89 are on a test what number is needed to get a mean of 84?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

All numbers are not divisible by 3. In order to test if a number is a prime, you first test to see if it ends in a 2, 4, 6, 8, or 0. In that case it is divisible by 2 and not a prime. The next number you use for your test is 3. More odd numbers are divisible by 3 than by any other odd number but it is only the second number used for the test. You continue testing until you reach the square root of the number. If the number is only divisible by itself and one, it is prime. 3 is only the second test number in the division test for primes.

The mean is the average of all numbers. Just like getting the average of your test scores.

The minimum number you must answer correctly is(0.01) x (the percentage needed to pass) x (the number of questions on the test).

You can easily work it out. firstly, you know that the even numbers are not prime, so that leaves only ~15 numbers. You can check out each number. [hint you only have to test for factors of a number up to the square root of the number.]

that is an impossible question unless you say the numbers you add it all to.Example: Brandy got the test scores of 91, 93, and 92. What is the mean of her test scores?So first add all the numbers, 91+93+92=276There were 3 test scores so divide the answer by 3.276 divided by 3=92!thats how u do it!

Related questions

What exactly do you mean "yields only prime numbers"? If you mean a formula that when given the numbers n=1, 2, 3, ... and so on generates the nth prime number (or a different prime number for each n) then no. If you mean an algorithm whereby a number can be tested to be a prime number then yes. (Using this prime_test algorithm, a simple algorithm can be written that would supply numbers one at a time to it and use its result to decide whether to yield the tested number or not, only yielding those numbers which pass the test.)

answer is:Find the function's zeros and vertical asymptotes, and plot them on a number line.Choose test numbers to the left and right of each of these places, and find the value of the function at each test number.Use test numbers to find where the function is positive and where it is negative.Sketch the function's graph, plotting additional points as guides as needed.

All numbers are not divisible by 3. In order to test if a number is a prime, you first test to see if it ends in a 2, 4, 6, 8, or 0. In that case it is divisible by 2 and not a prime. The next number you use for your test is 3. More odd numbers are divisible by 3 than by any other odd number but it is only the second number used for the test. You continue testing until you reach the square root of the number. If the number is only divisible by itself and one, it is prime. 3 is only the second test number in the division test for primes.

First number is systolic, the second number is diastolic.

When you test your blood for insulin rates in your body, a diabetic has numbers that come up on a test strip. If you are below 3 the number is too low. If you are above 8, the number is too high.

2

sensitivity numbers means how the antibioic reacts in a certain bacteria

The mean is the average of all numbers. Just like getting the average of your test scores.

Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".

What do the numbers in the egfr test mean - 50 75 yr old female?

158

The calculator will run a certain number of random numbers to test a program.