{"id":170,"date":"2016-05-03T10:40:32","date_gmt":"2016-05-03T14:40:32","guid":{"rendered":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/?page_id=170"},"modified":"2021-08-04T16:57:50","modified_gmt":"2021-08-04T20:57:50","slug":"conferences-et-activites","status":"publish","type":"page","link":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/amq-math-camp-2016\/conferences-et-activites\/","title":{"rendered":"Conf\u00e9rences et Activit\u00e9s"},"content":{"rendered":"\"The<\/a>\n

Mathematical Induction: Pascal and Fermat<\/h3>\n

(Shahab Shahabi, Dawson College)<\/p>\n

R\u00e9sum\u00e9:\u00a0\u00a0We will start with mathematical induction, exploring its different guises: simple induction, double induction, strong induction, (and “attach and retreat” in induction, given the time).<\/em><\/p>\n

As one of the main statements dealt with using induction is Binomial Theorem,\u00a0in the second part of the talk we\u00a0will supply its proof, and if time permits, give a few applications.<\/em><\/p>\n

In the last part of the talk,\u00a0we would discuss some elementary number theory.\u00a0Here “Fermat’s Little Theorem” is a good fit. Using induction we will\u00a0give a relatively short proof,\u00a0which has the added advantage that it is independent\u00a0from the theory of congruence relations.<\/em><\/p>\n

A\/Maze Escape Games<\/h3>\n

http:\/\/www.amazemontreal.com<\/a><\/p>\n

\u00a0La m\u00e9thode de l’induction en math\u00e9matiques.<\/strong><\/h3>\n

(Richard Fournier, Dawson College)<\/p>\n

R\u00e9sum\u00e9:\u00a0\u00a0 Apr\u00e8s quelques explications sur le principe d’induction, je donnerai des preuves par induction de certaines identit\u00e9s et in\u00e9galit\u00e9s \u00e9l\u00e9mentaires.<\/em><\/p>\n

Graph theory<\/h3>\n

(Ben Seamone, Dawson College)<\/p>\n

R\u00e9sum\u00e9:\u00a0What is the fewest number of colours required to colour the regions in a geo-political map so that no regions sharing a border receive the same colour?\u00a0 How can you solve a complicated scheduling problem?\u00a0 How does information spread in a network?\u00a0 How can mobile networks be efficiently constructed so that information can be communicated quickly?\u00a0 All of these questions can be formulated in the language of a branch of mathematics known as graph theory.\u00a0 After learning some basic definitions and terminology, we will explore some classic problems in graph theory, including some problems that are still unsolved.<\/em><\/p>\n

Combinatoire \u00c9num\u00e9rative et Probabilit\u00e9<\/h3>\n

(Alexander Hariton, Dawson College)<\/p>\n

R\u00e9sum\u00e9: Nous discuterons des fondements \u00e9l\u00e9mentaires de la combinatoire \u00e9num\u00e9rative, y compris les permutations, les combinaisons et certains principes de base d’\u00e9num\u00e9ration. Nous introduirons \u00e9galement le concepte de probabilit\u00e9 et nous appliquerons les m\u00e9thodes d’\u00e9num\u00e9ration \u00e0 des probl\u00e8mes de probabilit\u00e9 discr\u00e8te.<\/em><\/p>\n

Visite OURANOS<\/h3>\n

https:\/\/www.ouranos.ca<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Mathematical Induction: Pascal and Fermat (Shahab Shahabi, Dawson College) R\u00e9sum\u00e9:\u00a0\u00a0We will start with mathematical induction, exploring its different guises: simple induction, double induction, strong induction, (and “attach and retreat” in induction, given the time). As one of the main statements dealt with using induction is Binomial Theorem,\u00a0in the second part of the talk we\u00a0will supply…<\/p>\n","protected":false},"author":71,"featured_media":0,"parent":148,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/pages\/170"}],"collection":[{"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/users\/71"}],"replies":[{"embeddable":true,"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/comments?post=170"}],"version-history":[{"count":11,"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/pages\/170\/revisions"}],"predecessor-version":[{"id":284,"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/pages\/170\/revisions\/284"}],"up":[{"embeddable":true,"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/pages\/148"}],"wp:attachment":[{"href":"https:\/\/www-chris.dawsoncollege.qc.ca\/mathematics\/wp-json\/wp\/v2\/media?parent=170"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}