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.
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!)
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 !!
In order to solve the following tutorial sheet, it helps to solve/understand and then apply the following beautiful cyclic relations or identities:
(Note if these look new to you, then you need to check the truth of all them; if all are v v familiar to you, just go ahead and crack the tutorial sheet below):
Core Identities in Cyclic Expressions:
Solve or simplify the following:
I) Prove that every function can be represented as a sum of an even function and an odd function.
II)Let A, B, C be subsets of a set S. Prove the following statements and illustrate them with Venn Diagrams:
2a) The famous DeMorgan’s laws in their basic forms: and . Assume that both sets A and B are subsets of Set S. In words, the first is: union of complements is the complement of intersection; the second is: intersection of two complements is the complement of the union of the two sets.
Let us say that we need to prove: .
Proof: It must be shown that the two sets have the same elements; in other words, that each element of the set on LHS is an element of the set on RHS and vice-versa.
If , then and . This means that , and and . Since and , hence . Hence, .
Conversely, if , then and . Therefore, and . Thus, and , so that . QED.
III) Prove that if I and S are sets and if for each , we have , then .
It must be shown that each element of the set on the LHS is an element of the set on RHS, and vice-versa.
If , then and . Therefore, , for at least one . Thus, , so that .
Conversely, if , then for some , we have . Thus, and . Since , we have . Therefore, . QED.
IV) If A, B and C are sets, show that :
V) Let I be a nonempty set and for each let be a set. Prove that
5a) for any set B, we have :
5b) if each is a subset of a given set S, then
VI) Prove that if , , and are functions, then :
VII) Let be a function, let A and B be subsets of X, and let C and D be subsets of Y. Prove that:
7i) ; in words, image of union of two sets is the union of two images;
7ii) ; in words, image of intersection of two sets is a subset of the intersection of the two images;
7iii) ; in words, the inverse image of the union of two sets is the union of the images of the two sets.
7iv) ; in words, the inverse image of intersection of two sets is intersection of the two inverse images.
7v) ; in words, the inverse of the image of a set contains the set itself.
7vi) ; in words, the image of an inverse image of a set is a subset of that set.
For questions 8 and 9, we can assume that the function f is and a set A lies in domain X and a set C lies in co-domain Y.
8) Prove that a function f is 1-1 if and only if for all ; in words, a function sends different inputs to different outputs iff a set in its domain is the same as the inverse of the image of that set itself.
9) Prove that a function f is onto if and only if for all ; in words, the image of a domain is equal to whole co-domain (which is same as range) iff a set in its domain is the same as the image of the inverse image of that set.
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:
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:
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 !!
1) Determine whether the following functions are well-defined:
1a) defined by
1b) defined by
2) Determine whether the function defined by mapping a real number r to the first digit to the right of the decimal point in a decimal expansion of r is well-defined.
3) Apply the Euclidean algorithm to obtain GCD of and express it as a linear combination of 57970 and 10353.
4) For each of the following pairs of integers a and b, determine their greatest common divisor, their least common multiple, and write their greatest common divisor in the form for some integers x and y.
(a) a=20, b=13
(b) a=69, b=372
(c) a=792, b=275
(d) a=11391, b=5673
(e) a=1761, b=1567
(f) a=507885, b=60808
5) Prove that if the integer k divides the integers a and b then k divides for every pair of integers s and t.
6) Prove that if n is composite then there are integers a and b such that a divides ab but n does not divide either a or b.
7) Let a, b and N be fixed integers with a and b non-zero and let be the greatest common divisor of a and b. Suppose and are particular solutions to . Prove for any integer r that integers and are also solutions to (this is in fact the general solution).
8) Determine the value for each integer where denotes the Euler- function.
9) Prove the Well-Ordering Property of integers by induction and prove the minimal element is unique.
10) If p is a prime prove that there do not exist non-zero integers a and b such that (that is, is not a rational number).
11) Let p be a prime and . Find a formula for the largest power of p which divides (it involves the greatest integer function).
12) Prove for any given positive integer N there exist only finitely many integers n with where denotes Euler’s -function.
13) Prove that if d divides n then $latex \phi(d)$ divides where denotes Euler’s -function.
Hope this gives you some math meal to churn for the Pre RMO or PRMO or even the ensuing RMO of Homi Bhabha Science Foundation.
1) Solve in real numbers the system of equations:
Hints: do you see some quadratics ? Can we reduce the number of variables? …Try such thinking on your own…
2) Let be real numbers such that and . Prove that .
3) Let a, b, c be positive real numbers. Prove that