0 of 10 Questions completed
Questions:
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 10 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
\(
\text { If } p \text { is a prime number, how many factors does } p^2 \text { have? }
\)
The value of \(p^2\), or \(p \cdot p\), is the product of \(p\) and \(p\), so it will be divisible by \(1, p, p^* p\), and nothing else (we know that the \(p^{\prime}\) s are not divisible because they are prime). Therefore \(p^2\) has exactly three factors.
(Alternatively, we can plug in any prime number for \(p\) and see how many factors \(p^2\) has. For example, if \(p\) is 3 , then the factors of \(p^2\), or 9 , are 1,3 , and 9.)
The sum of four consecutive integers is 210. Which one of these four integers is prime?
Let \(x\) represent the smallest of the four numbers.
Then we can set up the following equation:
\(
\begin{aligned}
& x+(x+1)+(x+2)+(x+3)=210 \\
& 4 x+6=210 \\
& 4 x=204 \\
& x=51
\end{aligned}
\)
Therefore the four numbers are \(51,52,53,54\). The only prime in this list is 53.
\(
\text { Say } p \text { is a prime number. Which operation could possibly also lead to a prime number? }
\)
Prime numbers are integers. So doing division and square roots will not generate integers. By doing multiplication and exponents, we involve more factors. The only possibility is subtraction. If \(p\) was 7 and we subtracted 2 we get 5 which is also prime.
Say \(n\) is a number. \(n\) has, other than one and itself, only prime factors. \(n\) is not a perfect square. What is the smallest prime number \(n\) can be?
Other than the number itself and one, we also need to have prime factors in that number. Since it’s not a perfect square, we need to find the smallest possible prime numbers. That will be \(2 \times 3\) or 6 which is our answer.
If \(n\) is a prime number, what could also be prime?
\(n-2\)
Plug in a prime number such as 7 and evaluate all the possible solutions. Note that the question asks which value could be prime, not which must be prime. As soon as your number-picking yields a prime number, you have satisfied the “could be prime” standard and know that you have a correct answer.
Which number is greater than the sum of all the prime factors of 330?
The prime factorization of 330 is .
The sum of the prime factors is .
23 is the only answer choice greater than 21.
What is half of the third smallest prime number multiplied by the smallest two-digit prime number?
The third smallest prime number is 5. (Don’t forget that 2 is a prime number, but 1 is not!)
The smallest two digit prime number is 11.
Now we can evaluate the entire expression:
\(
\frac{5}{2} \times 11=\frac{55}{2}
\)
\(a, b\) and \(c\) are integers, and \(a\) and \(b\) are not equivalent.
If \(a x+b x=c\), where \(c\) is a prime integer, and \(a\) and \(b\) are positive integers which of the following is a possible value of \(x ?\)
This question tests basic number properties. Prime numbers are numbers which are divisible only by one and themselves. Answer options ‘ 2 ‘ and ‘ 4 ‘ are automatically out, because they will always produce even products with \(a\) and \(b\), and the sum of two even products is always even. Since no even number greater than 2 is prime, 2 and 4 cannot be answer options. 3 is tempting until you remember that the sum of any two multiples of 3 is itself divisible by 3 , thereby negating any possible answer for c except 3 , which is impossible. There are, however, several possible combinations that work with \(x=1\). For instance, \(a=8\) and \(b=9\) means that \(8(1)+9(1)=17\), which is prime. You only need to find one example to demonstrate that an option works. This eliminates the “None of the other answers” option as well.
An amazing number is a name for such an even number, the decomposition product of prime numbers has exactly three, not necessarily different factors, and the sum of all its divisors is equal to twice that number. Find all the amazing numbers.
\(n=28\)
Step-by-step explanation:
\(
\begin{aligned}
& 28=2 \cdot 2 \cdot 7 \\
& 1+2+4+7+14+28=2 \cdot 28=56
\end{aligned}
\)
Define a series of consecutive prime numbers to be a series of numbers, each prime, in which there are no other prime numbers between them. These are not necessarily consecutive numbers themselves. For example, the numbers 5,7, and 11 are consecutive prime numbers, although they are not consecutive numbers. If \(x\) is the first number in a series of \(x\) prime numbers, which of the following could not be the value of the last number in the series?
The primes, in order, are:
\(
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53, \ldots
\)
We create a few series:
\(x=2\)-> series length \(2: 2,3\)
\(x=3\)-> series length \(3: 3,5,7\)
\(x=5\)-> series length \(5: 5,7,11,13,17\)
\(x=7\)-> series length 7: 7,11,13,17,19,23,29 etc.
We can then see that, of the answers, only 47 and 31 remain possibly correct answers. Now we need to decide which of those two are impossible.
We could do another series, but the \(x=11\) series has 11 terms requiring us to go further and further up. If we do this, we’ll find that it terminates at 47 , meaning that 31 must be the correct answer.
Another way, however, is to notice that 29 is the end of the \(x=7\) series. Since 31 is the very next prime number, if we start on 11 , the series that terminates in 31 would have to have length 7 as well. Every series after \(x=7\) will thus end on a number larger than 31 , meaning we will never finish on a 31.
You cannot copy content of this page