/
@ganeshie8
@terenzreignz
@freckles
Any ideas on where to start?
all I can grab is that we are restricted to a universe of reals (is this real numbers) and then supposedly either there exists an A and exists a C such that for all B and for all D ad=bc
yes, it's real numbers, and yeah that's what it's saying
I'm getting rusty on this. Let me process...
Make it easier
When you have to prove that something exists, you have to produce it; When you have to prove that something holds for all elements of a set, you have to use arbitrary elements from said set...
Actually, never mind. Let a = c = 0 then ad = bc for all b and d in the reals. Case closed.
This student is college.
How about it, @Angelina_Vella ? Suspiciously simple? I'm doubting myself lol
It feels right, haha it's what I was thinking before, but I can't see how it could be that short.
Wanna have some fun? Let's assume none of them are zeros, maybe that will let you find some peace haha
Haha alright
Let b and d be nonzero real numbers. Let c = 1. Then take \[\Large a = \frac{b}{d}\] This exists because d is nonzero. Then \[\Large ad =\frac{b}{\cancel d}\cdot \cancel d = b = bc\] And the assumption holds.
Ohhh I see it now
There was another question similar to this one,
This is complicated...
First I re-wrote it as products instead of fractions by cross multiplying, then are your supposed to set each side of the equation to one?
Not that simple. Best not to mess with fractions because you'd be implicitly making assumptions by cross-multiplying. Namely, by cross multiplying, you are already assuming equality and that the denominators are nonzero
But the only way I see how you can proving that it is true is if both sides equal 1
and to prove it false they should be different or that they can never be equal
Let me think again...
This was your original question, wasn't it? :P And you did the cross-multiplying and gave the question you initially posted?
No no, this is another question, sorry
the attached image is another question
I was just thinking the proof to this one would be similar to the one we did in the original posted question
well "explaination"
For proving the first part, yes, setting them to be equal to one seems sound. For any \(\large a \in \mathbb N\), choose \(b = a\)
Look at \[ad = k\] Can you find an integer \(d\) for all \(a\) ? \(k\) is fixed here.
So that for any \(\large c \in \mathbb N\), you can choose \(d = c\)
I'm a little lost
Okay, let me rephrase what I said earlier: When you have \(\forall \), then you have to taker arbitrary elements when you're proving. When you have \(\exists\), then you can choose a specific element when you're proving.
Okay that makes sense
So, we move at them one at a time, starting from the left: \[\large \forall a \ \ \exists b \ \ \forall c \ \ \exists d \ \ \frac{a}{b}=\frac cd \] So...
\[\large \color{red}{\forall a} \ \ \exists b \ \ \forall c \ \ \exists d \ \ \frac{a}{b}=\frac cd\] Let a be an arbitrary positive integer.
\[\large{\forall a} \ \ \color{red}{\exists b} \ \ \forall c \ \ \exists d \ \ \frac{a}{b}=\frac cd\] Let a be an arbitrary positive integer. Choose b to be equal to a.
Can you continue this trend, @Angelina_Vella ? ^_^
umm let c be an arbitrary positive integer that is....
equal to b?
No... You're right about the c part.
oh okay and then let d be equal to c?
Yes. Exactly. Then we demonstrate \[\large{\forall a} \ \ {\exists b} \ \ \forall c \ \ \exists d \ \ \color{blue}{\frac{a}{b}=\frac cd}\]
Since a = b and c = d,\(\Large \frac a b = 1 = \frac c d\) case closed. ^_^
Oh haha okay :) and then to prove the other false you have to show what a/b = c/d are never equal?
Sort of. But do you know how to negate quantifiers? ^_^
well they switch to the other dont they? kind of like laws of logic and deMorgan's law?
Exactly. The almighty negation. \(\Large \neg \) We could try proving the negation of the statement \[\Large \forall a \ \ \exists d \ \ \forall c \ \ \exists b \ \ \ \ \frac a b= \frac c d\]
So here goes... \[\Large \neg \forall a \ \ \exists d \ \ \forall c \ \ \exists b \ \ \ \ \frac a b= \frac c d\] \[\Large \color{red}{ \exists a }\ \ \neg \exists d \ \ \forall c \ \ \exists b \ \ \ \ \frac a b= \frac c d\]\[\Large \color{red}{ \exists a }\ \ \color{red}{ \forall d} \ \ \neg \forall c \ \ \exists b \ \ \ \ \frac a b= \frac c d\] \[\Large \color{red}{ \exists a \ \ \forall d \ \ \exists c} \ \ \neg \exists b \ \ \ \ \frac a b= \frac c d\]\[\Large \color{red}{ \exists a \ \ \forall d \ \ \exists c \ \ \forall b} \ \ \ \ \neg\frac a b= \frac c d\]\[\Large \color{red}{ \exists a \ \ \forall d \ \ \exists c \ \ \forall b \ \ \ \ \frac a b\ne \frac c d}\]
That's fancy
Only the best for you, lol Now let me think some more... Or you could do some thinking of your own XD
Haha well I never realized all you had to do was negate to make it not equal
But that was the easy part. Now comes the proving part. First, we have \(\Large \exists a \) We have to choose a very particular value for a. Choose wisely... :D
Haha you kill me >.<
ummm
d? :o
No. See, we don't have a d, yet. We're supposed to choose a value for a, FIRST, as this \(\exists a\) came before \(\forall d\)
oh okay, so like we choose a number?
Yeah... still thinking. Just keep bouncing your ideas off me lol
so we need to have it so the values are different in the equation?
always different
so the main thing will probably be the last for every right?
brb in like ten minutes. feel free to ask around lol
okie
So it's like an evil adversary problem, we have to pick variables associated with (there exists) and our evil adversary picks those associated with (for every)
@ganeshie8
Hmmmmmm
Yeah, I don't know how to finish this :/
Anyone understand what we're supposed to do to prove that a/b != c/d?
Okay... where was I? :D
need a particular value for (there exists) a
Ahh. Pick a prime number.
like 2?
Prime numbers are convenient. So let's choose a = 2
Now... let d be an arbitrary positive integer. You guys catch me so far?
why do we choose a prime number?
Let me work out my "TJ Magic"
if d is an arbitrary positive integer then we're only considering the set \[Z^{+}\]
Yup. So uhh @Angelina_Vella You following?
oh okay makes sense
for example Z = { -3,-2,-1,0,1,2,3} But Z plus = [0,1,2,3] those guys count
fffff... forgot the ... on each side XD
Zero is not included, Usuki-chan :P Anyway, now we come to \(\exists c\) Choose another prime number ^^
gomen XD
maybe we can keep it small like let c = 3?
Sure. And finally, we have an arbitrary positive integer, b.
like b = 4 ?
Now, we have to prove that \[\Large \frac a b \ne \frac c d\]
No, Usuki-chan, we have \(\forall b\) so b has to be arbitrary
@Angelina_Vella Still with me?
oh yeah that's for all of B
so far :)
so a = 2 and c = 3?
so what we have so far is a = 2 c =3 and d = ? b = ? for d and b are positive integers and a =2 and c = 3 are prime numbers
Join our real-time social learning platform and learn together with your friends!