You are Here: Home >< Maths

# HELP me plzzzz please ASAP watch

1. How do i prove a=bc+d with a,b,c,d belong to Z then gcd (a,b)=gcd(b,d)

And how i prove or disprove the quantifier
Attached Files
2. quan.doc (23.5 KB, 86 views)
3. isn't the first bit something to do with the euclidean algorithm? google it.
4. (Original post by kanz)
How do i prove a=bc+d with a,b,c,d belong to Z then gcd (a,b)=gcd(b,d)
Show that any common divisor of a and b is a divisor of d (as well as b) and any common divisor of b and d is a divisor of a (as well as b) so the two pairs have the same common divisors and hence the same greatest comon divisors.

And how i prove or disprove the quantifier
Your expression seems to say that any two subsets of the rationals are in bijection and thus have the same cardinality (so for finite sets the same number of elements). The answer should be clear.

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: August 27, 2007
Today on TSR

### University open days

Wed, 21 Nov '18
• Buckinghamshire New University
Wed, 21 Nov '18
• Heriot-Watt University
Wed, 21 Nov '18
Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams