https://gowers.wordpress.com/2008/07/30/recognising-countable-sets/

Thanks Dr. Gowers’. These are invaluable insights into basics. Thanks for giving so much of your time.

https://gowers.wordpress.com/2008/07/30/recognising-countable-sets/

Thanks Dr. Gowers’. These are invaluable insights into basics. Thanks for giving so much of your time.

https://gowers.wordpress.com/2011/10/13/domains-codomains-ranges-images-preimages-inverse-images/

Thanks a lot Prof. Gowers! Math should be sans ambiguities as far as possible…!

I hope my students and readers can appreciate the details in this blog article of Prof. Gowers.

Regards,

Nalin Pithwa

Practice. Practice. Practice.

1) In how many ways, can a total of 16 be obtained by rolling 4 dice once?

2) Calculate the coefficient of in .

3) Observe the identity of answers to Problem 1 and 2. If you think it is a mere coincidence, experiment with other numbers in place of 16 and 4. If you do not think it is a mere coincidence, explain it and go to Problem 4. If you cannot explain its identity, experiment with other numbers.

4) Express the number of ways of obtaining a total of n by rolling p dice, as a certain coefficient in a suitable product of binomial expansion in powers of t. If you cannot do this problem, go to problem 3.

5) Verify that the number of increasing words of length 10 out of the alphabet with is the coefficient of in . Try to explain why this is so.

6) A child has a store of toy letters consisting of 4 A's, 3 B's, and 2 E's. (6a) How many different increasing four-letter words (given A<B<E) can it make? The child does not worry about the meanings of the words. (6b) Show that there exists a bijection between the set of increasing four-letter words of all possible lengths and the set of terms of the expansion . (6c) Can you obtain the answer to (6a) as certain numerical coefficient in a suitable expansion of products?

7) The Parliament of India, in which there are n parties represented, wants to form an all-party committee (meaning, a committee in which there is at least one member from each party) of members. Assuming (a) that there exist sufficient members available for the committee in each party and (b) that the members of each party are indistinguishable among themselves(!), find the number of distinct ways of forming the committee. Show that this number may be expressed as a suitable coefficient in the binomial expansion of

8) Find the number N of permutations of the multiset taken three at a time. If you have to express N as the coefficient or or (the choice is yours) in the expansion of one of

8a)

8b)

8c)

8d)

which one would you choose? Can you justify your choice without using the value of N?

9) A family of 3, another family of 2, and two bachelors go for a joy ride in a giant wheel in which there are three swings A, B, C. In how many ways can they be seated in the swings (assuming there are sufficient number of seats in each swing) if the families are to be together? List all the ways.

10) n lines in a plane are in general position, that is, no two are parallel and no three are concurrent. What is the number of regions into which they divide the plane?

11) If is a sequence of numbers satisfying , find , given that and .

12) If is the number of ways in which we can place parentheses to multiply the n numbers on a calculator, find in terms of the ‘s where .

13) A graph is a set V of vertices a, b, c, , together with a set of edges . If is considered the same as , we say this graph is undirected. Otherwise, the graph is said to be directed, and we say ‘(a,b) has a direction from a to b’. The edge is called a loop. The graph is said to be of order .

If the edge-set E is allowed to be a multiset, that is, if an edge is allowed to occur more than once (and this may be called a ‘multiple edge’), we refer to the graph as a general graph.

and denote the numbers of undirected (respectively,directed) loopless graphs of order 5, with n edges, none of them a multiple edge, find the series and .

Cheers,

Nalin Pithwa.

Question 1:

Consider the eight-digit bank identification number , which is followed by a ninth check digit chosen to satisfy the congruence

(a) Obtain the check digits that should be appended to the two numbers 55382006 and 81372439.

(b) The bank identification number has an illegitimate fourth digit. Determine the value of the obscured digit.

Question 2:

(a) Find an integer having the remainders 1,2,5,5 when divided by 2, 3, 6, 12 respectively (Yih-hing, died 717)

(b) Find an integer having the remainders 2,3,4,5 when divided by 3,4,5,6 respectively (Bhaskara, born 1114)

(c) Find an integer having remainders 3,11,15 when divided by 10, 13, 17, respectively (Regiomontanus, 1436-1476)

Question 3:

Question 3:

Let denote the nth triangular number. For which values of n does divide

Hint: Because , it suffices to determine those n satisfying

Question 4:

Find the solutions of the system of congruences:

Question 5:

Obtain the two incongruent solutions modulo 210 of the system

Question 6:

Use Fermat’s Little Theorem to verify that 17 divides

Question 7:

(a) If , show that . Hint: From Fermat’s Little Theorem, and

(b) If , show that divides

(c) If , show that

Question 8:

Show that and . Do there exist infinitely many composite numbers n with the property that and ?

Question 9:

Prove that any integer of the form is an absolute pseudoprime if all three factors are prime; hence, is an absolute pseudoprime.

Question 10:

Prove that the quadratic congruence , where p is an odd prime, has a solution if and only if .

Note: By quadratic congruence is meant a congruence of the form with . This is the content of the above proof.

More later,

Nalin Pithwa.

*Fermat’s Little Theorem:*

The fact that there are only a finite number of essentially different numbers in arithmetic to a modulus m means that there are algebraic relations which are satisfied by every number in that arithmetic. There is nothing analogous to these relations in ordinary arithmetic.

Suppose we take any number x and consider its powers . Since there are only a finite number of possibilities of these to the modulus m, we must eventually come to one which we have met before, say , where . If x is relatively prime to m, the factor can be cancelled, and it follows that , where . Hence, every number x which is relatively prime to m satisfies some congruence of this form. The least exponent l for which will be called the order of x to the modulus m. If x is 1, its order is obviously 1. To illustrate the definition, let us calculate the orders of a few numbers to the modulus 11. The powers of 2, taken to the modulus 11, are

2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4,

Each one is twice the preceding one, with 11 or a multiple of 11 subtracted where necessary to make the result less than 11. The first power of 2 which is is , and so the order of is 10. As another example, take the powers of 3:

3, 9, 5, 4, 1, 3, 9,

The first power of 3 which is equivalent to 1 is , so the order of is 5. It will be found that the order of 4 is again 5, and so also is that of 5.

It will be seen that the successive powers of x are periodic; when we have reached the first number l for which , then and the previous cycle is repeated. It is plain that if and only if n is a multiple of the order of x. In the last example, if and only if n is a multiple of 5. This remains valid if n is 0 (since 3^{0} = 1), and it remains valid also for negative exponents, provided , is interpreted as a fraction (mod 11) in the way explained earlier (an earlier blog article).

In fact, the negative powers of 3 (mod 11) are obtained by prolonging the series backwards, and the table of powers of 3 to the modulus 11 is:

Fermat discovered that if the modulus is a prime, say p, then every integer x not congruent to 0 satisfies

….call this as equation A.

In view of what we have seen above, this is equivalent to saying that the order of any number is a divisor of . The result A was mentioned by Fermat in a letter to Frenicle de Bessy of 18 October 1640, in which he also stated that he had a proof. But, as with most of Fermat’s discoveries, the proof was not published or preserved. The first known proof seems to have been given by Leibniz (1646-1716). He proved that , which is equivalent to A, by writing x as a sum of x units (assuming x positive), and then expanding by the multinomial theorem. The terms give x, and the coefficients of all the other terms are easily proved to be divisible by p.

Quite a different proof was given by Ivory in 1806. If , the integers

are congruent in some order to the numbers

.

In fact, each of these sets constitutes a complete set of residues except that 0 (zero) has been omitted from each. Since the two sets are congruent, their products are congruent, and so

Cancelling the factors 2, 3, ….(p-1), as is permissible we obtain the above relation A.

One merit of this proof is that it can be extended so as to apply to the more general case when the modulus is no longer a prime.

The generalization of the result A to any modulus was first given by Euler in 1760. To formulate it, we must begin by considering how many numbers in the set 0, 1, 2, …, (m-1) are relatively prime to m. Denote this number by . When m is a prime, all the numbers in the set except 0 (zero) are relatively prime to m, so that for any prime p. Euler’s generalization of Fermat’s theorem is that for any modulus m,

…relation B

provided only that x is relatively prime to m.

To prove this, it is only necessary to modify Ivory’s method by omitting from the numbers not only the number 0, but all numbers which are not relatively prime to m. These remain numbers, say

, where .

Then, the numbers

are congruent, in some order, to the previous numbers, and on multiplying and cancelling (as is permissible) we obtain , which is relation B.

To illustrate this proof, take . The numbers less than 20 and relatively prime to 20 are :

1, 3, 7, 9, 11, 13, 17, 19.

So that . If we multiply these by any number x which is relatively prime to 20, the new numbers are congruent to the original numbers in some other order. For example, if x is 3, the new numbers are congruent respectively to

;

and the argument proves that .

**Reference:**

- The Higher Arithmetic, H. Davenport, Eighth Edition.
- Elementary Number Theory, Burton, Sixth Edition.
- A Friendly Introduction to Number Theory, J. Silverman

Shared for those readers who enjoy expository articles.

Nalin Pithwa.

**Question 1:**

Prove that if n is an even integer, then

**Question 2:**

If , , , …. are the coefficients in the expansion of , when n is a positive integer, prove that

(a)

(b)

(c) , or , according as n is odd or even.

**Question 3:**

If denotes the sum of the first n natural numbers, prove that

(a)

(b)

**Question 4:**

If , prove that

(a)

(b) .

**Question 5:**

Find the sum of the products, two at a time, of the coefficients in the expansion of , where n is a positive integer.

**Question 6:**

If , where n and p are positive integers, and , a proper fraction, show that .

**Question 7:**

If , , , …,, are the coefficients in the expansion of , where n is a positive integer, show that

.

*That’s all for today, folks!*

*Nalin Pithwa.*