# motivation for Math

# You and your research or you and your studies for competitive math exams

# Number theory : A set of friendly examples

**Even and odd numbers**

Two whole numbers are added together. If their sum is odd, which statements below are

always true? Which are always false? Which are sometimes true and sometimes false?

1 Their quotient is not a whole number.

2 Their product is even.

3 Their difference is even.

4 Their product is more than their sum.

5 If 1 is added to one of the numbers and the product is found, it will be even.

**The Collatz conjecture**

Choose any whole number to start with.

If it is odd, multiply it by 3 and then add 1.

If it is even, divide it by 2. Then repeat this process on the number just obtained. Keep repeating the procedure.

For example, if you start with 58, the resulting chain of numbers is

58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, 4, 2, 1, …

The Collatz conjecture, made by Lothar Collatz in 1937, claims that, if you repeat this

process over and over, starting with any whole number greater than zero, eventually you will finish up with the sequence … 4, 2, 1, 4, 2, 1.

A conjecture is a statement that is thought to be true but has not been proved mathematically to be true for all cases. Although the Collatz conjecture has been shown to work − often very quickly − for many whole numbers, there are some quite small numbers that take a very long time to come down to … 4, 2, 1, 4, 2, 1.Apply this process to all the whole numbers greater than zero and less than or equal to 30.

For each one, find:

• how many steps it takes to reach 1 the frst time

• the largest number in the sequence. (For the sequence above, 58 takes 19 steps and reaches a maximum of 88.)

Look for shortcuts and work with a partner if you like.

**Long division**

Here is a way to check how good your long division skills are. If you are able to follow it

through and get to the end without making a mistake, you can consider yourself a qualiꏨed long division champion.

• Start with any two-digit number (for example, 58). Write it three times so that a six-digit number is formed (585 858).

- Divide this number by 21. There should not be any remainder. If there is, try and find out where you made your mistake and fix it.

• Now divide this new four- or possibly five-digit number by 37. Once again, there should be no remainder.

• Finally, divide this number − which should by now have only three or four digits − by 13.

You will know if you got it right by looking at the number you are left with.

Explain why this exercise works.

(Doing any of this exercise on a calculator is still interesting but is de뀠nitely wimping out!)

**Totient numbers**

1 A totient number is the number of fractions between 0 and 1 (not including 0 or 1) for

a given denominator that cannot be reduced to a simpler equivalent fraction. The totient

number of 2 is 1, since we have ; of 3 it is 2, since we have and ; and of 4 it is also 2, since we have

and ( can be reduced to ). The totient number of 5 is 4, since we have , , , ; and of 6 it is 2, since we have and

. Find the totient numbers forall denominators up to 12.

2 For any denominator n, there are n fractions between 0 and 1 (including 0 but not 1). Of

these fractions, some will be counted towards the totient number of n, but others will

cancel down and count towards the totient number of one of the factors of n. Using this

information and the totient numbers from the previous question, calculate the totient

numbers for 15, 18, 20 and 24.

3 The totient number is related to the prime factors of the original number, since these will

determine which fractions can be cancelled. Using this information, calculate the totient numbers of 72, 81, 98 and 100.

Without using a calculator, can you say which of this set of numbers could not be square numbers?

8116801, 251301659, 3186842, 20720704.

You can just by checking the last digit (units digit) of each number.

Do a bit of experimentation with a calculator and find the four digits that square numbers end in. (This eliminates the third number in this set).

Now check out the pairs of digits that your odd square numbers end with. What digits are possible in the tens position of an odd square number? (This number eliminates the second number in the set).

Complete these sentences with what you have discovered:

* In a square number, the last digit (units digit) can only be _____, _______, _______, _______, _______ or _______.

* The second last digit (tens place) of an odd square number is always _______.

Cube numbers behave rather differently.

A bit of experimentation will show that cube numbers can end in ANY digit (units place). This digit depends on the last digit (units place) of the original number being cubed.

Complete this table:

Fourth powers are in fact just square numbers that have been squared. For example, .

Since and , the last digit of a fourth power can only be 0, 1, 5 or 6.

Fifth powers have a magic of their own. Do a bit of experimentation to find out what it is. In p, particular, I suggest you create tables of second powers, third powers, fourth powers and fifth powers of all numbers from zero to 20. Check, compare…actually, it is fun to “compare rate of growth of powers with increasing integers”…this idea involves rudimentary ideas of calculus…

An odd number can usually be written as a sum of a prime number and another number, which is a power of two. This is true for all odd numbers greater than one but less than 100.

For example, if we choose 23, we can say that it is equal to . There is one more way to represent 23: it is . So, there are two ways to represent 23 as a sum of a prime number and a power of two. But, and do not work as both 21 and 15 are not prime numbers.

Some odd numbers like this can be expressed in many ways.

Try to find various representations as sum(s) of prime number and a power(s) of two of the following integers: 45, 29, 59, 95.

If you are adventurous or courageous, try to find such representations of all odd numbers lying from 1 to 100. You need a lot of patience and stamina and grit…but you will develop an “intuitive feel or tactile feel for numbers”…that’s the way math begins…

There are some odd numbers which cannot be expressed as a sum of a prime number and a power of two. Such numbers are called .

An example of an obstinate number is as the working below shows:

The next power of 2 is , which is clearly greater than 251. Hence, 251 is an obstinate number.

In fact, 251 is the third obstinate number. The first two lie between 100 and 150. Find these two odd numbers keeping track of how you eliminated the other twenty three odd numbers between 100 and 150.

.

Making a list of the powers of two up to might be a good place to start with. Look for short cuts and patterns as you proceed further.

Have fun with numbers !!

Regards,

Nalin Pithwa.

# Axiomatic Method : A little explanation

I) Take an English-into-English dictionary (any other language will also do). Start with any word and note down any word occurring in its definition, as given in the dictionary. Take this new word and note down any word appearing in it until a vicious circle results. Prove that a vicious circle is unavoidable no matter which word one starts with , (Caution: the vicious circle may not always involve the original word).

For example, in geometry the word “point” is undefined. For example, in set theory, when we write or say : ; the element “a” ‘belongs to’ “set A” —- the word “belong to” is not defined.

So, in all branches of math or physics especially, there are such “atomic” or “undefined” terms that one starts with.

After such terms come the “axioms” — statements which are assumed to be true; that is, statements whose proof is not sought.

The following are the axioms based on which equations are solved in algebra:

- If to equals we add equals, we get equals.
- If from equals we take equals, the remainders are equal.
- If equals are multiplied by equals, the products are equal.
- If equals are divided by equals (not zero), the quotients are equal.

More later,

Nalin Pithwa.

# Check your mathematical induction concepts

Discuss the following “proof” of the (false) theorem:

If n is any positive integer and S is a set containing exactly n real numbers, then all the numbers in S are equal:

PROOF BY INDUCTION:

Step 1:

If , the result is evident.

Step 2: By the induction hypothesis the result is true when ; we must prove that it is correct when . Let S be any set containing exactly real numbers and denote these real numbers by . If we omit from this list, we obtain exactly k numbers ; by induction hypothesis these numbers are all equal:

.

If we omit from the list of numbers in S, we again obtain exactly k numbers ; by the induction hypothesis these numbers are all equal:

.

It follows easily that all numbers in S are equal.

*************************************************************************************

Comments, observations are welcome 🙂

Regards,

Nalin Pithwa

# Patterns in the primes: Clay Math, James Maynard, 2015

(shared from Clay Math website and shared for my readers. Many thanks to James Maynard and Clay Math :-))

# Check your talent: are you ready for math or mathematical sciences or engineering

At the outset, let me put a little sweetener also: All I want to do is draw attention to the importance of symbolic manipulation. If you can solve this tutorial easily or with only a little bit of help, I would strongly feel that you can make a good career in math or applied math or mathematical sciences or engineering.

On the other hand, this tutorial can be useful as a “miscellaneous or logical type of problems” for the ensuing RMO 2019.

I) Let S be a set having an operation * which assigns an element a*b of S for any . Let us assume that the following two rules hold:

i) If a, b are any objects in S, then

ii) If a, b are any objects in S, then

Show that S can have at most one object.

II) Let S be the set of all integers. For a, b in S define * by a*b=a-b. Verify the following:

a) unless .

b) in general. Under what conditions on a, b, c is ?

c) The integer 0 has the property that for every a in S.

d) For a in S,

III) Let S consist of two objects and . We define the operation * on S by subjecting and to the following condittions:

i)

ii)

iii)

Verify by explicit calculation that if a, b, c are any elements of S (that is, a, b and c can be any of or ) then:

i)

ii)

iii)

iv) There is a particular a in S such that for all b in S

v) Given , then , where a is the particular element in (iv) above.

This will be your own self-appraisal !!

Regards,

Nalin Pithwa