If n > 1 is an integer not of the form 6k + 3, prove that n + 2" is composite. [Hint: Show that either 2 or 3 divides n+ 2".]

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
13
58% 4
2:09 PM
ll Pure Talk
(ar + bs) =(/2a)r +(/2b)s = 2br + as
This representation of /2 leads us to conclude that 2 is an integer, an obvious
with
impossibility.
PROBLEMS 3.1
ther
1. It has been conjectured that there are infinitely many primes of the form n? – 2. Exhibit
five such primes.
2. Give an example to show that the following conjecture is not true: Every positive integer
can be written in the form p +a?, where p is either a prime or 1, and a 20.
3. Prove each of the assertions below:
(a) Any prime of the form 3n + 1 is also of the form 6m + 1.
(b) Each integer of the form 3n +2 has a prime factor of this form.
(c) The only prime of the form n³ – 1 is 7.
(Hint: Write n – 1 as (n – 1)(n² + n + 1).]
(d) The only prime p for which 3p+ 1 is a perfect square is p = 5.
(e) The only prime of the form n - 4 is 5.
4. If p 2 5 is a prime number, show that p + 2 is composite.
[Hint: p takes one of the forms 6k +1 or 6k + 5.]
5. (a) Given that p is a prime and p|a", prove that p" | a".
(b) If gcd(a, b) = p, a prime, what are the possible values of gcd(a², b²), gcd(a², b) and
gcd(a', b²)?
6. Establish each of the following statements:
(a) Every integer of the form n* + 4, with n > 1, is composite.
[Hint: Write n4
(b) If n > 4 is composite, then n divides (n – 1)!.
(c) Any integer of the form 8" + 1, where n > 1, is composite.
[Hint: 2" + 1|23n + 1.]
(d) Each integer n > 11 can be written as the sum of two composite numbers.
[Hint: If n is even, say n = 2k, then n – 6 = 2(k – 3); for n odd, consider the integer
n- 9.1
7. Find all prime numbers that divide 50!.
8. If p 2
9. (a) An unanswered question is whether there are infinitely many primes that are 1 more
than a power of 2, such as 5 = 22 + 1. Find two more of these primes.
(b) A more general conjecture is that there exist infinitely many primes of the form
n² + 1; for example, 257 = 16² + 1. Exhibit five more primes of this type.
10. If p #5 is an odd prime, prove that either p2 - 1 or p² + 1 is divisible by 10.
11. Another unproven conjecture is that there are an infinitude of primes that are 1 less than
a power of 2, such as 3 = 22 - 1.
(a) Find four more of these primes.
(b) If p = 2* – 1 is prime, show that k is an odd integer, except when k = 2.
[Hint: 3|4" – 1 for all n > 1.]
12. Find the prime factorization of the integers 1234, 10140, and 36000.
13. If n > 1 is an integer not of the form 6k + 3, prove that nº + 2" is composite.
[Hint: Show that either 2 or 3 divides n+ 2".]
On
of
+4 as a product of two quadratic factors.]
5 and p and q are both primes, prove that 24| p² – q².
Transcribed Image Text:58% 4 2:09 PM ll Pure Talk (ar + bs) =(/2a)r +(/2b)s = 2br + as This representation of /2 leads us to conclude that 2 is an integer, an obvious with impossibility. PROBLEMS 3.1 ther 1. It has been conjectured that there are infinitely many primes of the form n? – 2. Exhibit five such primes. 2. Give an example to show that the following conjecture is not true: Every positive integer can be written in the form p +a?, where p is either a prime or 1, and a 20. 3. Prove each of the assertions below: (a) Any prime of the form 3n + 1 is also of the form 6m + 1. (b) Each integer of the form 3n +2 has a prime factor of this form. (c) The only prime of the form n³ – 1 is 7. (Hint: Write n – 1 as (n – 1)(n² + n + 1).] (d) The only prime p for which 3p+ 1 is a perfect square is p = 5. (e) The only prime of the form n - 4 is 5. 4. If p 2 5 is a prime number, show that p + 2 is composite. [Hint: p takes one of the forms 6k +1 or 6k + 5.] 5. (a) Given that p is a prime and p|a", prove that p" | a". (b) If gcd(a, b) = p, a prime, what are the possible values of gcd(a², b²), gcd(a², b) and gcd(a', b²)? 6. Establish each of the following statements: (a) Every integer of the form n* + 4, with n > 1, is composite. [Hint: Write n4 (b) If n > 4 is composite, then n divides (n – 1)!. (c) Any integer of the form 8" + 1, where n > 1, is composite. [Hint: 2" + 1|23n + 1.] (d) Each integer n > 11 can be written as the sum of two composite numbers. [Hint: If n is even, say n = 2k, then n – 6 = 2(k – 3); for n odd, consider the integer n- 9.1 7. Find all prime numbers that divide 50!. 8. If p 2 9. (a) An unanswered question is whether there are infinitely many primes that are 1 more than a power of 2, such as 5 = 22 + 1. Find two more of these primes. (b) A more general conjecture is that there exist infinitely many primes of the form n² + 1; for example, 257 = 16² + 1. Exhibit five more primes of this type. 10. If p #5 is an odd prime, prove that either p2 - 1 or p² + 1 is divisible by 10. 11. Another unproven conjecture is that there are an infinitude of primes that are 1 less than a power of 2, such as 3 = 22 - 1. (a) Find four more of these primes. (b) If p = 2* – 1 is prime, show that k is an odd integer, except when k = 2. [Hint: 3|4" – 1 for all n > 1.] 12. Find the prime factorization of the integers 1234, 10140, and 36000. 13. If n > 1 is an integer not of the form 6k + 3, prove that nº + 2" is composite. [Hint: Show that either 2 or 3 divides n+ 2".] On of +4 as a product of two quadratic factors.] 5 and p and q are both primes, prove that 24| p² – q².
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Discrete Probability Distributions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,