You are Here: Home >< Maths

# mod help watch

Announcements
1. hey i'm a little stuck on this question, I can seem to do it fine when actual values are being used but can't quite get an answer/know what I'm meant to be writing down as an answer for this question:

Set h = gcd(a,n)
If h does not divide b, then prove that ax = b(mod n) has no
integer solutions for x.

All i've managed to do is write h in terms of a and n using other parameters and saying there should be h solutions to it if there were any..not even sure if this is right?! Help!
2. Ok. Messy, but:

We know that ax = np + b (*) for some integer p (why?). Now, let qh = a, rh = n, where q and r are integers (why can we do this?). Then we can rewrite (*) as...

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: January 28, 2009
Today on TSR

Not anymore!

### University open days

• University of Lincoln
Wed, 12 Dec '18
• Bournemouth University
Midwifery Open Day at Portsmouth Campus Undergraduate
Wed, 12 Dec '18
• Buckinghamshire New University
Wed, 12 Dec '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