c.) There is a conjecture called "Goldbach's weak conjecture" (yes, really!) thatevery odd number greater than 5 can be expressed as the sum of three primes. (Aprime may be used more than once in the same sum). Find two examples of this.Step1: Understand the problem. Show your word by word translation.401Every odd number (make a list) →greater than 5 (fix the above list!) →3031can be expressed as →L97,106the sum of (what does sum mean?) -three primes (make a list of primes) →Pick your own odd number (different from your group) and show the conjecture istrue for that number. Share your work with your group.

Given: Odd numbers greater than 5. To prove: Every odd number greater than 5 can be written sum of…

c.) There is a conjecture called "Goldbach's weak conjecture" (yes, really!) that every odd number greater than 5 can be expressed as the sum of three primes. (A prime may be used more than once in the same sum). Find two examples of this. Step1: Understand the problem. Show your word by word translation. Every odd number (make a list) → greater than 5 (fix the above list!) → 3031 can be expressed as → 97 the sum of (what does sum mean?) → three primes (make a list of primes) → Pick your own odd number (different from your group) and show the conjecture is true for that number. Share your work with your group.