I'm having quite a lot of trouble with this proof. I can't even determine if this statement is true or false!
Q represents the set of rationals.
Z represents the set of integers.
∀q ∈ Q ∃r ∈ Q so that q + r ∉ Z and qr ∈ Z.
I think this is false because if q happened to be 1/1, then there's no r that satisfies the condition.
The negation would be:
∃q ∈ Q ∀r ∈ Q so that q + r ∈ Z or qr ∉ Z.
But I find this to be false too because there's no such number q that adds with any rational to make an integer, but also multiplies out to a non-integer.
My second question is:
gcd(M, 2010) > gcd(M, 271) > 1.
Find all possible values for gcd(M, 2010).
The gcd(M, 271) can only have the values of 271 or 1 since 271 is odd. But it has to be greater than one, so by elimination, gcd(M, 271) must be 271.
Now am I correct in doing the following? :
2010 * 271 to get 544710, because this number M must have a common divisor between 271 and 2010. Thus the value of gcd(M, 2010) is 2010?
Then the next part asks:
Suppose that the number M lies between 10020000 and 10030000.
Find M. Be sure to explain your reasoning.
I'm really lost on this one, so can someone help me with this please?
My answer so far is taking multiples of 544710 and trying to get it into the range of 10020000 and 10030000, but since I can't do that, there is no possible value for M?
Thank you in advance!