{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 "" -1 256 "" 0 1 0 0 0 0 0 1 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 2 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 260 "" 0 1 0 0 
0 0 1 2 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 261 "" 0 1 0 0 0 0 0 2 0 0 0 0 
0 0 0 1 }{CSTYLE "" -1 262 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 }
{CSTYLE "" -1 263 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 
264 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 265 "" 0 1 0 0 
0 0 1 0 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 266 "" 0 1 0 0 0 0 0 0 0 0 0 0 
0 0 0 1 }{CSTYLE "" -1 267 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 }
{CSTYLE "" -1 268 "" 0 1 0 0 0 0 0 2 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 
269 "" 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 270 "" 0 1 0 0 
0 0 0 0 0 0 0 0 0 0 0 1 }{CSTYLE "" -1 274 "" 0 1 0 0 0 0 0 1 0 0 0 0 
0 0 0 0 }{CSTYLE "" -1 275 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 }
{CSTYLE "" -1 276 "" 1 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }{CSTYLE "" -1 
277 "" 1 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }{PSTYLE "Normal" -1 0 1 
{CSTYLE "" -1 -1 "Times" 1 12 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 "Heading 1" -1 3 1 {CSTYLE "" -1 -1 "Times
" 1 18 0 0 0 1 2 1 2 2 2 2 1 1 1 1 }1 1 0 0 8 4 1 0 1 0 2 2 0 1 }
{PSTYLE "Normal" -1 256 1 {CSTYLE "" -1 -1 "Times" 1 12 0 0 0 1 2 1 2 
2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }}
{SECT 0 {SECT 0 {PARA 3 "" 0 "" {TEXT -1 19 "Examen B de Maple. " }}
{PARA 3 "" 0 "" {TEXT -1 35 "Matem\341tica Discreta. Febrero 2005. " }
{TEXT 274 0 "" }}{PARA 0 "" 0 "" {TEXT 262 67 "Ingenier\355a T\351cnic
a en Inform\341tica de Sistemas (tarde) y de Gesti\363n." }}{PARA 0 "
" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT 263 13 "Ejercicio 1: " }
{TEXT 266 110 "Calcula el porcentaje de n\372meros entre 20.000 y 40.0
00 (ambos inclusive) que son relativamente primos con 24. " }}{EXCHG 
{PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}{PARA 0 "" 0 "" {TEXT -1 0 "" }
}{PARA 0 "" 0 "" {TEXT -1 0 "" }{TEXT 264 13 "Ejercicio 2: " }{TEXT 
267 191 "Tomamos una urna con 100 bolas y extraemos 7 bolas. Determina
 el n\372mero m\355nimo de bolas negras en la urna para que la probabi
lidad que las 7 olas extra\355das sean todas negras sea al menos 1/4.
" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}{PARA 0 "" 0 "" 
{TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }{TEXT 256 12 "Ejercicio
 3:" }{TEXT -1 6 "  Sea " }{TEXT 258 7 "G=(V,E)" }{TEXT -1 82 " el gra
fo no dirigido definido por la matriz de adyacencias B (ver fichero B.
mws)." }}{PARA 256 "" 0 "" {TEXT 261 16 "1) Verifica que " }{TEXT 260 
2 "G " }{TEXT 268 9 "es simple" }{TEXT 259 2 ". " }}{PARA 0 "" 0 "" 
{TEXT -1 78 "2) \277Cu\341ntos caminos de longitud 12 hay entre el pri
mer y el quinto v\351rtice de " }{TEXT 269 1 "G" }{TEXT -1 1 "?" }}
{PARA 0 "" 0 "" {TEXT -1 7 "3) \277Es " }{TEXT 265 2 "G " }{TEXT 270 
10 "euleriano?" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}{PARA 
0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT 275 12 "Ejercicio 4:" 
}{TEXT -1 57 " Calcula la matriz de la relaci\363n de equivalencia sob
re N" }{TEXT 276 1 "5" }{TEXT -1 17 "=\{1,2,...,5\} que " }{TEXT 277 
0 "" }{TEXT -1 119 "se obtiene calculando las clausuras reflexiva, sim
\351trica y transitiva de la relaci\363n definida por la  siguiente ma
triz:" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 97 "A:=matrix([[0, 1, 1, 1, 1]
, [1, 0, 0, 1, 0], [1, 0, 0, 1, 1], [1, 1, 1, 0, 0], [1, 0, 1, 0, 0]])
;" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}}
}{MARK "0 18 0" 0 }{VIEWOPTS 1 1 0 1 1 1803 1 1 1 1 }{PAGENUMBERS 0 1 
2 33 1 1 }