Question

3) Is it possible for a prime p to divide both n and n+1? (for n...

3) Is it possible for a prime p to divide both n and n+1? (for n > 0 and integer).

Homework Answers

Answer #1

Answer is:
NO

Statement: It is not possible for a prime number p to divide both n and n+1

Proof:

Given p is a prime number.

Case 1:

p divides n                      (1)

To prove: p does not divide n+1

Proof:

Because of (1), n is a multiplication of p.

i.e.,

n = pk                  (2)

Because of (2), p cannot pk + 1, since pk + 1 is not a multiple of p.

Case 2:

p divides n+1.

Then,

n+1 = pk.

So,

n = pk -1

So, p cannot divide n, because pk - 1 is not a multiple of p.

Combining both Case 1 & 2:

We prove the theorem that if p is prime, then p cannot divide both n and n+1

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Assume that p does not divide n for every prime number p with n> 1 and...
Assume that p does not divide n for every prime number p with n> 1 and p <= (n) ^ (1/3). Then prove that n is a prime number or a product of two prime numbers
Definition: Let p be a prime and 0 < n then the p-exponent of n, denoted...
Definition: Let p be a prime and 0 < n then the p-exponent of n, denoted ε(n, p) is the largest number k such that pk | n. Note: for p does not divide n we have ε(n,p) = 0 Notation: Let n ∈ N+ we denote the set {p : p is prime and p | n} by Pr(n). Observe that Pr(n) ⊆ {2, 3, . . . n} so that Pr(n) is finite. Problem: Let a, b be...
4. Prove that if p is a prime number greater than 3, then p is of...
4. Prove that if p is a prime number greater than 3, then p is of the form 3k + 1 or 3k + 2. 5. Prove that if p is a prime number, then n √p is irrational for every integer n ≥ 2. 6. Prove or disprove that 3 is the only prime number of the form n2 −1. 7. Prove that if a is a positive integer of the form 3n+2, then at least one prime divisor...
Let p be an odd prime and let a be an odd integer with p not...
Let p be an odd prime and let a be an odd integer with p not divisible by a. Suppose that p = 4a + n2 for some integer n. Prove that the Legendre symbol (a/p) equals 1.
suppose that p is a prime with p= 3 ( mod 4). Show that for all...
suppose that p is a prime with p= 3 ( mod 4). Show that for all x in Z_p, it is not possible for both x and -x to be squares (x and -x cannot have a square root)
A positive integer n is called "powerful" if, for every prime factor p of n, p2...
A positive integer n is called "powerful" if, for every prime factor p of n, p2 is also a factor of n. An example of a powerful number is A) 240 B) 297 C) 300 D) 336 E) 392
1. If p is a rational prime, then p is a constructible number if and only...
1. If p is a rational prime, then p is a constructible number if and only if it is a Fermat prime. true false Question 2 It is possible to construct a cube of volume 3 with straightedge and compass. True False Question 3 It is possible to construct a cube of volume 8 with straightedge and compass. Question 3 options: True False
Show that if p is a positive integer such that both p and p2 + 2...
Show that if p is a positive integer such that both p and p2 + 2 are prime, then p = 3.
Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find...
Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find phi(2^n) 2. Find phi(p^n) 3. Find phi(p•q) where p, q are distinct primes 4. Find phi(a•b) where a, b are relatively prime
Suppose N is a normal subgroup of G such that |G/N|= p is a prime. Let...
Suppose N is a normal subgroup of G such that |G/N|= p is a prime. Let K be any subgroup of G. Show that either (a) K is a subgroup of N or (b) both G=KN and |K/(K intersect N)| = p.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT