Showing posts with label arithmetic progression. Show all posts
Showing posts with label arithmetic progression. Show all posts

Friday, June 12, 2015

[H2_20150512SSSTRR] Finding a Recurrence Relation for Terms in a Series

Question

Introduction
     This question pertains to the relationship between the partial sums of a series and its terms.  I am not sure if all the junior colleges teach this explicitly, but students are expected to know or be able to observe this relationship.  Let us follow our nose and focus on the first part first.

Reminders
     For the series  u1 + u2 + ¼ + un–1 + un + ¼  ,  the nth partial sum
                    Sn = u1 + u2 + ¼ + un–1 + un
                 Sn–1 = u1 + u2 + ¼ + un–1
Taking the difference, we see that
                    un = SnSn–1
Innocuous looking, this is actually a very powerful formula.  It is applicable to all sequences and series (not only for arithmetic and geometric series).  That means this formula can always be used!
     Another thing to note is that sequences  un  and partial sums  Sn  (which are themselves another sequence) behave like functions.  [In advanced mathematics, they are in fact defined as functions with domain as the positive integers.]  What this means is that  Sn-1  has the same formula as  Sn  except that  n  is replaced with  (n – 1). 

Solution

Checking
     Actually, the question setter forgot that the formula works for  n > 1. 
     OK, let us check whether the formula really works.  We know that  u1 = 3.  Let us tabulate and compare the recursive formula with the explicit formula.  You can do this on a piece of rough paper.

n
recursive
un = f(un–1)
explicit
un = 3´2n–1
1
u1 = 3
3´21–1 =  3
2
u2 = 2´  3   = 6
3´22–1 =  6
3
u3 = 2´  6  = 12
3´23–1 = 12
4
u4 = 2´12 = 24
3´24–1 = 24
5
u5 = 2´24 = 48
3´25–1 = 48

Challenge
     What if the question wanted a recurrence relation for  Sn?
  
H04. Look for pattern(s)
H13* Use Equation / write a Mathematical Sentence

Suitable Levels
GCE ‘A’ Levels, H2 Mathematics 
International Baccalaureate Mathematics 
* other syllabuses that involve sequences and series





Saturday, May 16, 2015

[H2_20150514GAS] Grouped Arithmetic Sequences

Question

Introduction
     This question, even though not the most difficult of its type, poses quite a challenge to many students.  Without the curly brackets, the sequence is just an ordinary arithmetic progression (AP) or arithmetic sequence.  Once the curly brackets are in, it messes up our mental schema.  We can no longer use the formulas for AP naïvely.
     Actually, we should never apply any mathematical formula blindly.  Neither we should be stuck with a literal interpretation of the symbols.  We should apply formulas according to their meaning.  For example, in the sum-of-an-AP formula                                       
the  n  represents the number of terms.  But the  n  as used in the question has a different meaning.  It means the set number.  The best students are able to observe this, and hold the difference in meanings in their heads when they apply the formulas.  This requires some mental effort.  It is easy to make a careless mistake if you lose your focus or concentration.  If you are not so confident of doing this mentally, and you want to play it safe, I would suggest that you use another set of symbols (say, capital letters)                                        .
You can also use subscript notations like  An  for the first member in set  n.

Observations
     Before trying to do anything.  It is always good to take a step back and make observations, and play with small numbers first.  Once you have observe the patterns, you can plan your strategy to tackle the question.

Solution

Remarks
     As you can see, the actual presentation of the solution is actually quite short.  But there is a lot of thinking behind it.  It is important to make observations, even if some of them seem unnecessary for this question.  This allows you to solve problems even more challenging than this.  For example, what if the bare sequence did not start from  1  and has a common difference more than  1? 
          {5},  {8,  11},  {14, 17, 20},  {23, 26, 29, 32},  ...
What if the bare sequence was a geometric progression?  Like this
          {1},  {2,  4},  {8, 16, 32},  {64, 128, 256, 512},  ...
What if the bare sequence was an arithmetic progression, but the number of terms in the sets follow a geometric progression?  Like this
          {3},  {5,  7},  {9, 11, 13, 15},  {17, 19, 21, 23,  25, 27, 29, 31},  ...
Happy figuring these out!

H04. Look for pattern(s)
H09. Restate the problem in another way
H11. Solve part of the problem
H13* Use Equation / write a Mathematical Sentence

Suitable Levels
GCE ‘A’ Levels, H2 Mathematics 
International Baccalaureate Mathematics 
* other syllabuses that involve arithmetic and geometric progressions


Thursday, May 14, 2015

[H2_SAJC2006PromoQ1] Skipping Terms in an Arithmetic Progression

Question

Introduction
     This difficult-looking question has become pretty standard already.  There are some principles that the schools may or may not teach explicitly, but they expect students to know.  Let us review some of these principles.

Reminders


Refer also to this article.




Solution

Summary
     Remember that when you apply a formula (e.g. like the formula for the sum of an AP), you need to apply it with the appropriate numbers substituted.  Do not get stuck with the letters.  They are not meant to be taken literally, but change according to the situation.  For example, the “d” in the later part is  4  but it is different than the  d = 2  in the earlier part.


H04. Look for pattern(s)
H09. Restate the problem in another way
H10. Simplify the problem
H11. Solve part of the problem
H12* Think of a related problem
H13* Use Equation / write a Mathematical Sentence

Suitable Levels
GCE ‘A’ Levels, H2 Mathematics 
International Baccalaureate Mathematics 
* other syllabuses that involve arithmetic and geometric progressions


[H2_ACJC2000P1Q15b] Adders use Logs to Multiply

Question

Introduction
     Here is a question on arithmetic progressions, and not the first question of its type.  As you know, the schools in Singapore mimic questions from the GCE ‘A’ Levels, as well as from one another.  Before we go into the solution, let us go through some things you need to know.

Prerequisites

Solution

Remarks
     You might observe that the argument of the logarithm,  pqn–1,  forms a geometric progression.  Indeed, any logarithm of a geometric progression will form an arithmetic progression.  However, this is not something that you should memorise.  Just stick to the basic principles and work it out.  Mathematics is not about memorisation.  It is about observing and understanding links between things.  If you want to memorise, ask: Why do adders like to live among logs?  Answer: That’s the way they multiplyJ

H04. Look for pattern(s)
H09. Restate the problem in another way
H10. Simplify the problem
H11. Solve part of the problem
H13* Use Equation / write a Mathematical Sentence

Suitable Levels
GCE ‘A’ Levels, H2 Mathematics 
International Baccalaureate Mathematics 

* other syllabuses that involve logarithms, arithmetic and geometric progressions




Monday, April 6, 2015

[OlympiadXPH20150405] Seats in a Hall as Pigeonholes?

Question
There are  25  rows of seats in a hall, each row having  30  seats.  If there are  680 people seated in the hall, at least how many rows have an equal number of people each?

Introduction
     This is a mathematics olympiad type of question for primary / elementary school, I believe.  Let us make sure we understand the question.  Each row of seats has a certain number of people, which I shall call the “headcount”.  We want all the headcounts to be as different as possible, and yet we do not want so many rows to have the same headcount.  The number of rows with the same headcount should be kept as low as possible.  How low is low?

Solution 1
     One strategy to solve this is to start filling up the empty seats with as many as possible.  Indeed this is the approach taken by the official “model answer”, which for copyright reasons I cannot show.  However I am going to do something even better: to explain the solution visually.  Recall that the sum of an arithmetic progression is 
                   ½ ´ number of terms ´ (first term + last term)
     After filling up the empty seats with different numbers of people, we would have filled up  30 + 29 + ... + 7 + 6 = ½ ´ 25 ´ (30 + 6) = 450  seats.  This is stage 1, shown in orangey-yellow in the diagram below.  We have now  230  people remaining to be seated. 

     For stage 2, we try to fill in the remaining seats with as many people as possible but keeping the headcounts all different.  So we ramp up  6 to 30,  7 to 29,  8 to 28, ... etc.  The additional number filled up is  24 + 22 + ... + 2 = ½ ´ 12 ´ (24 + 2) = 156.  This is stage 2, shown in green.  We have  74  seats remaining.
     For stage 3, we ramp up  18 to 30,  19 to 29,  20 to 28, ... etc.  The additional number filled up is  12 + 10 + ... + 2 = ½ ´ 6 ´ (12 + 2) = 42.  This is stage 3, shown in blue.  We have  32  seats remaining.
     For stage 4, we ramp up  19 to 30,  20 to 29,  21 to 28, ... etc.  The additional number filled up is  11 + 9 + 7 + 5 = 32.  We are done.  This is the final stage, shown in pink. 

Discussion
     It turns out that there is another way to look at the problem.  The above solution can be depicted in a “ball and bin diagram” as shown below.


There are  25  balls in the diagram, each representing a row’s headcount.  There are  4  rows with 30 people,  4 rows with 29 people, ...,  3 rows with 26 people,  3 rows with 25 people,  2 rows with 24 people, and  1 rows with 26 people.  We can actually calculate the totals for rows with repeated headcounts.  For example in the diagram, there are  4  layers of balls with each layer representing 30 + 29 + 28 + 27 (shown in dark turquoise) and the sum is = 4 ´ [½ ´ 4 ´ (30 + 27) ] = 456.  Those with rows with three of the same headcounts total up to  153  (shown in pink).  The rows with two of the same headcounts total up to  48  (shown in yellowish green).  There is one and only one row with  23  (shown in dirty green).  All this give a grand total of  680.  We can calculate the grand total  for every ball and bin diagram in this fashion.  We want a grand total of  680 and there must be 25 balls.  Using this diagram and a generalised version of the Pigeonhole Principle, we can have a very short and sweet solution.  Before that, let me briefly explain the Pigeonhole Principle.

     Let us say there are 30 pigeonholes and 31 envelopes.  We can represent this with a ball and bin diagram using 30 columns (for pigeonholes) and 31 balls (representing the envelopes).  If you try to put one envelope into each pigeonhole it is impossible.  One of the pigeonholes will have two envelopes.  In the ball and bin diagram, there will be at least column with two balls.  If you try to put everything flat to one layer, that is 30 balls and you still have one ball left.  You will have to put this remaining ball somewhere on the second layer.  This illustrates the Pigeonhole Principle.

     Likewise if you have  91  balls and  30 columns, there must be one column with  4  balls.  If it is all  3  balls, that fills with only 90 balls.  Your remaining ball has to go somewhere on the fourth layer.  This illustrates the Extended (or Generalised) Pigeonhole Principle.

Solution 2
     I am going to further extend the Pigeonhole Principle to Pigeonholes with Valuations (with some number attached to each configuration e.g. grand total).  We have 25 balls and 30 bins (columns) and we want to fill up the grand total number as quickly as possible achieving a grand total of  680, using as few layers as possible.


     Starting from  30  downwards and, using  3  layers,  we have  8  balls for each layer, filling all the colums for  30,  29,  ... ,  23.  We now have used up  3 ´ 8 = 24 balls that represents a grand total of  3 ´ [½ ´ 8 ´ (30 + 23) ] = 636.  There are 44 seats left over, but only one remaining ball.  The best we can do is to put the remaining ball at  22  for one layer.  That leaves  22 unallocated seats.  So  3  layers are not enough.  We need  4  layers.


     To show that  4  layers are enough, we can imagine filling up  4  layers of  30 + 29 + ... + 25.  That gives a grand total of  4 ´ [½ ´ 6 ´ (30 + 25) ] = 660,  with  20 left over.  This can be handled by putting the remaining ball on  20  for one layer.  And we are done.  The latter configuration is an alternative configuration to the one given in the model answer.  But most importantly, it works.  We have shown that at there must be least  4   rows with the same number of people each.  

Note
1.  There can be more than one set of  4  rows with the same number of people each, but we just need to show that there exists (one set or more of)  4   rows with the same headcounts.
2.  One can imagine configurations that have  5  rows with the same number each, but it would not be “least”.
3.  To answer the question in the title of this article, the seats are not the pigeonholes.  Rather, the pigeonholes (or bins, or columns) represent possible numbers of people in a row.  Each ball in bin  j  represents a row that has  j  people.

H02. Use a diagram / model
H03. Make a systematic list
H04. Look for pattern(s)
H05. Work backwards
H06. Use before-after concept
H07. Use guess and check
H08. Make suppositions
H09. Restate the problem in another way
H11. Solve part of the problem






Monday, March 30, 2015

[Pri20150303VSA] A way to Visualise Arithmetic Progressions

Question 
What is the sum of 25 + 26 + 27 + ......... + 189 ?

Introduction
     This is a problem meant to stretch the minds of Singapore primary (elementary) school pupils.  Adults (e.g. parents, teachers and tutors) trying to help out usually recommend doing this using the “rainbow” method (where a bunch of arcs are drawn joining 25 and 189, 26 and 188, 27 and 187 ... and so on, forming something that looks like rainbow), or the sum of arithmetic progression formula
          ½ ´ number of terms ´ (first term + last term)
which is usually taught at the junior college (pre-university) level.  Although correct, do the learners understand the logic behind them?

A Visual Method
     In my visual representation below, the answer pops out almost immediately and the reasoning is made apparent to the student.

     Imagine a series of vertical bars representing 25, 26, 27 ... up to 189 joined together forming a staircase (shown in orange).  Make a copy of this (shown in blue) and flip it around and join the two shapes together to form a rectangle.  Note that the width of this rectangle represents the number of terms 189 – 25 + 1 = 165, while the uniform height is in fact first term + last term = 189 + 25 = 214.  Taking the “area” of the rectangle and dividing by two, we get  17 655, an answer that would agree with those found using the previously mentioned methods.  The diagram above is a kind of proof without words”.