Question

In: Advanced Math

Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a...

Prove or disprove:

If a, b, c are any three distinct positive integers such that 1/a + 1/b + 1/c = 1, then a + b + c is a prime.

Solutions

Expert Solution

we will prove this result:

  • Thus, we have proved that a+b+c is always prime.
  • Had the condition of distinctness be removed, we would have gotten more solutions which would have disproved this result (3,3,3)

​​​​​​​If doubts bug you, feel free to comment your query!

Colby Messinger answered 2 years ago
Next > < Previous

Related Solutions

Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a...
Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a + 1/b + 1/c = 1, then a + b + c is a prime
Let S{a, b, c, d} be a set of four positive integers. If pairs of distinct...
Let S{a, b, c, d} be a set of four positive integers. If pairs of distinct elements of S are added, the following six sums are obtained:5,10, 11,13,14,19. Determine the values of a, b, c, and d. (There are two possibilities. )
Three positive integers (a, b, c) with a<b<c are called a Pythagorean triple if the sum...
Three positive integers (a, b, c) with a<b<c are called a Pythagorean triple if the sum of the square of a and the square of b is equal to the square of c. Write a program that prints all Pythagorean triples (one in a line) with a, b, and c all smaller than 1000, as well the total number of such triples in the end. Arrays are not allowed to appear in your code. Hint: user nested loops (Can you...
20 pairwise distinct positive integers are all smaller than 70. Prove that among their pairwise differences...
20 pairwise distinct positive integers are all smaller than 70. Prove that among their pairwise differences there are at least 4 equal numbers
8.Let a and b be integers and d a positive integer. (a) Prove that if d...
8.Let a and b be integers and d a positive integer. (a) Prove that if d divides a and d divides b, then d divides both a + b and a − b. (b) Is the converse of the above true? If so, prove it. If not, give a specific example of a, b, d showing that the converse is false. 9. Let a, b, c, m, n be integers. Prove that if a divides each of b and c,...
Prove or disprove if B is a proper subset of A and there is a bijection...
Prove or disprove if B is a proper subset of A and there is a bijection from A to B then A is infinite
Let a and b be positive integers, and let d be their greatest common divisor. Prove...
Let a and b be positive integers, and let d be their greatest common divisor. Prove that there are infinitely many integers x and y such that ax+by = d. Next, given one particular solution x0 and y0 of this equation, show how to find all the solutions.
(a) Can the sum of 12345 odd pos- itive integers be 12345678 ? Prove or disprove....
(a) Can the sum of 12345 odd pos- itive integers be 12345678 ? Prove or disprove. (b) Prove that for every possible re-arrangement (b1, b2, . . . , b999) of the numbers (1, 2, . . . , 999), the product (b1 − 1)(b2 − 2)(b3 − 3) · . . . · (b999 − 999) is even.
Prove by contraposition and again by contradiction: For all integers a,b, and c, if a divides...
Prove by contraposition and again by contradiction: For all integers a,b, and c, if a divides b and a does not divide c then a does not divide b + c Elaboration with definitions / properties used would be appreciated! Thanks in advance!!
Show that for any k ≥ 2, if n + 1 distinct integers are chosen from...
Show that for any k ≥ 2, if n + 1 distinct integers are chosen from the set [kn] = {1, 2, . . . , kn}, then there will be two integers which differ by at most k − 1. Please demonstrate the steps so that I can learn from it and solve other problems by following the reasoning!
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT