Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds:
Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations
Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting
Discrete Probability Theory
A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science). This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds:
Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations
Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting
Discrete Probability Theory
A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science).

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Dr Feinstein has published two case studies on his use of IT in the teaching of mathematics to undergraduates. In 2009, Dr Feinstein was awarded a University of Nottingham Lord Dearing teaching award for his popular and successful innovations in this area Dr Feinstein has published two case studies on his use of IT in the teaching of mathematics to undergraduates. In 2009, Dr Feinstein was awarded a University of Nottingham Lord Dearing teaching award for his popular and successful innovations in this area This is a module framework. It can be viewed online or downloaded as a zip file.
As taught in Autumn Semester 2009/10
The aim of this short unit is to motivate students to understand why we might want to do proofs (why proofs are important and how they can help us) and to help students with some of the relatively routine aspects of doing proofs.
In particular, the student will learn the following:
* proofs can help you to really see why a result is true;
* problems that are easy to state can be hard to solve (e.g. Fermat's Last Theorem);
* sometimes statements which appear to be intuitively obvious may turn out to be false
(e.g. Simpson's paradox);
* the answer to a question will often depend crucially on the definitions you are working with;
* how to start proofs;
* ho This is a module framework. It can be viewed online or downloaded as a zip file.
As taught in Autumn Semester 2009/10
The aim of this short unit is to motivate students to understand why we might want to do proofs (why proofs are important and how they can help us) and to help students with some of the relatively routine aspects of doing proofs.
In particular, the student will learn the following:
* proofs can help you to really see why a result is true;
* problems that are easy to state can be hard to solve (e.g. Fermat's Last Theorem);
* sometimes statements which appear to be intuitively obvious may turn out to be false
(e.g. Simpson's paradox);
* the answer to a question will often depend crucially on the definitions you are working with;
* how to start proofs;
* ho

Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA) Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds:
Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations
Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting
Discrete Probability Theory
A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science).

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

The aim of this session is to motivate students to understand why we might want to do proofs, why proofs are important, and how they can help us. In particular, the student will learn the following: proofs can help you to really see WHY a result is true; problems that are easy to state can be hard to solve (Fermat's Last Theorem); sometimes statements which appear to be intuitively obvious may turn out to be false (the Hospitals paradox); the answer to a question will often depend crucially on the definitions you are working with. Target audience: suitable for anyone with a knowledge of elementary algebra and prime numbers, as may be obtained by studying A level mathematics. The aim of this session is to motivate students to understand why we might want to do proofs, why proofs are important, and how they can help us. In particular, the student will learn the following: proofs can help you to really see WHY a result is true; problems that are easy to state can be hard to solve (Fermat's Last Theorem); sometimes statements which appear to be intuitively obvious may turn out to be false (the Hospitals paradox); the answer to a question will often depend crucially on the definitions you are working with. Target audience: suitable for anyone with a knowledge of elementary algebra and prime numbers, as may be obtained by studying A level mathematics.

Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA) Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)

Collection: A. D. White Architectural Photographs, Cornell University Library
Accession Number: 15/5/3090.01296
Title: Château de Blois, Exterior Detail of the Grand Staircase Tower (Louis XII Wing)
Photographer: Neurdein Frères (French, active ca. 1863-1912)
Building Date: 1498-1503
Photograph date: ca. 1865-ca. 1895
Location: Europe: France; Blois
Materials: albumen print
Image: 10.4331 x 7.8346 in.; 26.5 x 19.9 cm
Style: Flamboyant Gothic
Provenance: Transfer from the College of Architecture, Art and Planning
Persistent URI: hdl.handle.net/1813.001/5tgh
There are no known copyright restrictions on this image. The digital file is owned by the Cornell University Library which is making it freely available with the request that, when possible, the Library be credited as its source.
We had some help with the geocoding from Web Services by Yahoo!

Analysis I (18.100) in its various versions covers fundamentals of mathematical analysis: continuity, differentiability, some form of the Riemann integral, sequences and series of numbers and functions, uniform convergence with applications to interchange of limit operations, some point-set topology, including some work in Euclidean n-space. MIT students may choose to take one of three versions of 18.100: Option A (18.100A) chooses less abstract definitions and proofs, and gives applications where possible. Option B (18.100B) is more demanding and for students with more mathematical maturity; it places more emphasis from the beginning on point-set topology and n-space, whereas Option A is concerned primarily with analysis on the real line, saving for the last weeks work in 2-space (the pla Analysis I (18.100) in its various versions covers fundamentals of mathematical analysis: continuity, differentiability, some form of the Riemann integral, sequences and series of numbers and functions, uniform convergence with applications to interchange of limit operations, some point-set topology, including some work in Euclidean n-space. MIT students may choose to take one of three versions of 18.100: Option A (18.100A) chooses less abstract definitions and proofs, and gives applications where possible. Option B (18.100B) is more demanding and for students with more mathematical maturity; it places more emphasis from the beginning on point-set topology and n-space, whereas Option A is concerned primarily with analysis on the real line, saving for the last weeks work in 2-space (the pla

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm