Showing posts with label digits. Show all posts
Showing posts with label digits. Show all posts

Sunday, January 1, 2017

[Enrich20170101SQT] Calculating Square Roots by Hand

Introduction
          Happy New Year to our readers!  I wish this year will be a fruitful one for everybody.
          Today, I will illustrate how to calculate square roots by hand, using  54 756  as an example.  It is similar to long division, but has some modifications.

Solution


          Starting from the right, pair up the digits.


          2×2 = 4  is the nearest perfect square to  5.  Subtract and bring down the next two digits, giving  147.


          Double the digit  2  to get  4.  Think:  ? × 4?  gives  147  or nearest possible value.  We have 3×43 = 129.


          Subtracting and bringing down the next two digits gives  1856.  Replicate the digit  4  on the left and double the digit  3,  giving  46.

          Now think:  ? × 46?  gives  1856  or nearest possible value.  It turns out that  4 × 464 gives exactly  1856.  We are done!  The square root of  54 756  is  234.

How does it work?

          This relies on the algebraic identity  (10a + b)² = 100a² + 20ab + b², the right-hand expression is equal to   100a² + (20a + b)b.  For example, at stage 4, we have  a = 23,  b = 4  and  (20a + b) = 464.
          Did you learn something today?



Monday, November 16, 2015

[NumTh Expository] The Principle Behind Casting Out Nines

Introduction
Think of a number ... say 685932.  Divide by  9  and take the remainder.
     685932 ¸ 9      = 76214 r 6 
Add up the digits,  divide by  9  and take the remainder.
     6+8+5+9+3+2 = 33 ¸ 9 = 3 r 6 

What do you notice?  Try this with any other positive whole number.

Discussion
     Did you see that a number and its sum of digits always have the same remainder when divided by  9?  This is the principle behind the method of “casting out nines”, used in the past for checking arithmetical calculations.  Why does this work?  Where is its magic?
     The decimal number system that we use today is based on the number  10, which is just  1  larger than  9.  Observe that  9, 99, 999, 9 999, 99 999, ... etc are all divisible by  9.  Hence, the powers of 10, namely 100 = 1,  101 = 10,  102 = 100,  103 = 1 000,  104 = 10 000,  105 = 100 000,  etc  all leave a remainder of  1  when divided by  9.   Thus in our example,
     685932 = 6´105 + 8´104 + 5´103 + 9´102 + 3´101 + 2´1
                  = 6´(99999+1) + 8´(9999+1) + 5´(999+1) + 9´(99+1) + 3´(9+1) + 2´1
                  = 6´99999+8´99995´999+9´993´9 + 6´1+8´1+5´1+9´1+3´1+2´1
                  = 9 ´ something + 6+8+5+9+3+2
As you can see, all the “´1” allow us to separate out the digits, and then the stuff with 9, 99, 999 etc can be lumped together as 9 ´ some whole number, but we do not need to care too much about this multiple of 9 as it would not make any difference to the remainder.  It is now obvious that  685932 and 6+8+5+9+3+2=33 will have the same number when divided by 9.
     Let us generalise the argument.   If two numbers  x  and  y  have the same remaider when divided by 9,  we say that  x  and  y  are congruent modulo 9, and we write     x  º  y  (mod 9).  Congruence is an equivalence relation and “º” behaves in many ways similar to “=”.

Theorem
For an arbitrary number  n   with digits  [dk...d3d2d1d0]
                                        n º dk + ... + d3 + d2 + d1 + d0   (mod 9)
                 n = dk ´104 + ... + d3´103 + d2´102 + d1´10 + d0.    
Since  10k º 1 (mod 9)  for all integers  k > 0,  we have
                 n º dk´1 + ... + d3´1 + d2´1 + d1´1 + d0
                 n º    dk  + ... +   d3   +    d2  +   d1    + d0     (mod 9).   © (Q.E.D.)

As an example of application of this principle, please refer read thisarticle.

Suitable Levels
Primary School Mathematics Olympiad
* syllabuses that involve congruences and Number Theory
* anybody who is interested





Thursday, November 5, 2015

[OlymPri20151105NTC9] An x to Find by Casting Out Nine

Question

In class, John was thinking of a 6-digit number, A.  He added up all the digits and got the result, B.  Then, he subtracted  B  from  A, which gave a result, another 6-digit number, whose digits consist of 0, 2, 4, 6, 8 and  x.  Find a possible answer for  x.

Introduction
     This problem looks mind-boggling.  There are so many possible 6-digit numbers and there seems to be no clue as to how to even begin.  This problem hinges on a forgotten fact that many people used to learn when electronic calculators were not so prevalent.

Old Wine Most Fine
     It is a fact that any number is equivalent to its sum ofdigits in the sense that they both have the same remainder when divided by 9.  (see this article)  This is the principle behind the method of “casting out nines”, used in the past for checking arithmetical calculations.  Mathematics is never out-dated.  In fact, some of the old forgotten theory may sometimes turn out surprisingly useful.  If two numbers  x  and  y  have the same remaider when divided by 9,  we can write  x  º  y  (mod 9)  but in this article, I shall just write  x º y.  If   x º 0,  it just means that  x  has no remainder when divided by  9  i.e.    x  is a multiple of  9.

Solution
     Since                             A º B      where  B = sum_of_digits(A),
                                    AB º 0
             sum_of_digits(AB) º 0
           0 + 2 + 4 + 6 + 8 + x  º 0
                                  20 + x  º[ 20 + x  is a multiple of  9]
                                     \  x  º 7  [x  is a digit & the next higher multiple of  9  is 27]

Remark
     One possible value of  A  is  864738.  Then  AB = 864738 – 36 = 864702

H04. Look for pattern(s)
H05. Work backwards
H09. Restate the problem in another way
H13* Use Equation / write a Mathematical Sentence

Suitable Levels
Primary School Mathematics Olympiad
* syllabuses that involve congruences and Number Theory
* anybody who is interested





Monday, March 16, 2015

[#Critique] Is #pi #infinite?

Article / Resource
The infinite life of pi - Reynaldo Lopes



My Comments
This is a well-produced video in which the team took great care in producing an interesting narrative.  The circles were drawn imperfect and shaky, so as to catch the attention of viewers and to highlight them.  A couple of points they missed out:-

1) p being irrational, does not only have an infinite number of digits in its decimal expansion, the digits are also non-repeating.  A rational number (fraction) like 1/7 also has an infinite number of digits, but they repeat: 1/7 = 0.142857 142857 142857 ...

2) near the end of the video, the animators depicted universe < p.  I find the artistic licence disturbing.  I am sure there is some way to artistically depict the known universe having less number of atoms than number of digits of p.

To answer the question in the title of this article "Is p infinite?": No, but her number of decimal digits is.