Show that and are relatively prime for all .

So we can find integers and such that for all . But I don't think this would be a very efficient way of doing this because you have to check it for all .

Maybe we could to the following: Show that has a multiplicative inverse modulo ? So show that there exists an integer such that ?