{VERSION 6 0 "IBM INTEL NT" "6.0" } {USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 1 0 0 0 0 1 }{CSTYLE "2D Math" -1 2 "Times" 0 1 0 0 0 0 0 0 2 0 0 0 0 0 0 1 }{CSTYLE "2D Output" 2 20 "" 0 1 0 0 255 1 0 0 0 0 0 0 0 0 0 1 } {PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Maple Output" 0 11 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }3 3 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 11 12 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }1 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 0 256 1 {CSTYLE "" -1 -1 "Courier" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 0 257 1 {CSTYLE "" -1 -1 "Courie r" 1 10 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 } {PSTYLE "" 0 258 1 {CSTYLE "" -1 -1 "Courier" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }} {SECT 0 {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}{EXCHG {PARA 0 " " 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 105 "About the tuition problem: How do deal the input \"in-state\" and \"out-state\". See \+ the following example:" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 48 "Input A and B: A is either \"McCain\" or \"Obama\" " }}{PARA 0 "" 0 "" {TEXT -1 52 " B is eithe r \"vp\" or \"age\"" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 " " {TEXT -1 28 "Output: answer the question" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 256 "" 0 "" {TEXT -1 500 "Elec := proc( A, B )\n\n \+ if A = \"McCain\" then\n if B = \"vp\" then\n return \"P alin\";\n elif B = \"age\" then\n return 72;\n else \n return \"The second input must be vp or age\"\n end if \n elif A = \"Obama\" then\n if B = \"vp\" then\n retur n \"Biden\";\n elif B = \"age\" then\n return 48;\n \+ else\n return \"The second input must be vp or age\"\n en d if\n else\n return \"The first input must be McCain or Obama \";\n end if;\n\nend proc;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "read(\"e:/elec.txt\"):" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 21 "Elec(\"McCain\",\"age\");" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"# s" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 19 "Elec(\"Obama\",\"vp\") ;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#Q&Biden6\"" }}}{EXCHG {PARA 0 "> \+ " 0 "" {MPLTEXT 1 0 20 "Elec(\"obama\",\"age\");" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#QHThe~first~input~must~be~McCain~or~Obama6\"" }}} {EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 29 "Ab out the leap year problem. " }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 11 "Example: " }}{PARA 0 "" 0 "" {TEXT -1 0 "" }} {PARA 0 "" 0 "" {TEXT -1 49 "Leap years: 1748, 1600, 2000, 1300 (befo re 1752)" }}{PARA 0 "" 0 "" {TEXT -1 26 "Not leap year: 1746, 1700" } }{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 57 "There ar e following questions to be asked (may be nested)" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 25 "1. before 1752, or after? " }}{PARA 0 "" 0 "" {TEXT -1 18 "2. year mod 4 = 0?" }}{PARA 0 "" 0 " " {TEXT -1 21 "3. year mod 100 = 0 ?" }}{PARA 0 "" 0 "" {TEXT -1 21 "4 . year mod 400 = 0 ?" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 " " {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 48 "General issues about programming and this course" }} {PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 15 "About Mat h 340:" }}{PARA 0 "" 0 "" {TEXT -1 54 "1. You must spend time after c lass to do programming." }}{PARA 0 "" 0 "" {TEXT -1 70 "2. A good pra ctice is to close the book and rewrite example programs." }}{PARA 0 " " 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 27 "General programmin g issues:" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 43 "1. First of all: Know your input and output" }}{PARA 0 "" 0 "" {TEXT -1 44 "2. Never alter the input inside the program" }}{PARA 0 " " 0 "" {TEXT -1 35 " ... := proc( a, b, ... )" }}{PARA 0 "" 0 "" {TEXT -1 18 " ..." }}{PARA 0 "" 0 "" {TEXT -1 34 " \+ a := ... # bad!!" }}{PARA 0 "" 0 "" {TEXT -1 58 "3. W rite program following the required indentation rules." }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 2 " " }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "> \+ " 0 "" {MPLTEXT 1 0 12 "isprime(31);" }}{PARA 11 "" 1 "" {XPPMATH 20 " 6#%%trueG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "isprime(33);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#%&falseG" }}}{EXCHG {PARA 0 "> " 0 " " {MPLTEXT 1 0 79 "for k from 1 to 100 do\n if isprime(k) then\n \+ print(k);\n end if;\nend do;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 1 " " }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"#" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"$" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }} {PARA 11 "" 1 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 83 "for k from 1 by 2 to 20 do\n if isprime(k) then\n print(k );\n end if;\nend do;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"$" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"(" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#6" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#8" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#<" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#>" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 84 "for k from 19 by -2 to 1 do\n if isprime(k) then\n prin t(k);\n end if;\nend do;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#>" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#\"#<" }}{PARA 11 "" 1 "" {XPPMATH 20 " 6#\"#8" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"#6" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"(" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"$" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 257 "" 0 "" {TEXT -1 329 "PrimeList := proc( m, # starting integer\n n # ending integer\n \+ )\n local p, k, c;\n\n c := 0; # initialize the counter \n for k from m to n do\n if isprime(k) then\n c := c + 1; # increase the counter by 1\n p[c] := k;\n end if; \n end do;\n\n return p, c;\nend proc;" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "read(\"e:/PrimeLi st.txt\");" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#>%*PrimeListGf*6$%\"mG% \"nG6%%\"pG%\"kG%\"cG6\"F-C%>8&\"\"!?(8%-%%ceilG6#9$\"\"\"-%&floorG6#9 %%%trueG@$-%(isprimeG6#F3C$>F0,&F0F8F8F8>&8$6#F0F3O6$FGF0F-F-F-" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 25 "p, c := PrimeList(1,100);" } }{PARA 11 "" 1 "" {XPPMATH 20 "6#>6$%\"pG%\"cG6$%\"pG\"#D" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "p[1];" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "p[2];" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"$" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "p[3];" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"&" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "seq( p[j], j=1..c );" }} {PARA 12 "" 1 "" {XPPMATH 20 "6;\"\"#\"\"$\"\"&\"\"(\"#6\"#8\"#<\"#>\" #B\"#H\"#J\"#P\"#T\"#V\"#Z\"#`\"#f\"#h\"#n\"#r\"#t\"#z\"#$)\"#*)\"#(* " }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 28 "q, d := PrimeList(1.5,3 4.2);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>6$%\"qG%\"dG6$%\"pG\"#6" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 17 "seq(q[j],j=1..d);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6-\"\"#\"\"$\"\"&\"\"(\"#6\"#8\"#<\"#>\"#B\"#H \"#J" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 33 "p, c := PrimeList(P i,sqrt(1000));" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>6$%\"pG%\"cG6$%\"pG \"\"*" }}}{EXCHG {PARA 11 "" 1 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 36 "New version using \"ceil\" and \"floor\"" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 258 "" 0 "" {TEXT -1 342 "PrimeList := proc( \+ m, # starting integer\n n # ending integer\n \+ )\n local p, k, c;\n\n c := 0; # initialize the count er\n for k from ceil(m) to floor(n) do\n if isprime(k) then\n \+ c := c + 1; # increase the counter by 1\n p[c] := k; \n end if;\n end do;\n\n return p, c;\nend proc;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "ceil(Pi);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"%" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 27 "Example: Fibonacci numbers" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 20 "read(\"e:fi bon.txt\");" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#>%&FibonGf*6#%\"nG6$%\" FG%\"kG6\"F+C%>6$&8$6#\"\"!&F06#\"\"\"6$F2F5?(8%F5F5,&9$F5F5!\"\"%%tru eG>&F06#,&F8F5F5F5,&&F06#F8F5&F06#,&F8F5F5F;F5OF0F+F+F+" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 15 "G := Fibon(20);" }}{PARA 11 "" 1 " " {XPPMATH 20 "6#>%\"GG%\"FG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 23 "seq( G[j], j = 0..20 );" }}{PARA 12 "" 1 "" {XPPMATH 20 "67\"\"! \"\"\"F$\"\"#\"\"$\"\"&\"\")\"#8\"#@\"#M\"#b\"#*)\"$W\"\"$L#\"$x$\"$5' \"$()*\"%(f\"\"%%e#\"%\"=%\"%ln" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 123 "Homework: In addition to the tuit ion problem and the leap year problem, do Problem 4, page 47 (The sq uare root problem)" }}{PARA 0 "" 0 "" {TEXT -1 88 "Hint: It may be he lpful to read Example 4 program to see how to iterate two sequences. \+ " }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}}{MARK "28 2 0" 87 }{VIEWOPTS 1 1 0 3 2 1804 1 1 1 1 }{PAGENUMBERS 0 1 2 33 1 1 }