**a be a positive integer from set {2, 3, 4, … 9999}. Show that there are exactly two positive integers in that set such that 10000 divides a*a-1.**

**Put in place of 9999. How many positive integers a exists such that divides a(a-1)**

**Discussion:**

**Important Note:** If you are reading this, then please understand the full use of this discussion. A discussion typically begins with a comment from **Teacher **which contain hint for solution. After reading the first comment from teacher you should try to go back to the problem and solve it on your own. If you are unable to make any progress come back to this dialog. With each passing comment the solution unfolds. So it is more useful NOT to read the entire dialog in one shot. After reading each comment try the problem again and again. The only way to learn mathematics is by **doing** and the discussions in this blog are created to help you do exactly that.

**Teacher:** This is a clever problem. Especially the second part. For the first part can you find at least one value of a by trial and error? Use the prime factorization of 10000 and also the fact **a **and **a-1** are coprime numbers (why?)

**Student: **Sure. . As a and a-1 are coprime (they are consecutive numbers), hence we all the 2’s must divide either a or a-1 and all the 5’s must divide the other one.

**Teacher: **Absolutely

**Student: **So one of the numbers is a multiple of 625 and by adding or subtracting 1 to it we hope to find a multiple of 16.

**Teacher: **Right! You can easily get one by trial and error. You want mod 16 .

**Student: **625 works! If we subtract 1 from it we get 624 and that is a multiple of 16.

**Teacher: **Good. So 625 is one such number. Any other number?

**Student: **Should I check all multiples of 625 (and 16) and add (subtract) 1 from them. That will be tedious but will surely give the answer.

**Teacher: **That will definitely give the answer. But it will be very tedious. Instead observe that mod 16.

**Student: **Oh! That will help. We want mod 16 . Since mod 16 , we want mod 16. So possible values of k are 1, 15, 17, 31 (or numbers). However if we put k = 17 , the 625*17 exceeds 9999 (hence is not from the set). So k=15 is the other choice. Hence a-1 = 9375 (625*15) and a= 9376 is the other choice.

**Teacher: **Very nice. Now lets try the second part. For starters can you tell me for what kind of **n **no such **a**will exist?

**Student: **Obviously if **n **is a prime. For if n is a prime (say **p**) then it is impossible to have two consecutive numbers from the set {2, … } whose product will be divisible by (one of the two consecutive numbers needs to have 2 p’s but that is impossible because the first number with two p’s in it’s prime factorization is but we are taking numbers from the set {2 , 3, … , }

**Teacher: **Is it only primes that has this problem?

**Student: **Actually if where p is a prime then we have this problem (that is there will be no such **a** for which **a(a-1) **is divisible by )

**Teacher: **Okay. Now let us consider numbers which have more that one prime factor. Suppose **n = xy **such that x and y are coprime and both greater than 1, We split **n **into two co-prime factors because we want to divide a(a-1) and we need to divide a (or (a-1)) and to divide the other one.

**Student: **I see. We can proceed as before. The idea is this: if we add or subtract 1 from a multiple of we need that to be divisible by given that .

So

I cannot think what to do from here?

**Teacher: **We are allowed to take numbers from the set {2,3 ,4 .. } , so think about the permissible values for k.

**Student: **Oh okay! So k can be 1, 2, 3, .. (if k = or more then will exceed ) .

Now lets consider the set { } . There are terms in this set. If we reduce each term modulo we will get all the numbers (we get all residues except 0 as is not divisible by for any value of k from 1, 2, … as gcd = 1 .

**Teacher: **How can you say that we get as residues when we reduce{ } modulo?

**Student: **Firstly we won’t get 0 (that I have mentioned in my argument before). Secondly we get values . So if we can show that all residues that we get are distinct we are done. Suppose not.

Then mod . But this is not possible as and has no common factor and is smaller than (hence not completely divisible by it)

Thus all residues we get are distinct.

**Teacher: **Very well. Proceed.

**Student: **So there will exactly two values of k for which the residues will be +1 and -1. Hence we will get exactly two values of **a** for that x, y split of **n**.

**Teacher: **Right! So what is the final answer.

**Student: **If **n** has **k** (> 1)prime factors then there are ways to split it into two co prime parts and for each of them there are exactly two values of **a**. If n is a prime (or a power of a single prime) there are no such **a **.

## Trackbacks/Pingbacks

Google