Proposals
Below are some proposals for talks from the past (and current). By clicking on the ID number, more details are shown. By default, these are sorted chronologically (recent first) and by then by last name. The data can be sorted by alternate means by using the links at the top right, each allowing ascending or descending orders.
Displaying 61-80 of 471 results.
Sort by:
ID:
109
Year: 2005
Name: Charles Ashbacher
Institution:
Subject area(s): Recreational mathematics
Title of Talk: Searching For Images Embedded in Mathematics
Abstract: In the science fiction book
Year: 2005
Name: Charles Ashbacher
Institution:
Subject area(s): Recreational mathematics
Title of Talk: Searching For Images Embedded in Mathematics
Abstract: In the science fiction book
ID:
379
Year: 2014
Name: Benjamin V.C. Collins
Institution: University of Wisconsin-Platteville
Subject area(s): Recreational Mathematics
Title of Talk: Mathemagic: A Centennial Tribute to Martin Gardner
Abstract: Marting Gardner (1914-2010) was a mathematician and writer who inspired generations of mathematicians through his ``Mathematical Games'' column in Scientific American and other written work. He was also an accomplished magician, and many of his tricks have interesting mathematical underpinnings. In this talk, ``Quinntinnius Maximus'' (otherwise known as Quinn Collins, an eighth grader at Platteville Middle School) will present several of these feats of Mathemagic. If you are lucky, his assistant ``Sabino'' (otherwise known as Ben Collins, a professor of mathematics at the University of Wisconsin-Platteville) will explain some of the mathematics underlying them.
Year: 2014
Name: Benjamin V.C. Collins
Institution: University of Wisconsin-Platteville
Subject area(s): Recreational Mathematics
Title of Talk: Mathemagic: A Centennial Tribute to Martin Gardner
Abstract: Marting Gardner (1914-2010) was a mathematician and writer who inspired generations of mathematicians through his ``Mathematical Games'' column in Scientific American and other written work. He was also an accomplished magician, and many of his tricks have interesting mathematical underpinnings. In this talk, ``Quinntinnius Maximus'' (otherwise known as Quinn Collins, an eighth grader at Platteville Middle School) will present several of these feats of Mathemagic. If you are lucky, his assistant ``Sabino'' (otherwise known as Ben Collins, a professor of mathematics at the University of Wisconsin-Platteville) will explain some of the mathematics underlying them.
ID:
465
Year: 2017
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: "Honest" Numbers in the Languages of the Native Americans of North America
Abstract: Like so many ideas in recreational mathematics, the concept of an “honest” number was created by Martin Gardner. A number is considered “honest” if the number of letters in the name is the value of the number. For example, “four” is the only “honest” number in English. In a later paper titled “The Lucky Languages,” Sidney Kravitz examined 17 other western languages, looking for more “honest” numbers. In this paper, the languages of Native Americans of North America are examined in a search for additional “honest” numbers. Some of those languages are extinct, others are endangered and for many, there is a concerted effort to preserve them.
Year: 2017
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: "Honest" Numbers in the Languages of the Native Americans of North America
Abstract: Like so many ideas in recreational mathematics, the concept of an “honest” number was created by Martin Gardner. A number is considered “honest” if the number of letters in the name is the value of the number. For example, “four” is the only “honest” number in English. In a later paper titled “The Lucky Languages,” Sidney Kravitz examined 17 other western languages, looking for more “honest” numbers. In this paper, the languages of Native Americans of North America are examined in a search for additional “honest” numbers. Some of those languages are extinct, others are endangered and for many, there is a concerted effort to preserve them.
ID:
223
Year: 2008
Name: Charles Ashbacher
Institution: #none
Subject area(s): Recreational mathematics
Title of Talk: Computer Investigations of Problems in Pickover
Abstract: Clifford Pickover, who has been described as the
Year: 2008
Name: Charles Ashbacher
Institution: #none
Subject area(s): Recreational mathematics
Title of Talk: Computer Investigations of Problems in Pickover
Abstract: Clifford Pickover, who has been described as the
ID:
504
Year: 2018
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: Mathematical Venery and Other Humor
Abstract: In modern usage, the term “venery” refers to the pursuit of sexual pleasure, yet in medieval times it referred to the act of game hunting. The terms of venery refers to the rather unusual words used to describe a collection of animals of the same species. Charles W. Trigg composed a paper published in Journal of Recreational Mathematics that used this term to refer to the naming of collections of math people and objects. He listed some examples and this paper opens with additional examples created by the author. It concludes with some additional examples of mathematical humor.
Year: 2018
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: Mathematical Venery and Other Humor
Abstract: In modern usage, the term “venery” refers to the pursuit of sexual pleasure, yet in medieval times it referred to the act of game hunting. The terms of venery refers to the rather unusual words used to describe a collection of animals of the same species. Charles W. Trigg composed a paper published in Journal of Recreational Mathematics that used this term to refer to the naming of collections of math people and objects. He listed some examples and this paper opens with additional examples created by the author. It concludes with some additional examples of mathematical humor.
ID:
507
Year: 2018
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: Which Gender is Happier in the United States? What About Other Countries?
Abstract: For any number, if the sum of the squares of the digits is performed and then repeated, there are two possible outcomes. The process eventually terminates at 1 or goes into an infinite cycle. If the process terminates at 1, then the original number is said to be “happy.” For any word, if the letter assignments a = 1, b = 2, c = 3 and so on are done, then the word can be assigned a number. If the word is a name and the associated number is “happy,” then the name is said to be a “happy name.” In this presentation, the 100 most common male and female names in several countries are examined to determine which gender is “happier.”
Year: 2018
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: Which Gender is Happier in the United States? What About Other Countries?
Abstract: For any number, if the sum of the squares of the digits is performed and then repeated, there are two possible outcomes. The process eventually terminates at 1 or goes into an infinite cycle. If the process terminates at 1, then the original number is said to be “happy.” For any word, if the letter assignments a = 1, b = 2, c = 3 and so on are done, then the word can be assigned a number. If the word is a name and the associated number is “happy,” then the name is said to be a “happy name.” In this presentation, the 100 most common male and female names in several countries are examined to determine which gender is “happier.”
ID:
282
Year: 2010
Name: Brian Patterson
Institution: Iowa State University
Subject area(s): Real Analysis, Computability Theory
Title of Talk: Multi-Resolution Cellular Automata for Real Computation
Abstract: We will first briefly review cellular automata and why representing and computing with real numbers with a computer is problematic. Then we will discuss a new approach that uses the concept of fissioning cells to approximate real-valued regions. I will close with a brief explanation of my simulator.
Year: 2010
Name: Brian Patterson
Institution: Iowa State University
Subject area(s): Real Analysis, Computability Theory
Title of Talk: Multi-Resolution Cellular Automata for Real Computation
Abstract: We will first briefly review cellular automata and why representing and computing with real numbers with a computer is problematic. Then we will discuss a new approach that uses the concept of fissioning cells to approximate real-valued regions. I will close with a brief explanation of my simulator.
ID:
370
Year: 2013
Name: Dave Renfro
Institution: ACT, Inc.
Subject area(s): real analysis
Title of Talk: The Upper and Lower Limits of a Function and Semicontinuous Functions
Abstract: A function is continuous on an interval exactly when the function agrees with its "limit function" on the interval, by which we mean the limit (when it exists) of the function at each point. In looking at some examples, we find that limit functions tend to be nicely behaved even when the functions are not. For example, Thomae's function is continuous on a dense set of points and discontinuous on a dense set of points, and yet its limit function is a constant function (identically equal to 0). Of course, the limit function of a function is not always defined, but by considering upper and lower limits (limsup and liminf), we get the upper and lower limit functions of a function. These also tend to be nicely behaved, as is illustrated by the characteristic function of the rationals (discontinuous at every point), whose upper and lower limit functions are constant functions. We will investigate how badly behaved the upper and lower limit functions of a function can be. This will lead to an investigation of semicontinuous functions, which are amazingly ubiquitously omnipresent throughout pure and applied mathematics. This talk should be accessible to most undergraduate math majors, although there will likely be aspects of it that are unfamiliar to nonexperts.
Year: 2013
Name: Dave Renfro
Institution: ACT, Inc.
Subject area(s): real analysis
Title of Talk: The Upper and Lower Limits of a Function and Semicontinuous Functions
Abstract: A function is continuous on an interval exactly when the function agrees with its "limit function" on the interval, by which we mean the limit (when it exists) of the function at each point. In looking at some examples, we find that limit functions tend to be nicely behaved even when the functions are not. For example, Thomae's function is continuous on a dense set of points and discontinuous on a dense set of points, and yet its limit function is a constant function (identically equal to 0). Of course, the limit function of a function is not always defined, but by considering upper and lower limits (limsup and liminf), we get the upper and lower limit functions of a function. These also tend to be nicely behaved, as is illustrated by the characteristic function of the rationals (discontinuous at every point), whose upper and lower limit functions are constant functions. We will investigate how badly behaved the upper and lower limit functions of a function can be. This will lead to an investigation of semicontinuous functions, which are amazingly ubiquitously omnipresent throughout pure and applied mathematics. This talk should be accessible to most undergraduate math majors, although there will likely be aspects of it that are unfamiliar to nonexperts.
ID:
371
Year: 2013
Name: Dave Renfro
Institution: ACT, Inc.
Subject area(s): real analysis
Title of Talk: The Upper and Lower Limits of a Function and Semicontinuous Functions
Abstract: A function is continuous on an interval exactly when the function agrees with its "limit function" on the interval, by which we mean the limit (when it exists) of the function at each point. In looking at some examples, we find that limit functions tend to be nicely behaved even when the functions are not. For example, Thomae's function is continuous on a dense set of points and discontinuous on a dense set of points, and yet its limit function is a constant function (identically equal to 0). Of course, the limit function of a function is not always defined, but by considering upper and lower limits (limsup and liminf), we get the upper and lower limit functions of a function. These also tend to be nicely behaved, as is illustrated by the characteristic function of the rationals (discontinuous at every point), whose upper and lower limit functions are constant functions. We will investigate how badly behaved the upper and lower limit functions of a function can be. This will lead to an investigation of semicontinuous functions, which are amazingly ubiquitously omnipresent throughout pure and applied mathematics. This talk should be accessible to most undergraduate math majors, although there will likely be aspects of it that are unfamiliar to nonexperts.
Year: 2013
Name: Dave Renfro
Institution: ACT, Inc.
Subject area(s): real analysis
Title of Talk: The Upper and Lower Limits of a Function and Semicontinuous Functions
Abstract: A function is continuous on an interval exactly when the function agrees with its "limit function" on the interval, by which we mean the limit (when it exists) of the function at each point. In looking at some examples, we find that limit functions tend to be nicely behaved even when the functions are not. For example, Thomae's function is continuous on a dense set of points and discontinuous on a dense set of points, and yet its limit function is a constant function (identically equal to 0). Of course, the limit function of a function is not always defined, but by considering upper and lower limits (limsup and liminf), we get the upper and lower limit functions of a function. These also tend to be nicely behaved, as is illustrated by the characteristic function of the rationals (discontinuous at every point), whose upper and lower limit functions are constant functions. We will investigate how badly behaved the upper and lower limit functions of a function can be. This will lead to an investigation of semicontinuous functions, which are amazingly ubiquitously omnipresent throughout pure and applied mathematics. This talk should be accessible to most undergraduate math majors, although there will likely be aspects of it that are unfamiliar to nonexperts.
ID:
171
Year: 2006
Name: Reginald Laursen
Institution: Luther College
Subject area(s): Real Analysis
Title of Talk: Classroom Capsule: Teaching Challenge-Response Arguments
Abstract: The forward-backward method is a fundamental proof technique for helping students understand how to construct proofs. I will describe my latest variation in the application of this technique for addressing challenge-response arguments in a Real Analysis class. Using this variation my lower ability students have had greater success.
Year: 2006
Name: Reginald Laursen
Institution: Luther College
Subject area(s): Real Analysis
Title of Talk: Classroom Capsule: Teaching Challenge-Response Arguments
Abstract: The forward-backward method is a fundamental proof technique for helping students understand how to construct proofs. I will describe my latest variation in the application of this technique for addressing challenge-response arguments in a Real Analysis class. Using this variation my lower ability students have had greater success.
ID:
480
Year: 2017
Name: Robert Calcaterra
Institution: University of Wisconsin - Platteville
Subject area(s): real analysis
Title of Talk: Jordan's Proof of the Fundamental Theorem of Algebra
Abstract: The most common proofs of the Fundamental Theorem of Algebra rely on either Galois Theory or complex variables. This talk will present a proof of this theorem that primarily employs real analysis and DeMoivre's Theorem that appeared in Jordan's text from nineteenth century. Undergraduate mathematics majors who have had an undergraduate real analysis course should be able follow the talk.
Year: 2017
Name: Robert Calcaterra
Institution: University of Wisconsin - Platteville
Subject area(s): real analysis
Title of Talk: Jordan's Proof of the Fundamental Theorem of Algebra
Abstract: The most common proofs of the Fundamental Theorem of Algebra rely on either Galois Theory or complex variables. This talk will present a proof of this theorem that primarily employs real analysis and DeMoivre's Theorem that appeared in Jordan's text from nineteenth century. Undergraduate mathematics majors who have had an undergraduate real analysis course should be able follow the talk.
ID:
558
Year: 2021
Name: mpazkvt ubUxGrQpZHbbYZv
Institution: icImzteiWthAdt
Subject area(s): QZAaMIFgkRreqn
Title of Talk: iNgEWUcEePPq
Abstract: CINzSn kwmcveqbfepc, [url=http://lsdqczvfutyk.com/]lsdqczvfutyk[/url], [link=http://ddcyzhyfdlpf.com/]ddcyzhyfdlpf[/link], http://mtutlcuqqpic.com/
Year: 2021
Name: mpazkvt ubUxGrQpZHbbYZv
Institution: icImzteiWthAdt
Subject area(s): QZAaMIFgkRreqn
Title of Talk: iNgEWUcEePPq
Abstract: CINzSn kwmcveqbfepc, [url=http://lsdqczvfutyk.com/]lsdqczvfutyk[/url], [link=http://ddcyzhyfdlpf.com/]ddcyzhyfdlpf[/link], http://mtutlcuqqpic.com/
ID:
481
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s): quasigroups, universal algebra, design theory
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s): quasigroups, universal algebra, design theory
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
ID:
559
Year: 2021
Name: Jack Rausch
Institution: Creighton University
Subject area(s): Quantum Information Theory, Quantum Computing
Title of Talk: Developing a Quantum Resource Theory for One-Way Information
Abstract: In quantum information theory, the one-way information of the joint evolution of a composite system quantifies the causal relationship between systems. Given a composite two systems, an algorithm is used to create a state $\rho^{A'ABB'} $ which quantifies the one-way information via the measure $R\left(\rho^{A'ABB'} \right) = I\left(\rho^{B} : \rho^{A'AB'} \right) - I\left(\rho^{B} : \rho^{B'} \right)$. A quantum resource theory offers a new perspective to view one-way information. A quantum resource theory examines a problem under a set of physically meaningful limitations which identify certain operations as free (can be used without limitations) and others as resources (operations with limitations or costs). We define a quantum resource theory for one-way information based on the measure $R\left(\rho^{A'ABB'} \right)$, showing that: $R$ is an additive measure, all free states contain $0$ one-way information, the free operations contain all unitary operators $U_{AB} = U_A \otimes U_B$, and $R$ is monotonic under free operations, but not under the restricted operations.
Year: 2021
Name: Jack Rausch
Institution: Creighton University
Subject area(s): Quantum Information Theory, Quantum Computing
Title of Talk: Developing a Quantum Resource Theory for One-Way Information
Abstract: In quantum information theory, the one-way information of the joint evolution of a composite system quantifies the causal relationship between systems. Given a composite two systems, an algorithm is used to create a state $\rho^{A'ABB'} $ which quantifies the one-way information via the measure $R\left(\rho^{A'ABB'} \right) = I\left(\rho^{B} : \rho^{A'AB'} \right) - I\left(\rho^{B} : \rho^{B'} \right)$. A quantum resource theory offers a new perspective to view one-way information. A quantum resource theory examines a problem under a set of physically meaningful limitations which identify certain operations as free (can be used without limitations) and others as resources (operations with limitations or costs). We define a quantum resource theory for one-way information based on the measure $R\left(\rho^{A'ABB'} \right)$, showing that: $R$ is an additive measure, all free states contain $0$ one-way information, the free operations contain all unitary operators $U_{AB} = U_A \otimes U_B$, and $R$ is monotonic under free operations, but not under the restricted operations.
ID:
285
Year: 2010
Name: Reza Rastegar
Institution: Iowa State University
Subject area(s): Probability
Title of Talk: Random walks in a sparse ``cookie" environment
Abstract: ``Cookie random walks" is a popular model of self-interacting random walks. Several variations of this model have been studied during the last decade. In this talk we will focus on the random walk on the integer lattice, where the ``cookies" perturbing the random walk are placed in a regular random sub-lattice of Z. We will present the model, briefly discuss an associated branching process, and then state criteria for transience and recurrence for this random walk.
Year: 2010
Name: Reza Rastegar
Institution: Iowa State University
Subject area(s): Probability
Title of Talk: Random walks in a sparse ``cookie" environment
Abstract: ``Cookie random walks" is a popular model of self-interacting random walks. Several variations of this model have been studied during the last decade. In this talk we will focus on the random walk on the integer lattice, where the ``cookies" perturbing the random walk are placed in a regular random sub-lattice of Z. We will present the model, briefly discuss an associated branching process, and then state criteria for transience and recurrence for this random walk.
ID:
401
Year: 2014
Name: Christian Roettger
Institution: Iowa State University
Subject area(s): Probability
Title of Talk: Visual hypothesis testing - lineups and probability
Abstract: Police use lineups involving one suspect and several 'dummies' to get evidence that a witness can identify the suspect. In an abstract sense, we can form a hypothesis about 'suspect' data and test it in this way: literally have people looking at a lineup of plots with the task of identifying the data plot among the dummies. Repetition with several observers makes this approach surprisingly powerful. It also has potential when comparing the efficiency of different visual representations of the same data. Disclaimer: do not expect analysis of actual police lineups. But we will try out the method on the audience! This is joint work with Heike Hofmann, Di Cook, Phil Dixon, and Andreas Buja. I have investigated the underlying probability distributions. This meant evaluating some multiple integrals, and revising all the tricks from Calculus II.
Year: 2014
Name: Christian Roettger
Institution: Iowa State University
Subject area(s): Probability
Title of Talk: Visual hypothesis testing - lineups and probability
Abstract: Police use lineups involving one suspect and several 'dummies' to get evidence that a witness can identify the suspect. In an abstract sense, we can form a hypothesis about 'suspect' data and test it in this way: literally have people looking at a lineup of plots with the task of identifying the data plot among the dummies. Repetition with several observers makes this approach surprisingly powerful. It also has potential when comparing the efficiency of different visual representations of the same data. Disclaimer: do not expect analysis of actual police lineups. But we will try out the method on the audience! This is joint work with Heike Hofmann, Di Cook, Phil Dixon, and Andreas Buja. I have investigated the underlying probability distributions. This meant evaluating some multiple integrals, and revising all the tricks from Calculus II.
ID:
232
Year: 2008
Name: Dan Willis
Institution: Loras College
Subject area(s): Preservice Teachers
Title of Talk: Math for Elementary Teachers
Abstract: The speaker will survey some of the available research on the mathematics content needs of elementary school teachers and future teachers. He will also discuss the impact this research has had on the development of a two-course 8-credit sequence "Math for Elementary Teachers I/II" at Loras College. This new two-course sequence is a program requirement for all Elementary Education majors at Loras College.
Year: 2008
Name: Dan Willis
Institution: Loras College
Subject area(s): Preservice Teachers
Title of Talk: Math for Elementary Teachers
Abstract: The speaker will survey some of the available research on the mathematics content needs of elementary school teachers and future teachers. He will also discuss the impact this research has had on the development of a two-course 8-credit sequence "Math for Elementary Teachers I/II" at Loras College. This new two-course sequence is a program requirement for all Elementary Education majors at Loras College.
ID:
281
Year: 2010
Name: Henry Walker
Institution: Grinnell College
Subject area(s): Placement,
Title of Talk: A System to Place Incoming Students in Computer Science, Mathematics and Statistics
Abstract: Joint work with Andrew Hirakawa and Russel Steinbach. Colleges utilize various methods of placing students, but many methods are time intensive, have limited scope, or lack precision. The placement system described here resolves many of these issues using a PHP based inference engine with extensively-researched rules. The system's placements compare favorably with those created manually by faculty, and students perform well in the system-recommended courses. Scripts store placements in a MySQL database and later generate individual LaTeX-based letter for each student. The scripts from this project run efficiently, follow established software-engineering principles, and are easily modifiable. The project automates every step of the process from loading student data into the database to generating individual letters for students.
Year: 2010
Name: Henry Walker
Institution: Grinnell College
Subject area(s): Placement,
Title of Talk: A System to Place Incoming Students in Computer Science, Mathematics and Statistics
Abstract: Joint work with Andrew Hirakawa and Russel Steinbach. Colleges utilize various methods of placing students, but many methods are time intensive, have limited scope, or lack precision. The placement system described here resolves many of these issues using a PHP based inference engine with extensively-researched rules. The system's placements compare favorably with those created manually by faculty, and students perform well in the system-recommended courses. Scripts store placements in a MySQL database and later generate individual LaTeX-based letter for each student. The scripts from this project run efficiently, follow established software-engineering principles, and are easily modifiable. The project automates every step of the process from loading student data into the database to generating individual letters for students.
ID:
161
Year: 2006
Name: Jacob Manske
Institution: Iowa State University
Subject area(s): Philosophy of Mathematics
Title of Talk: Hey, Kids! Improve Your Theorems! Add Superfluous Hypotheses!
Abstract: In spite of the fact that we tell students not to assume what they are trying to prove, we all must do precisely that. The interesting theorems, then, turn out to be the ones whose tautologous nature is elusive. This will be a philosophical discussion; bellicose debate is encouraged.
Year: 2006
Name: Jacob Manske
Institution: Iowa State University
Subject area(s): Philosophy of Mathematics
Title of Talk: Hey, Kids! Improve Your Theorems! Add Superfluous Hypotheses!
Abstract: In spite of the fact that we tell students not to assume what they are trying to prove, we all must do precisely that. The interesting theorems, then, turn out to be the ones whose tautologous nature is elusive. This will be a philosophical discussion; bellicose debate is encouraged.
ID:
179
Year: 2007
Name: Russell Goodman
Institution: Central College
Subject area(s): Pedagogy; Elementary Mathematics
Title of Talk: Using Oral Exams to Help Prepare Future Elementary Mathematics Teachers
Abstract: The ability to effectively communicate mathematics is a priority for future elementary mathematics teachers. An oral examination, if used appropriately, is an excellent tool for assessing such skills. Moreover, an oral exam is a useful pedagogical tool for helping future elementary mathematics teachers improve their skills in communicating mathematical concepts. <br><br> The speaker has used oral exams in his department
Year: 2007
Name: Russell Goodman
Institution: Central College
Subject area(s): Pedagogy; Elementary Mathematics
Title of Talk: Using Oral Exams to Help Prepare Future Elementary Mathematics Teachers
Abstract: The ability to effectively communicate mathematics is a priority for future elementary mathematics teachers. An oral examination, if used appropriately, is an excellent tool for assessing such skills. Moreover, an oral exam is a useful pedagogical tool for helping future elementary mathematics teachers improve their skills in communicating mathematical concepts. <br><br> The speaker has used oral exams in his department