Ask your own question, for FREE!
Mathematics 14 Online
OpenStudy (anonymous):

In the domain of all integers, use the predicates below to write the statement as a formula using the appropriate quantifies. "Every prime number greater than 3 is the sum of two prime numbers." * P(x) = " is a prime number." * G(x, y) = "x > y" * S(x, y, z) = "x = y + z"

zepdrix (zepdrix):

Hmm :d

zepdrix (zepdrix):

I'm thinking they want something along these lines... maybe... For all \(\rm x\in\mathbb Z\), if \(\rm x\in P\) and ... no no no.. they're doing something else fancy here. Hmm, trying to make sense of this. Do you have an example problem maybe?

OpenStudy (anonymous):

I don't, sorry

zepdrix (zepdrix):

Ok maybe it's as simple as this...

zepdrix (zepdrix):

`For every x in P(x),` `If G(x,3)` <-- This is saying if x is greater than 3, read your definition of G(x,y) again if that's confusing. `Then S(x, y, z) where y, z are also in P`.

zepdrix (zepdrix):

Grr I dunno, something like that... hmm

OpenStudy (anonymous):

That looks to me like it would be correct also, or at least close to it. Does that specify that x is the sum of "prime" numbers?

zepdrix (zepdrix):

I find it a little confusing that they're using this y value in both G and S. In G it's clear that it should be 3 for the y value. We want our prime number to be greater than 3. But we don't want to use this value for the sum in S. x could be the sum of two different primes, not necessarily 3 being one of them. But yes, the y and z should also belong to this group P. For all x in P(x) If G(x,3), Then S(x,y,z), where y, z are in P(x). We're calling it P(x) though, hmm...

zepdrix (zepdrix):

Bahh math is hard >.<

zepdrix (zepdrix):

Or maybe this is better, For all x in P(x), there exists y,z in P(x) such that, if G(x,3) then S(x,y,z) Stating where y and z are at the start seems to make more sense.

OpenStudy (anonymous):

Yes it is ha. Ohhh, I see now. Do you think this would make sense?: For every x such that P(x)((G(x, y)) there exists some x and some y such that P(x) such thatS(x, y, z) ??

OpenStudy (anonymous):

It's a little hard to understand because I can't type in the right symbols

zepdrix (zepdrix):

Maybe like this: For every x such that P(x) and G(x,3), there exist some y and z such that S(x,y,z) You certainly don't want to say something about "every x" and then connect that to "there exists an x" that doesn't really make sense :)

zepdrix (zepdrix):

*There exists some y and z such that P(y) and P(z) and S(x,y,z)

zepdrix (zepdrix):

For the last line, I didn't say anything about y and z being prime. Maybe that corrects it.

OpenStudy (anonymous):

Ok, I think the way you said it is actually the way I have it down on paper. Do you think pecifying that they are prime could maybe be something like: there is some why and some z such that P(y)^P(z) ?

zepdrix (zepdrix):

\[\large\rm \exists y,z:P(y)\wedge P(z)\wedge S(x,y,z)\]Using your "and" modifier? Yah that seems good. I think you want to chain it together with your Sum statement like this though. Unless you had something else in mind.

zepdrix (zepdrix):

Math Logic is some goofy stuff, huh? :) lol

OpenStudy (anonymous):

Hat is exactly what I have written, thanks. It is very goofy lol

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!