Prove or disprove the following statements:

Thread starter nddewaters
Start date Oct 12, 2010

Oct 12, 2010

nddewaters

a) Every odd number greater than 3 can be written as the sum of two prime numbers.
b) If n is not a multiple of 3, then n² + 2 is a multiple of 3.
c) If n is an odd number, then n² + 4 is prime.
d) If X ⊆ A and Y ⊆ B , then X ∪ Y ⊆ A ∩ B.

Physics news on Phys.org

Google claims its latest quantum algorithm can outperform supercomputers on a real-world task
Electrohydrodynamics pump and machine learning enable portable high-performance excimer laser
Controlled atomic defects in nickelate films narrow down explanations of superconductivity emergence

Oct 12, 2010

Petek

Gold Member

You'll probably get better advice if you show what you've already tried.

Thread 'Complex Numbers (Laurent Series)'

see attached.

View full post »

Thread 'Necessary criterion for expressing f(a + b)'

It's easy to see that any polynomial is function of that class. Also it seems that composition of exponent and polynomial is good as well. G_f(a, b) should be equal G_f(b, a) as the f(a+b) is symmetrical. Does anyone have information about this or at least related to it?

View full post »

Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'

Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

View full post »