Help in some suggested questions about congruences, Fermat theorem (& maybe Wilson's)

Hi people! That's my first time here in this forum, and I want to share with you some doubts.

My teacher of number's theorie suggested about 40 exercises about congruences, and I'm having trouble in some (5) of them.

There are the exercises:

**EDIT: NOTATION: (a,b) is the greatest common divisor of a and b; N for Naturals, Z for Integers and P for primes; is the Euler Totient of a.**

**1st) **If and , so .

-Observation: I think one problem is that I don't know how to create an useful relation in mod pq using relations on mod p and mod q. The only way that I know is the way that goes with the property: If , so .

**2nd) This second exercise is an generalization of the previous one (they are presented in this order).**

If and , so

**3rd) The third problem is how to proof that**

**4th) Exercise:** If , with , are related as follows: and , so .

-Obs.: I think the observation posted in the first exercise will affect this one.

**5th) **If and , with , so .

I hope you can help me, any help (or try to) is very welcome!

Thanks,

Rodrigo.

Re: Help in some suggested questions about congruences, Fermat theorem (& maybe Wilso

------------------------------------------------------------------------------------------------------------------

Solution to the third problem:

a^{7}-1

= a(a^{6}-1)

= a(a^{3}+1)(a^{3}-1)

= a(a+1)(a-1)(a^{2}+a+1)(a^{2}-a+1)

Clearly a(a+1) is divisible by 2 and a(a+1)(a-1) is divisible by 3.

Now the hard part is to show 7|(a^{7}-1). When divided by 7 the possible remainders are 1,2,3,...,6.

If a≡1(mod 7) then a^{3}≡1(mod 7).

If a≡2(mod 7) then a^{3}≡8(mod 7)≡1(mod 7)

If a≡3(mod 7) then a^{3}≡27(mod 7)≡-1(mod 7) i.e. a^{3}+1≡0(mod 7)

If a≡4(mod 7) then a^{3}≡64(mod 7)≡1(mod 7)

If a≡5(mod 7) then a^{3}≡125(mod 7)≡-1(mod 7) i.e. a^{3}+1≡0(mod 7)

If a≡6(mod 7) then a≡6(mod 7)≡-1(mod 7) i.e. a+1≡0(mod 7)

Therefore, the expression (a^{7}-1) is always divisible by 3 primes 2 , 3 and 7. So its divisible by 2x3x7=42 for all integers a.

--------------------------------------------------------------------------------------------------------------------------------

**Solution to the fourth problem:**

p and q are primes , p and q are distinct and a^{p }≡ a (mod q) and a^{q }≡ a (mod p).

By Fermat's Little Theorem we know a^{p }≡ a (mod p) and a^{q }≡ a (mod q).

Therefore, a^{p }≡ a (mod q) => (a^{p})^{q }≡ a^{q} (mod q) => a^{pq }≡ a^{q} (mod q) ≡ a (mod q)

Similarly a^{q }≡ a (mod p) => a^{pq }≡ a^{p} (mod q) ≡ a (mod q)

i.e ( a^{pq }- a) is divisible by both primes p and q where p and q are distinct. This implies that ( a^{pq }- a) is divisible by (pq) also.

So ( a^{pq }- a) ≡ 0 (mod pq) => a^{pq} ≡ a (mod pq).

--------------------------------------------------------------------------------------------------------------------------------

**Solution to the 5th problem:**

p and q are primes , p and q are distinct.

Now

a^{p+q} - a^{p+1} - a^{q+1} + a^{2}

= (a^{p} - a )(a^{q} - a)

= pK_{1} . qK_{2} for some integers K_{1} and K_{2}[By Fermat's Little Theorem]

= (pq).K where K=K_{1}.K_{2 }Therefore pq | (a^{p+q} - a^{p+1} - a^{q+1} + a^{2})

--------------------------------------------------------------------------------------------------------------------------------

Re: Help in some suggested questions about congruences, Fermat theorem (& maybe Wilso

Re: Help in some suggested questions about congruences, Fermat theorem (& maybe Wilso

Quote:

Originally Posted by

**Rodrigomkt** Thanks for all these exercise solutions Sarasij!

Specially for the 4th exercise solution, because of the property that you showed me (underlined). :)

With this property I solved the 1st and 2nd exercises easily.

Here's a more general version of the property: Be

, if

and

and

, so

.

Thanks for all,

Rodrigo

You are welcome...if you liked my solutions then I request you to give thanks to my user account by clicking the "Thanks" shown at the end of my replies.(Of course this is not mandatory,but in case if you want to...) (Cool)