Upcoming SlideShare
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Standard text messaging rates apply

# Why recursion is impotant_new_my.docx

575

Published on

Importance of Recursion

Importance of Recursion

Published in: Education
0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
575
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
1
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Transcript

• 1. The Power of Recursion and Induction<br />In this brief we will focus on three domains to elaborate on the question of why teach recursion and induction: Within mathematics, in modeling, and in technology<br />
• Within mathematics
• 2. Concepts and processes already described in a recursive or inductive way.
• 3. Recursion is everywhere in mathematics. For example, the set of natural numbers is defined recursively. Some functions, such as the Ackermann function are also defined recursively. Recursion appears also in natural phenomena. For example, the Fibonacci numbers: F(n) = F(n − 1) + F(n − 2) and F(1) = 1 and F(2) = 1 appear in several biological settings. Recursion appears also in the school curriculum. It is often used in relation to teaching the topics of Mathematical Induction and Sequences. In some countries recursion has a substantial presence in the school curriculum; in others it is marginal. Contemporary technological tools make it easy to use recursion. Moreover, they enable the recursion process to become visible.
What is the area of the following shape (called the Koch snowflake) (r is the diameter of the circle)? <br />What is its perimeter?<br /> <br />This is a difficult problem to solve. <br />The following is a much easier problem. What is the area of this equilateral triangle (s being the length of its side)? <br />What is its perimeter?<br />How can solving the simple triangle problem help in solving the complex one? <br />If you remove the middle one-third of each side of the equilateral triangle and replace it with two segments congruent to the segment you removed you will get the shape below. Can you find its area and perimeter?<br />If you continue this inductive process you will produce the Koch snowflake in the complex problem after a final number of steps. It is clear now how to calculate its area and perimeter.<br />Recursion is a useful method for solving certain complex problems that we don’t know how to solve. It is useful in cases when we can transform a complex problem using successive steps to a simpler problem, which we know how to solve. Together with induction it allows us to move from a complex to a simple problem and then back to solving the complex problem. <br />There are several reasons for explicit uses of recursive thinking and mathematical induction in the mathematics curriculum. Among them is the fact that many of the topics we obtained from the mathematics curriculum lend themselves to recursive thinking. So, as a context, recursive thinking may be used to show coherence in the development of these topics. For example, sequences, series, and tessellations can be developed using recursive thinking to show how subsequent values are obtained from previous values. Also the financial markets, which are huge and impact on many lives, use some mathematics to make sense of these markets. These aspects of mathematics that include topics like annuity, mortgage, present value, future value, all yield themselves to recursive thinking. Consequently, these topics may be taught meaningfully by using recursive thinking processes. It is worth noting that relationships derived from how to generate subsequent values from previous values can be verified and proved by the process of mathematical induction to ensure that the relationships give reliable subsequent values, once the initial values are known.<br />
• Concepts and processes from other areas of mathematics, where recursion and induction can play an important role.
2 In modeling Per. <br />Dealing with recursion enhances focus on modelling and hence relational thinking. <br />Teaching recursion often takes the form of pupils having to find a recursive formula for a given problem e.g. number of diagonals in n-polygons. Used/taught this way, the process is actually a process of modelling the situation. The modelling process involves in general several stages, see (“Mathematical modelling and application”, W.Blum et al), but in particular one of the stages, “mathematization”, is often hard to do. This is the process where the students introduce the language of mathematics in order to solve the problem. There are two obvious benefits: one is that the hard job of mathematization is being emphasised and practiced, and the other is an aspect of mathematization: Relational thinking. In trying to identify and describe the main features of the exploited pattern focus is drawn to a deep understanding of what is going on and how it relates to the cognitional scheme already present in the students mind. <br />In technology:<br />Within the technology itself Noi<br />Using technology Technology (the case of spreadsheets) Per: <br />2908935216535When using a spreadsheet recursive processes will often occur. In the spreadsheet illustrated here, there are three recursive functions. We have, in column:<br />A: fn=fn-1+1 <br />B: fn=fn-1+300<br />C: fn=fn-1·1.03+300<br />Real life application:<br />A: years<br />B: total amount, without interest<br />C: total amount, with 3% interest per year.<br />3480435294005The Fibonacci-sequence fn+2=fn+1+fn can easily be unfolded in a spreadsheet.<br /> <br />Note that, by definition:<br />A1=1<br />A2=1<br />Another example of recursive functions in spreadsheets: <br />Consider the population number in year n (Pn) as a function of the population number in year n-1 (Pn-1), plus the number of newborns (the rate b·Pn-1), minus the number of deaths (using the rate d· Pn-1) plus the net immigration (in absolute numbers). Analytically, this would be a rather complicated function, but described as a recursive process, it is straight forward from the model above:<br />This can be described by: Pn=Pn-1+b·Pn-1-d·Pn-1+I = Pn-1·(1+b-d)+I <br />85725036830<br />While the production of the Fibonacci numbers primarily will take place in a school context, the other examples could unfold in an everyday or professional context. There is very little doubt that the spreadsheet formulae that produces the numbers in the tables deals with recursivity, but an interesting question is, if the Spreadsheet users competence regarding these matters would be enhanced through training explicitly in the concept and notation of recursion. <br />If the answer is yes, and it is agreed that the use of spreadsheet is becoming a common thing all over the world, this offers a strong argument for the teaching of recursive functions.’<br />Conclusion Ruhama<br />Appendix: Recursion in school curriculum Mi yeong<br />#1<br />From the square, First remove 1/4 square and you repeat each step like figure.<br />Find the area of painted square. What’s nth term? <br />Step0123…n…Number of colored squares13927…3nColored area 13/49/1627/64…3n/4n<br />We can find without counting.<br />It seems too complex, but if we use recursion, the problem is simpler.<br />As seen before, the number of colored squares is 1, 3, 9, 27, 81, ...<br />The recursive formula is: an+1 =an×3<br />Sure this problem seems to be trivial.<br />But the problem of finding the colored area as a fraction of the original square is more complex.<br />We think together one square’s area and square’s number. So this problem is why we use recursion.<br />1, 3/4, 9/16, 27/64, …<br /> This is an+1 =an×3/4<br />The use of recursion is simplified the complex problem.<br />#2. <br />By using sticks, we can make hexagon-pole(6-pole).<br />We can use the hexagon-pole(6-pole) to build more complex conglomerates as shown below. What is the number of sticks needed to build the 20th conglomerate? And what is the number of sticks needed to build the nth conglomerate? <br />If we count the number of sticks, <br />Conglomerate1234…Number of sticks184376117<br />It seems too complex, but if we use recursion, solving the problem becomes easier .<br />a2=a1+25<br />a3=a2+33<br />a4=a3+41<br />…<br />25, 33, 41, … <br />It is increasing by 8.<br />So the general term is 25+8(n-1)=8n+17<br />Thus, the recursion formula is an+1=an +8n+17<br />And the general term is an=4n2+13n+1 <br />#3. <br />You can think a right triangle that the length of side is a=5, b=4, c=3. And you can make square using two sides except the hypotenuse of a right-angled triangle like below. And we draw the similar right triangle like right triangle given at first. And repeat this process. Then what is the area of blue’s square? What is the area of green’s square? <br />the area of blue’s square<br />a1=32<br />a2=(5/9)2<br />…<br />Without special number, Let’s do like that. <br />a1=c2<br />a2=(c2/a)2<br />a3=(c3/a2)2<br />…<br />an+1=an× (ca)2<br />(Because the side’s recursive formula is bn+1=bn×ca, the recursive formula of area of rectangle is an+1=an× (ca)2.<br />The area of square is square of length.)<br />We can see the technology by Java(turtle) and GSP using recursion.<br /><turtle microworld> <br />http://www.javamath.com/class/<br />logo; system puzzle;<br />def phyt(a,n) {new;repeat 4 { pt; fd a ; rt 90 }; <br />paint yellow; tile random;<br />if (n>0) {fd a; rt 60;fd a*0.866 ;<br />phyt(a*0.5,n-1);fd -a*0.866; rt -90;<br />phyt(a*0.866,n-1);rt 30;fd -a;};}; <br />def p(n) {CLS;tt; window 85;line size, 10;<br />fd;tt 0,-35,90;phyt(20,n);but();}; <br />def aphyt(a,n) {repeat 4 { fd a ; rt 90 };<br />if (n>0) {fd a; rt 60;fd a*0.866 ; phyt(a*0.5,n-1);<br />fd -a*0.866; rt -90;phyt(a*0.866,n-1);rt 30;fd -a;} <br />else {};};<br />def ap(n) {cls;tt green;tt 0,-45,90;aphyt(20,n);};<br />def but() {button p(0) {0;-75,-47;black , 9 ; yellow,25};<br />button p(1) {1;-50,-47;black , 9 ; yellow,25};<br />button p(2) {2;-25,-47;black , 9 ; yellow,25};<br />button p(3) {3; 0,-47;black , 9 ; yellow,25};<br />button p(5) {5;25,-47;black , 9 ; yellow,25};<br />button p(7) {7;50,-47;black , 9 ; yellow,25};<br />button p(9) {9;75,-47;black , 9 ; yellow,25};<br />button kkk { click the yellow button written by mouse ;-70,-58;blue,0; white,0}; };<br />def pnamu() { point v_0,-65, 54; <br />label v_0 { gif(phytatree.gif)} };<br />p(1);<br />by Hanhyuk Cho, professor, Seoul university school<br /> <br />#4. <br />-30480522605Like figure, when regular hexagon is added and the points are increased, What is the number of nth points? <br />It’s difficult to find the general term. But we can find easier by using recursion<br />a1=6<br />a2=a1+2×4+1=6+9=15<br />a3=a2+3×4+1=6+9+13=28<br />a4=a3+4×4+1=6+9+13+17=45<br />…<br />2286035560<br />an=an-1+n×4+1= an-2+4(n-1)+1+4n+1=…=a1+9+13+17+…+4n+1<br />an=(n+1)(2n+1)<br />Proof by induction<br />a1=(1+1)(2+1)=6. True. <br />Suppose an is true.<br />an=6+9+13+17+…+4n+1=(n+1)(2n+1)<br />Then, <br />an+1=6+9+13+17+…+4n+1+4(n+1)+1<br /> =2n2+7n+6<br /> =(n+2)(2n+3)<br /> ={(n+1)+1}{2(n+1)+1}<br />This is true.<br />So this is correct by induction.<br />When we solve the difficult and complex problem, we can find the general term or any term by using the recursion. Recursion is available the thinking’s pattern that can move from large to small. <br />