Question

Write 55 as the sum of two primes.

Write 55 as the sum of two primes.

Homework Answers

Answer #1

We have to write 55 as the sum of two primes.

Now, 55 is an odd number.

When an odd number is to be expressed as the sum of two numbers, then one number must be odd and one must be even.

[This is because of the fact that both odd numbers or both even numbers add up to an even number].

Now, we realise

55=odd number + even number

Now, both of these numbers have to be prime.

We know that an even number is prime, only if it is 2.

So, 2 is one number; and therefore the other number mut be 55-2, ie. 53.

The answer is

55, can be expressed as the sum of two prime numbers, 2 and 53.

55=2+53.

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
8. Prove or disprove the following statements about primes: (a) (3 Pts.) The sum of two...
8. Prove or disprove the following statements about primes: (a) (3 Pts.) The sum of two primes is a prime number. (b) (3 Pts.) If p and q are prime numbers both greater than 2, then pq + 17 is a composite number. (c) (3 Pts.) For every n, the number n2 ? n + 17 is always prime.
Using nested loops, write a function called primes(a,b) that takes in two positive integers a and...
Using nested loops, write a function called primes(a,b) that takes in two positive integers a and b (where a<b). Then simply RETURNS a string containing all the prime numbers between a and b (or if there are none, the string "No Primes"). You should check that a and b are valid inputs, that is, that a and b are integers such that a<b (otherwise, the function should print “No Primes”). Three sample calls of your function (in IDLE) should produce...
Twin primes are two primes that differ by two for example 3 and 5 are twin...
Twin primes are two primes that differ by two for example 3 and 5 are twin primes as well 11 and 13, a prime triplet is there primes that differ by 2 for example 3,5,7. Prove that 3,5,7 is the only prime triple
Let H be a regular hexagon. Write H as a Minkowski sum of two other objects...
Let H be a regular hexagon. Write H as a Minkowski sum of two other objects A and B. (A+B = H). Write in two ways.
User enters two numbers, N1, and N2. Write a program that determine if the numbers are...
User enters two numbers, N1, and N2. Write a program that determine if the numbers are twin primes. Definition: Twin primes are two prime numbers separated by 2. For example, 3 and 5 are both prime numbers and separated by 2. Another example is 17, 19.
Goldbach’s Weak Conjecture states that every odd number greater than 5 is the sum of three...
Goldbach’s Weak Conjecture states that every odd number greater than 5 is the sum of three primes. Goldbach’s Strong Conjecture states that every even number greater than 2 is the sum of two primes. Give an argument to show that if Goldbach’s Strong Conjecture is true, then Goldbach’s Weak Conjecture must be true as well
User enters two numbers, N1, and N2. Write a program that determine if the numbers are...
User enters two numbers, N1, and N2. Write a program that determine if the numbers are twin primes. Definition: Twin primes are two prime numbers separated by 2. For example, 3 and 5 are both prime numbers and separated by 2. Another example is 17, 19. matlab
Write in Racket Language Write a recursive Racket function "sum" that takes two integers as parameters,...
Write in Racket Language Write a recursive Racket function "sum" that takes two integers as parameters, each greater or equal to zero, and evaluates to their sum. In this problem, you must use the built-in functions "add1" and "sub1" and may not use the built-in functions "+" or "-". For example, (sum 2 3) should evaluate to 5. Note: (add1 5) evaluates to 6 and (sub1 4) evaluates to 3. Hint: like you saw in the "append" lecture, treat one...
Write a smallest_gap(start_num, end_num) function that finds smallest gap between successive primes, considering prime numbers in...
Write a smallest_gap(start_num, end_num) function that finds smallest gap between successive primes, considering prime numbers in the range from start_num to end_num (inclusive). For example, start_num = 5 and end_num = 12, the prime numbers in that range are: [5, 7, 11]. The smallest gap between any two prime numbers in this list is 2, so the function would return 2. Some example test cases (include these test cases in your program): >>> print(smallest_gap(5, 12)) 2 # The primes between...
Find the first 100 primes found by the classical proof of the infinitude of the set...
Find the first 100 primes found by the classical proof of the infinitude of the set of primes. That is: begin with P={2}; then form m, the sum of 1 with the product over all elements of P. Place the smallest prime factor of m into P and repeat. (For this problem, you may use FactorIntegeror similar built-in Mathematica functions.). Produce a Mathematica procedure with the above instructions.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT