Analyzing the Setup
The expression provided is a classic polynomial in number theory:
P(n)=n2−n+41
This expression is famous for generating prime numbers for many consecutive integers. We are tasked with verifying the truth of the proposition P(n) for the specific values n=3 and n=5.
Evaluating P(3)
We begin our investigation by substituting
n=3 into the expression:
P(3)=32−3+41
First, we calculate the exponent:
32=9
Substituting this back into the expression, we get:
9−3+41=6+41=47
To determine if 47 is prime, we check for small prime divisors. It is not divisible by 2, 3, or 5. Since 47 has no divisors other than 1 and itself, we conclude that 47 is prime, and therefore P(3) is true.
Evaluating P(5)
Next, we turn our attention to
n=5. We substitute this value into the expression:
P(5)=52−5+41
Calculating the exponent gives:
52=25
The expression simplifies as follows:
25−5+41=20+41=61
We test 61 for primality by checking small prime factors. It is not divisible by 2, 3, or 5. Testing 7, we find that 61=7×8+5, which is not divisible. Since we have checked up to the square root of 61 (approximately 7.8), we confirm that 61 is prime, and therefore P(5) is true.
Final Conclusion
We have successfully evaluated both propositions. We found that P(3)=47 and P(5)=61, both of which are prime numbers.
Since both statements hold true, the correct conclusion is:
(4) Both P(3) and P(5) are true.