{"id":231,"date":"2014-12-01T21:05:22","date_gmt":"2014-12-01T23:05:22","guid":{"rendered":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/?page_id=231"},"modified":"2014-12-01T21:05:22","modified_gmt":"2014-12-01T23:05:22","slug":"matematica-discreta","status":"publish","type":"page","link":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/grade-curricular-2\/matematica-discreta\/","title":{"rendered":"Matem\u00e1tica Discreta"},"content":{"rendered":"<h4>Matem\u00e1tica Discreta A<\/h4>\n<p>&nbsp;<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"101\">Curso\/semestre<\/td>\n<td width=\"536\">Licenciatura em Matem\u00e1tica \/ Quinto<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Disciplina<\/td>\n<td width=\"536\">Matem\u00e1tica Discreta A<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Car\u00e1ter<\/td>\n<td width=\"536\">Obrigat\u00f3rio<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Pr\u00e9-requisito<\/td>\n<td width=\"536\">&#8211;<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">C\u00f3digo<\/td>\n<td width=\"536\">0100233<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Depto.<\/td>\n<td width=\"536\">DME<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">CHT<\/td>\n<td width=\"536\">68 horas<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Cr\u00e9ditos<\/td>\n<td width=\"536\">04<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Natureza<\/td>\n<td width=\"536\">34 te\u00f3ricas \/ 34 pr\u00e1ticas<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Prof. Resp.<\/td>\n<td width=\"536\"><\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Objetivos<\/td>\n<td width=\"536\">\n<p>Ensinar as t\u00e9cnicas b\u00e1sicas de contagem e no\u00e7\u00f5es sobre teoria de grafos.<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Ementa<\/td>\n<td width=\"536\">Combinat\u00f3ria cl\u00e1ssica enumera\u00e7\u00e3o de permuta\u00e7\u00f5es e arranjos simples e com repeti\u00e7\u00e3o, e de distribui\u00e7\u00f5es. Bin\u00f4mio de Newton, propriedades e rela\u00e7\u00f5es dos coeficientes binomiais. Polin\u00f4mio de Leibniz. Combinat\u00f3ria moderna enumera\u00e7\u00e3o via recorr\u00eancia, fun\u00e7\u00f5es, geratrizes e princ\u00edpio da inclus\u00e3o-exclus\u00e3o. No\u00e7\u00f5es de grafos e d\u00edgrafos. Caminhos Eulerianos e Hamiltonianos.<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Programa<\/td>\n<td width=\"536\">\n<p>Combinat\u00f3ria e Conjuntos<\/p>\n<p>O que \u00e9 Combinat\u00f3ria? Aspectos hist\u00f3ricos<\/p>\n<p>Conjuntos nota\u00e7\u00e3o<\/p>\n<p>Somat\u00f3rio e Produt\u00f3rio<\/p>\n<p>Princ\u00edpio de indu\u00e7\u00e3o matem\u00e1tica<\/p>\n<p>&nbsp;<\/p>\n<p>M\u00e9todos de contagem<\/p>\n<p>Princ\u00edpio da Adi\u00e7\u00e3o<\/p>\n<p>Princ\u00edpio da Multiplica\u00e7\u00e3o (ou Fundamental da enumera\u00e7\u00e3o)<\/p>\n<p>Permuta\u00e7\u00e3o simples<\/p>\n<p>Arranjos simples<\/p>\n<p>Combina\u00e7\u00f5es simples<\/p>\n<p>Combina\u00e7\u00f5es complementares<\/p>\n<p>Permuta\u00e7\u00f5es com repeti\u00e7\u00e3o<\/p>\n<p>Arranjos com repeti\u00e7\u00e3o<\/p>\n<p>Combina\u00e7\u00e3o com repeti\u00e7\u00e3o<\/p>\n<p>Permuta\u00e7\u00f5es circulares<\/p>\n<p>Solu\u00e7\u00f5es inteiras de equa\u00e7\u00f5es lineares com coeficientes unit\u00e1rios<\/p>\n<p>&nbsp;<\/p>\n<p>N\u00fameros binomiais<\/p>\n<p>O Tri\u00e2ngulo de Pascal<\/p>\n<p>O Bin\u00f4mio de Newton<\/p>\n<p>Propriedades dos coeficientes binomiais<\/p>\n<p>O Polin\u00f4mio de Leibniz<\/p>\n<p>&nbsp;<\/p>\n<p>Outros M\u00e9todos de Contagem<\/p>\n<p>Princ\u00edpio da inclus\u00e3o e exclus\u00e3o<\/p>\n<p>Cardinalidade da uni\u00e3o finita de conjuntos<\/p>\n<p>A fun\u00e7\u00e3o phi de Euler<\/p>\n<p>Permuta\u00e7\u00f5es ca\u00f3ticas<\/p>\n<p>O Princ\u00edpio da reflex\u00e3o<\/p>\n<p>O Princ\u00edpio da casa dos pombos (ou princ\u00edpio de Dirichlet)<\/p>\n<p>&nbsp;<\/p>\n<p>Fun\u00e7\u00f5es geratrizes<\/p>\n<p>Defini\u00e7\u00e3o e exemplos<\/p>\n<p>C\u00e1lculo de coeficientes<\/p>\n<p>Parti\u00e7\u00f5es de um inteiro<\/p>\n<p>&nbsp;<\/p>\n<p>Rela\u00e7\u00f5es de Recorr\u00eancia<\/p>\n<p>Defini\u00e7\u00e3o e exemplos<\/p>\n<p>Resolu\u00e7\u00e3o de rela\u00e7\u00f5es de recorr\u00eancia<\/p>\n<p>Rela\u00e7\u00f5es lineares homog\u00eaneas<\/p>\n<p>Rela\u00e7\u00f5es lineares n\u00e3o-homog\u00eaneas<\/p>\n<p>Rela\u00e7\u00f5es baseadas em fun\u00e7\u00e3o geratrizes.<\/p>\n<p>&nbsp;<\/p>\n<p>No\u00e7\u00f5es sobre grafos<\/p>\n<p>Defini\u00e7\u00f5es<\/p>\n<p>Representa\u00e7\u00f5es de grafos<\/p>\n<p>Caminhos<\/p>\n<p>Grafos Eulerianos<\/p>\n<p>Ciclos e caminhos Hamiltonianos<\/p>\n<p>Problema do menor caminho.<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<tr>\n<td width=\"101\">Bibliografia<\/td>\n<td width=\"536\">\n<p>B\u00e1sica<\/p>\n<p>SANTOS, J. Pl\u00ednio et alii. Introdu\u00e7\u00e3o \u00e1 An\u00e1lise combinat\u00f3ria.\u00a0\u00a0 Campinas, SP. Editora da UNICAMP, 1995.<\/p>\n<p>BARBOSA, R. M. Combinat\u00f3ria e Grafos. S\u00e3o Paulo. Nobel, 1974.<\/p>\n<p>LUCCHESI, C. L. Introdu\u00e7\u00e3o \u00e0 Teoria dos Grafos. Rio de Janeiro. Instituto de Matem\u00e1tica Pura e Aplicada (IMPA), 1979.<\/p>\n<p>&nbsp;<\/p>\n<p>Complementar<\/p>\n<p>MORGADO, A. C. O. et alii. An\u00e1lise combinat\u00f3ria e Probabilidade. Rio de Janeiro. IMPA, 1991.<\/p>\n<p>POLYA, G. et alii. Introduction to Combinatorics. Boston. Birkhauser, 1983.<\/p>\n<p>GRIMALDI, R. P. Discrete and Combinatorial Mathematics. Massachusetts. Addison-Wesley, 1986.<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Matem\u00e1tica Discreta A &nbsp; Curso\/semestre Licenciatura em Matem\u00e1tica \/ Quinto Disciplina Matem\u00e1tica Discreta A Car\u00e1ter Obrigat\u00f3rio Pr\u00e9-requisito &#8211; C\u00f3digo 0100233 Depto. DME CHT 68 horas Cr\u00e9ditos 04 Natureza 34 te\u00f3ricas \/ 34 pr\u00e1ticas Prof. Resp. Objetivos Ensinar as t\u00e9cnicas b\u00e1sicas de contagem e no\u00e7\u00f5es sobre teoria de grafos. &nbsp; Ementa Combinat\u00f3ria cl\u00e1ssica enumera\u00e7\u00e3o de permuta\u00e7\u00f5es [&hellip;]<\/p>\n","protected":false},"author":466,"featured_media":0,"parent":166,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-sem-sidebar.php","meta":{"jetpack_post_was_ever_published":false,"footnotes":""},"class_list":["post-231","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/P7sk8J-3J","_links":{"self":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/231","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/users\/466"}],"replies":[{"embeddable":true,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/comments?post=231"}],"version-history":[{"count":1,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/231\/revisions"}],"predecessor-version":[{"id":232,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/231\/revisions\/232"}],"up":[{"embeddable":true,"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/pages\/166"}],"wp:attachment":[{"href":"https:\/\/wp.ufpel.edu.br\/matematicanoturno\/wp-json\/wp\/v2\/media?parent=231"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}