{VERSION 5 0 "IBM INTEL NT" "5.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 Comment" 2 18 "" 0 1 0 0 0 0 0 0 0 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 } {CSTYLE "" -1 256 "Geneva" 1 12 0 0 0 1 0 0 0 0 0 0 0 0 0 1 }{CSTYLE " " -1 257 "Times" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 258 " " 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 259 "" 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 }{PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "Geneva" 1 10 0 0 0 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 } {PSTYLE "Text Output" -1 6 1 {CSTYLE "" -1 -1 "Courier" 1 10 0 0 255 1 2 2 2 2 2 1 2 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "Maple Out put" -1 11 1 {CSTYLE "" -1 -1 "Geneva" 1 10 0 0 0 1 2 2 2 2 2 2 1 1 1 1 }3 3 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "R3 Font 0" -1 256 1 {CSTYLE " " -1 -1 "Monaco" 1 9 0 0 255 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "R3 Font 2" -1 257 1 {CSTYLE "" -1 -1 "Monaco" 1 9 255 0 0 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "R 3 Font 3" -1 258 1 {CSTYLE "" -1 -1 "Monaco" 1 9 255 255 0 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }{PSTYLE "R3 Font 0" -1 259 1 {CSTYLE "" -1 -1 "Monaco" 1 9 0 0 255 1 2 2 2 2 2 2 1 1 1 1 }3 1 0 0 0 0 1 0 1 0 2 2 0 1 }} {SECT 0 {EXCHG {PARA 259 "" 0 "" {TEXT 256 52 "TP7 FONCTIONS D\311FINI ES PAR UNE PROC\311DURE - CORRIG\311\n" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 1 "1" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 111 "f := proc (a,b)\n\011local k,p;\n \011p := 1; \n \011for k from a to b do \n \011\011 if isprime(k) then p := k*p fi od;\n\011p\n end:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 18 "f(1,100);f(100,1);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"FqgvJt9-JvC%=b%R'zc0B" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"\"\"" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 49 "f(a,b) est le pro duit des nombres premiers entre " }{TEXT 258 1 "a" }{TEXT -1 4 " et " }{TEXT 259 1 "b" }{TEXT -1 6 ", si " }{XPPEDIT 18 0 "a <= b;" "6#1%\" aG%\"bG" }{TEXT -1 2 " ." }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 1 "2" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 197 "diviseurs:=proc(n)\nlocal d, D;\n D:=NULL;\n for d to isqrt(n) \+ do if n mod d=0 then D := D,d,n/d fi od:\n \{D\}\nend:\n'diviseurs(120 )'=diviseurs(120);time(diviseurs(2^30));time(numtheory[divisors](2^30) );" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/-%*diviseursG6#\"$?\"<2\"\"\"\" \"#\"\"$\"\"%\"\"&\"\"'\"\")\"#5\"#7\"#:\"#?\"#C\"#I\"#S\"#gF'" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#$\"$d\"!\"$" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$\"\"!F$" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }} {PARA 0 "" 0 "" {TEXT -1 26 "Remarquer et expliquer le " }{MPLTEXT 1 0 18 "for d to isqrt(n) " }{TEXT -1 37 "ci-dessus, qui acc\351l\350re \+ la proc\351dure." }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 " " 0 "" {TEXT -1 1 "3" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 279 "f \+ := proc(n)\n local nombre, somme ;\n nombre := n;\n \+ somme := 0;\n while nombre > 0 do \n s omme := somme + irem(nombre,10)^3;\n nombre := iquo(nombre ,10);\n od;\n somme\n end:\n'f(310)'= f(310);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/-%\"fG6#\"$5$\"#G" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 54 "for n from 1 to 500 do if f( n)=n then lprint(n) fi od;" }}{PARA 6 "" 1 "" {TEXT -1 1 "1" }}{PARA 6 "" 1 "" {TEXT -1 3 "153" }}{PARA 6 "" 1 "" {TEXT -1 3 "370" }}{PARA 6 "" 1 "" {TEXT -1 3 "371" }}{PARA 6 "" 1 "" {TEXT -1 3 "407" }}} {EXCHG {PARA 11 "" 1 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT 257 1 "4 " }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 226 "f := proc(n)\n local \+ nombre, inverse ;\n nombre := n;\n inverse := 0;\n while nombre > 0 do \n inverse := 10*inverse + irem(nombre,10);\n nombre:=iquo (nombre,10); \n\011\011 od;\n inverse\nend:\n'f(1260)' =f(1260);\n" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/-%\"fG6#\"%g7\"$@'" }} }{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 113 "for a from 78 to 89 do b:= a;printf(`%a `,b); while b <> f(b) do b:=f(b)+b ;\n printf(`%a `,b) od : printf(`\\n`) od:" }}{PARA 6 "" 1 "" {TEXT -1 21 "78 165 726 1353 48 84 " }}{PARA 6 "" 1 "" {TEXT -1 33 "79 176 847 1595 7546 14003 44044 \+ " }}{PARA 6 "" 1 "" {TEXT -1 6 "80 88 " }}{PARA 6 "" 1 "" {TEXT -1 6 " 81 99 " }}{PARA 6 "" 1 "" {TEXT -1 11 "82 110 121 " }}{PARA 6 "" 1 "" {TEXT -1 7 "83 121 " }}{PARA 6 "" 1 "" {TEXT -1 11 "84 132 363 " }} {PARA 6 "" 1 "" {TEXT -1 11 "85 143 484 " }}{PARA 6 "" 1 "" {TEXT -1 16 "86 154 605 1111 " }}{PARA 6 "" 1 "" {TEXT -1 21 "87 165 726 1353 4 884 " }}{PARA 6 "" 1 "" {TEXT -1 3 "88 " }}{PARA 6 "" 1 "" {TEXT -1 224 "89 187 968 1837 9218 17347 91718 173437 907808 1716517 8872688 17 735476 85189247 159487405 664272356 1317544822 3602001953 7193004016 1 3297007933 47267087164 93445163438 176881317877 955594506548 180120000 2107 8813200023188 " }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 140 "89 est tr\350s long \340 se palindromiser, mai s 196 l'est encore plus ; on pense qu'il ne se palindromise jamais, ma is ce fait n'a pas \351t\351 prouv\351." }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 1 "5" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 105 "u:=proc(n ) local x,k;\n\011x:=a[n]:\n\011for k from n-1 to 0 by -1 do x:= a[k] \+ +1/x od;\n\011 x\n end:\n'u[5]'=u(5);\n" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/&%\"uG6#\"\"&,&&%\"aG6#\"\"!\"\"\"*&F-F-,&&F*6#F-F-*&F -F-,&&F*6#\"\"#F-*&F-F-,&&F*6#\"\"$F-*&F-F-,&&F*6#\"\"%F-*&F-F-&F*F&! \"\"F-FCF-FCF-FCF-FCF-" }}}{EXCHG {PARA 11 "" 1 "" {TEXT -1 0 "" }} {PARA 0 "" 0 "" {TEXT -1 0 "" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 52 "for k from 0 to 100 do a[k]:=2 od : x=evalf(u(100));" }{TEXT -1 0 "" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/%\"xG$\"+iN@9C!\"*" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 25 "x = 2 + 1 / x donc......" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 52 "for k from 0 to 100 do a[k]:=k od : y=evalf(u(100));" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#/%\"yG$\"+!eYx(p! #5" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 25 "x = 1 + 1 / x donc......" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 0 "" }}}}{MARK "2 1 0" 18 } {VIEWOPTS 1 1 0 1 1 1803 1 1 1 1 }{PAGENUMBERS 0 1 2 33 1 1 }