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 141-160 of 471 results.
Sort by:
ID:
399
Year: 2014
Name: Tyler Skorczewski
Institution: Cornell College
Subject area(s): math biology, fluid dynamics
Title of Talk: Toward an integrative model of suction feeding using the immersed boundary method
Abstract: Suction feeding is among the most common forms of aquatic prey capture. During a suction feeding strike a fish rapidly opens its mouth creating a fluid flow that draws in the prey. This is an example of indirect prey capture; the fish does not directly manipulate the prey, but rather the fluid flow around the prey. Previous studies of suction feeding have either studied jaw mechanics or the flow field in isolation, or have only considered rigid jaw motions (think of a fish mouth as a collection of metal plates). In this talk I will describe work in progress to develop a new methodology to study fish suction feeding that relaxes some of these conditions. In particular we will allow for more realistic flexible jaws and examine how the kinematics of the jaw motion affects the resultant flow field and subsequent prey capture.
Year: 2014
Name: Tyler Skorczewski
Institution: Cornell College
Subject area(s): math biology, fluid dynamics
Title of Talk: Toward an integrative model of suction feeding using the immersed boundary method
Abstract: Suction feeding is among the most common forms of aquatic prey capture. During a suction feeding strike a fish rapidly opens its mouth creating a fluid flow that draws in the prey. This is an example of indirect prey capture; the fish does not directly manipulate the prey, but rather the fluid flow around the prey. Previous studies of suction feeding have either studied jaw mechanics or the flow field in isolation, or have only considered rigid jaw motions (think of a fish mouth as a collection of metal plates). In this talk I will describe work in progress to develop a new methodology to study fish suction feeding that relaxes some of these conditions. In particular we will allow for more realistic flexible jaws and examine how the kinematics of the jaw motion affects the resultant flow field and subsequent prey capture.
ID:
324
Year: 2012
Name: Courtney Sherwood
Institution: Simpson College
Subject area(s): Math Biology
Title of Talk: A Model of Invertebrate Richness on Restored Prairies
Abstract: We will present a differential equations model of prairie restoration. Here, species richness is considered as an indicator of prairie restoration, with the variables for the equation being invertebrate and plant species richness and time. We will incorporate field work from a prairie in Nebraska as an example of our model. Our main goal is determining if planting fewer seeds will yield similar invertebrate richness as planting more seeds, that is, a more cost effective approach.
Year: 2012
Name: Courtney Sherwood
Institution: Simpson College
Subject area(s): Math Biology
Title of Talk: A Model of Invertebrate Richness on Restored Prairies
Abstract: We will present a differential equations model of prairie restoration. Here, species richness is considered as an indicator of prairie restoration, with the variables for the equation being invertebrate and plant species richness and time. We will incorporate field work from a prairie in Nebraska as an example of our model. Our main goal is determining if planting fewer seeds will yield similar invertebrate richness as planting more seeds, that is, a more cost effective approach.
ID:
262
Year: 2009
Name: Louis Kauffman
Institution: University of Illinois at Chicago
Subject area(s): MAA George Polya Lecturer
Title of Talk: Introduction to Knot Theory
Abstract: The theory of knots is a recent part of mathematics. It originated in the tabulation of tables of knots by the mathematicians Tait, Kirkman and Little in the 19th century. These tables were prepared at the behest of Lord Kelvin (Sir William Thompson) who had developed a theory that atoms were three dimensional knotted vortices in the luminiferous aether. Along with these speculations came the development of geometry and topology in the hands of Gauss, Riemann, Poincare and others. As the knotted vortex theory declined (it has never entirely disappeared!), the mathematics of topology ascended, and the theory of knots came into being as part of the study of low dimensional manifolds, using the fundamental group of Poincare and early versions of homology theory. Max Dehn used the fundamental group to show that a trefoil knot and its mirror image are topologically distinct. J. W. Alexander in the 1920's found a polynomial invariant of knots that bears his name to this day. Kurt Reidemeister, in the 1920's, discovered a set of moves on diagrams for knots that made their classification a (difficult) combinatorial problem. In the 1980's there came a rebirth of these combinatorial schemes in the discovery of the Jones polynomial invariant of knots and links (and its relatives and descendants). Along with the new combinatorial invariants came new relationships with physics and with many fields of mathematics (combinatorics, graph theory, Hopf algebras, Lie algebras, von Neumann algebras, functional integration, category theory) and new kinds of mathematics such as higher categories and categorification. This talk will discuss the history of knot theory and then it will concentrate on describing the Jones polynomial, its relationships with physics, and recent developments related to categorification.
Year: 2009
Name: Louis Kauffman
Institution: University of Illinois at Chicago
Subject area(s): MAA George Polya Lecturer
Title of Talk: Introduction to Knot Theory
Abstract: The theory of knots is a recent part of mathematics. It originated in the tabulation of tables of knots by the mathematicians Tait, Kirkman and Little in the 19th century. These tables were prepared at the behest of Lord Kelvin (Sir William Thompson) who had developed a theory that atoms were three dimensional knotted vortices in the luminiferous aether. Along with these speculations came the development of geometry and topology in the hands of Gauss, Riemann, Poincare and others. As the knotted vortex theory declined (it has never entirely disappeared!), the mathematics of topology ascended, and the theory of knots came into being as part of the study of low dimensional manifolds, using the fundamental group of Poincare and early versions of homology theory. Max Dehn used the fundamental group to show that a trefoil knot and its mirror image are topologically distinct. J. W. Alexander in the 1920's found a polynomial invariant of knots that bears his name to this day. Kurt Reidemeister, in the 1920's, discovered a set of moves on diagrams for knots that made their classification a (difficult) combinatorial problem. In the 1980's there came a rebirth of these combinatorial schemes in the discovery of the Jones polynomial invariant of knots and links (and its relatives and descendants). Along with the new combinatorial invariants came new relationships with physics and with many fields of mathematics (combinatorics, graph theory, Hopf algebras, Lie algebras, von Neumann algebras, functional integration, category theory) and new kinds of mathematics such as higher categories and categorification. This talk will discuss the history of knot theory and then it will concentrate on describing the Jones polynomial, its relationships with physics, and recent developments related to categorification.
ID:
334
Year: 2012
Name: Henry Walker
Institution: Grinnell College
Subject area(s): MAA CUPM Subcommittee Status Report
Title of Talk: MAA Program Study Group on Computer Science and Computational Science
Abstract: The MAA CUPM currently is working on a revision of its curricular recommendations for undergraduate programs and departments. As part of this effort, CUPM has appointed several Program Study Groups to explore how mathematics programs might support and collaborate with programs in other areas. Topics for consideration include supporting courses, minors, double majors, and other interdisciplinary opportunities. This session will review the current activities of the MAA Program Study Group on Computer Science and Computational Science. Feedback from the session attendees will be sought to help clarify what types of information might be helpful within a forthcoming Study Group report.
Year: 2012
Name: Henry Walker
Institution: Grinnell College
Subject area(s): MAA CUPM Subcommittee Status Report
Title of Talk: MAA Program Study Group on Computer Science and Computational Science
Abstract: The MAA CUPM currently is working on a revision of its curricular recommendations for undergraduate programs and departments. As part of this effort, CUPM has appointed several Program Study Groups to explore how mathematics programs might support and collaborate with programs in other areas. Topics for consideration include supporting courses, minors, double majors, and other interdisciplinary opportunities. This session will review the current activities of the MAA Program Study Group on Computer Science and Computational Science. Feedback from the session attendees will be sought to help clarify what types of information might be helpful within a forthcoming Study Group report.
ID:
117
Year: 2005
Name: Eugene Herman
Institution: Grinnell College
Subject area(s): Linear geometry
Title of Talk: Equidistant Sets and Similarity Transformations
Abstract: The main result to be presented is the following: If f is a nonconstant function from R^n to R^n that preserves equality of distances, then f is a similarity transformation. A key concept in the proof is a special type of affinely independent set of points -- a set of points that are equidistant from one another. The proof uses elementary linear algebra and geometric reasoning and little else. Much of the emphasis in the presentation will be on the interplay of algebra and geometry. Also, there will be some remarks on the connections with classical geometry, including the Fundamental Theorem of Affine Geometry.
Year: 2005
Name: Eugene Herman
Institution: Grinnell College
Subject area(s): Linear geometry
Title of Talk: Equidistant Sets and Similarity Transformations
Abstract: The main result to be presented is the following: If f is a nonconstant function from R^n to R^n that preserves equality of distances, then f is a similarity transformation. A key concept in the proof is a special type of affinely independent set of points -- a set of points that are equidistant from one another. The proof uses elementary linear algebra and geometric reasoning and little else. Much of the emphasis in the presentation will be on the interplay of algebra and geometry. Also, there will be some remarks on the connections with classical geometry, including the Fundamental Theorem of Affine Geometry.
ID:
451
Year: 2016
Name: Samuel Van Fleet
Institution: Wartburg College
Subject area(s): Linear Algebra, Wavelets
Title of Talk: In-Place Computation of the Discrete Haar Wavelet Transformation.
Abstract: This method uses Huffman coding assisted by a wavelet filter to compress image files to a smaller size. The background math is linear algebra and there is some computer programming involved. JPEG uses a form of this math with their image files as well as the FBI for images of their fingerprints.
Year: 2016
Name: Samuel Van Fleet
Institution: Wartburg College
Subject area(s): Linear Algebra, Wavelets
Title of Talk: In-Place Computation of the Discrete Haar Wavelet Transformation.
Abstract: This method uses Huffman coding assisted by a wavelet filter to compress image files to a smaller size. The background math is linear algebra and there is some computer programming involved. JPEG uses a form of this math with their image files as well as the FBI for images of their fingerprints.
ID:
172
Year: 2006
Name: Mariah Birgen
Institution: Wartburg College
Subject area(s): Linear Algebra, Voting Theory
Title of Talk: Decomposing Voters
Abstract: Recent developments in the mathematics of Social Choice by Don Saari, among others, have added an element of geometry and linear algebra to a field that has been dominated by combinatorics. This talk will introduce the linear algebra behind a three-candidate election, including how symmetries underlie traditional voting paradoxes.
Year: 2006
Name: Mariah Birgen
Institution: Wartburg College
Subject area(s): Linear Algebra, Voting Theory
Title of Talk: Decomposing Voters
Abstract: Recent developments in the mathematics of Social Choice by Don Saari, among others, have added an element of geometry and linear algebra to a field that has been dominated by combinatorics. This talk will introduce the linear algebra behind a three-candidate election, including how symmetries underlie traditional voting paradoxes.
ID:
273
Year: 2010
Name: Martha Ellen Waggoner
Institution: Simpson College
Subject area(s): linear algebra, teaching
Title of Talk: Linear Algebra: When am I ever going to use this?
Abstract: I tell my students that linear algebra is the most useful mathematical subject they will take, and of course, they expect me to support that claim. In this talk I will discuss applications that I use in both Linear Algebra and Mathematical Modeling that require matrix operations. I will focus on the difference between a forward problem and an inverse problem. The subject areas will include games, historical geography, and ray-based tomography.
Year: 2010
Name: Martha Ellen Waggoner
Institution: Simpson College
Subject area(s): linear algebra, teaching
Title of Talk: Linear Algebra: When am I ever going to use this?
Abstract: I tell my students that linear algebra is the most useful mathematical subject they will take, and of course, they expect me to support that claim. In this talk I will discuss applications that I use in both Linear Algebra and Mathematical Modeling that require matrix operations. I will focus on the difference between a forward problem and an inverse problem. The subject areas will include games, historical geography, and ray-based tomography.
ID:
483
Year: 2017
Name: Matt Rissler
Institution: Loras College
Subject area(s): Linear Algebra, Sports Analytics, Computing
Title of Talk: Ranking teams, predicting outcomes, tuning parameters and getting stuck
Abstract: I have been ranking sports for the last couple years, using a combination of a Markov Chain for determining the quality of a win based on the margin of victory, and a Markov Chain for aggregating results across the network of games. From this information, I've started predicting the outcome of games, however, this raises an interesting eigenvector problem that I have yet to solve. In this talk, I'll describe my rankings, give some rankings/predictions, describe the problems I've run into, and describe the future plans for improving my rankings.
Year: 2017
Name: Matt Rissler
Institution: Loras College
Subject area(s): Linear Algebra, Sports Analytics, Computing
Title of Talk: Ranking teams, predicting outcomes, tuning parameters and getting stuck
Abstract: I have been ranking sports for the last couple years, using a combination of a Markov Chain for determining the quality of a win based on the margin of victory, and a Markov Chain for aggregating results across the network of games. From this information, I've started predicting the outcome of games, however, this raises an interesting eigenvector problem that I have yet to solve. In this talk, I'll describe my rankings, give some rankings/predictions, describe the problems I've run into, and describe the future plans for improving my rankings.
ID:
165
Year: 2006
Name: Luz De Alba
Institution: Drake University
Subject area(s): Linear Algebra, Matrix Theory, Graph Theory
Title of Talk: Comparison of P-matrix completions with Q-matrix completions.
Abstract: A P-matrix is a real square matrix, in which the determinant of every principal submatrix is positive. A Q-matrix is one in which the sum of the determinants of principal submatrices of the same size is positive. Clearly every P-matrix is a Q-matrix. A partial P-matrix is a matrix in which some entries are specified while others are not known, and every fully specified principal submatrix has positive determinant. The P-matrix completion problem asks the question: "Which partial P-matrices can be completed to a P-matrix?" In this talk we give the definition of partial Q-matrix, and compare the Q-matrix completion problem to the P-matrix completion problem. We also discuss some partial answers to the Q-completion problem.
Year: 2006
Name: Luz De Alba
Institution: Drake University
Subject area(s): Linear Algebra, Matrix Theory, Graph Theory
Title of Talk: Comparison of P-matrix completions with Q-matrix completions.
Abstract: A P-matrix is a real square matrix, in which the determinant of every principal submatrix is positive. A Q-matrix is one in which the sum of the determinants of principal submatrices of the same size is positive. Clearly every P-matrix is a Q-matrix. A partial P-matrix is a matrix in which some entries are specified while others are not known, and every fully specified principal submatrix has positive determinant. The P-matrix completion problem asks the question: "Which partial P-matrices can be completed to a P-matrix?" In this talk we give the definition of partial Q-matrix, and compare the Q-matrix completion problem to the P-matrix completion problem. We also discuss some partial answers to the Q-completion problem.
ID:
381
Year: 2014
Name: Robert Todd
Institution: University of Nebraska at Omaha
Subject area(s): knot theory, undergraduate research
Title of Talk: Khovanov Homology: An undergraduate research project
Abstract: Khovanov homology is a sophisticated construction in knot theory, a branch of mathematics which is foreign and mysterious to many undergraduates. However, with only some linear algebra, some computer skills, and a little maturity as prerequisites, Khovanov homology can be used as a context to introduce many important mathematical ideas. I will discuss an on-going undergraduate research project whose goal is to compute the Khovanov homology of some families of knots. Such computations have only been performed for a handful of examples, thus our results will be of interest to researchers in the field. There will be many pictures and examples.
Year: 2014
Name: Robert Todd
Institution: University of Nebraska at Omaha
Subject area(s): knot theory, undergraduate research
Title of Talk: Khovanov Homology: An undergraduate research project
Abstract: Khovanov homology is a sophisticated construction in knot theory, a branch of mathematics which is foreign and mysterious to many undergraduates. However, with only some linear algebra, some computer skills, and a little maturity as prerequisites, Khovanov homology can be used as a context to introduce many important mathematical ideas. I will discuss an on-going undergraduate research project whose goal is to compute the Khovanov homology of some families of knots. Such computations have only been performed for a handful of examples, thus our results will be of interest to researchers in the field. There will be many pictures and examples.
ID:
110
Year: 2005
Name: Jenelle McAtee
Institution: University of Iowa
Subject area(s): knot theory, differential geometry
Title of Talk: Knots of Constant Curvature
Abstract: In this paper, we use the method of Richard Koch and Christoph Engelhardt to construct many knots of constant curvature.
Year: 2005
Name: Jenelle McAtee
Institution: University of Iowa
Subject area(s): knot theory, differential geometry
Title of Talk: Knots of Constant Curvature
Abstract: In this paper, we use the method of Richard Koch and Christoph Engelhardt to construct many knots of constant curvature.
ID:
428
Year: 2015
Name: Christine Caples
Institution: University of Iowa
Subject area(s): Knot Theory
Title of Talk: Tangle Classification
Abstract: A knot can be thought of as a knotted piece of string with the ends glued together. A tangle is formed by intersecting a knot with a 3-dimensional ball. The portion of the knot in the interior of the ball along with the fixed intersection points on the surface of the ball form the tangle. Tangles can be used to model protein-DNA binding, so another way to think of a tangle is in terms of segments of DNA (the strings) bounded by the protein complex (the 3-dimensional ball). Like knots, the same tangle can be represented by multiple diagrams which are equivalent under deformations (no cutting or gluing allowed). A tangle invariant is a value that is the same for equivalent tangles. Tangles can be classified into families which allows one to study properties of tangles that may be useful for solving tangle equations. This talk will be an introduction to knot theory and will investigate how tangle invariants can be used to classify tangles.
Year: 2015
Name: Christine Caples
Institution: University of Iowa
Subject area(s): Knot Theory
Title of Talk: Tangle Classification
Abstract: A knot can be thought of as a knotted piece of string with the ends glued together. A tangle is formed by intersecting a knot with a 3-dimensional ball. The portion of the knot in the interior of the ball along with the fixed intersection points on the surface of the ball form the tangle. Tangles can be used to model protein-DNA binding, so another way to think of a tangle is in terms of segments of DNA (the strings) bounded by the protein complex (the 3-dimensional ball). Like knots, the same tangle can be represented by multiple diagrams which are equivalent under deformations (no cutting or gluing allowed). A tangle invariant is a value that is the same for equivalent tangles. Tangles can be classified into families which allows one to study properties of tangles that may be useful for solving tangle equations. This talk will be an introduction to knot theory and will investigate how tangle invariants can be used to classify tangles.
ID:
297
Year: 2010
Name: Daniel Willis
Institution: Loras College
Subject area(s): K-12 Teaching; Geometry
Title of Talk: An Introduction to Logo
Abstract: An introduction to Logo (Turtle Geometry) using MSWLogo, a freeware version of Logo for 32-bit Windows. The talk will introduce basic commands, loops, procedures, and the use of variables, with applications to regular polygons, stars, tessellations, rotations, translations, reflections, and symmetry. The speaker has used Logo with teachers (and pre-service teachers) of elementary school, middle school, and high school mathematics.
Year: 2010
Name: Daniel Willis
Institution: Loras College
Subject area(s): K-12 Teaching; Geometry
Title of Talk: An Introduction to Logo
Abstract: An introduction to Logo (Turtle Geometry) using MSWLogo, a freeware version of Logo for 32-bit Windows. The talk will introduce basic commands, loops, procedures, and the use of variables, with applications to regular polygons, stars, tessellations, rotations, translations, reflections, and symmetry. The speaker has used Logo with teachers (and pre-service teachers) of elementary school, middle school, and high school mathematics.
ID:
328
Year: 2012
Name: Matt Rissler
Institution: Loras College
Subject area(s): Introductory Stats, Teaching with Technology
Title of Talk: Writing WeBWorK questions for Introductory Statistics
Abstract: WeBWorK is an Open-Source online homework system for Mathematics. The Open Problem Library contains many usable questions for Introductory Statistics. In this talk, I will discuss the current procedures for writing questions for Statistics and what improvements I have accomplished to simplify writing questions.
Year: 2012
Name: Matt Rissler
Institution: Loras College
Subject area(s): Introductory Stats, Teaching with Technology
Title of Talk: Writing WeBWorK questions for Introductory Statistics
Abstract: WeBWorK is an Open-Source online homework system for Mathematics. The Open Problem Library contains many usable questions for Introductory Statistics. In this talk, I will discuss the current procedures for writing questions for Statistics and what improvements I have accomplished to simplify writing questions.
ID:
313
Year: 2011
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Introductory Complex Analysis
Title of Talk: Just Plane Numbers
Abstract: The vocabulary of a typical introduction to complex numbers challenges the beginner with a bewildering array of words with strong connotations of "imaginary," "complex," and "non-real." By combining a geometric approach to complex arithmetic found in Roger Penrose's book "The Road to Reality" with the interactive geometry package, Geogebra, we show that it is possible and even insightful to characterize these as just plane numbers.
Year: 2011
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Introductory Complex Analysis
Title of Talk: Just Plane Numbers
Abstract: The vocabulary of a typical introduction to complex numbers challenges the beginner with a bewildering array of words with strong connotations of "imaginary," "complex," and "non-real." By combining a geometric approach to complex arithmetic found in Roger Penrose's book "The Road to Reality" with the interactive geometry package, Geogebra, we show that it is possible and even insightful to characterize these as just plane numbers.
ID:
454
Year: 2016
Name: John Hsieh
Institution: Iowa State University
Subject area(s): IBL
Title of Talk: IBL for an Undergraduate Bioinformatics Survey Course
Abstract: The Moore Method was originally developed by R.L. Moore to teach advanced mathematics in the college setting. There have been many adaptations of the Moore Method, under the broad term Modified Moore Method (M3), which are now classified as a variant of inquiry based learning (IBL). Despite the growing popularity of M3, it is rarely applied beyond mathematics. At Iowa State University, we designed and taught an “Introduction to Bioinformatics” survey course using M3 for the first time during Fall semester 2015. The class size was small (n=12), and students all had a background in the natural sciences, most in the biological sciences. Students had little to no formal training in computational sciences. During the 16-week course, students learned to: 1) work on a remote Linux server, 2) read and write Python code, 3) tackle classic bioinformatics problems, and 4) solve current bioinformatics problems with available tools. As with all M3 courses, learning objectives were met through carefully designed questions given to students prior to each class session. Class sessions were completely led by students (i.e., reversed classroom) presenting solution to the assigned questions. The application of M3 to our course has led to several desirable student outcomes: 1) engagement and ownership of the course material, 2) development of a strong sense of community, and 3) uniform learning outcomes. One of the difficulties we experienced with applying M3 was the creation of the course material. It was tough to create questions that were challenging enough without overwhelming the students.
Year: 2016
Name: John Hsieh
Institution: Iowa State University
Subject area(s): IBL
Title of Talk: IBL for an Undergraduate Bioinformatics Survey Course
Abstract: The Moore Method was originally developed by R.L. Moore to teach advanced mathematics in the college setting. There have been many adaptations of the Moore Method, under the broad term Modified Moore Method (M3), which are now classified as a variant of inquiry based learning (IBL). Despite the growing popularity of M3, it is rarely applied beyond mathematics. At Iowa State University, we designed and taught an “Introduction to Bioinformatics” survey course using M3 for the first time during Fall semester 2015. The class size was small (n=12), and students all had a background in the natural sciences, most in the biological sciences. Students had little to no formal training in computational sciences. During the 16-week course, students learned to: 1) work on a remote Linux server, 2) read and write Python code, 3) tackle classic bioinformatics problems, and 4) solve current bioinformatics problems with available tools. As with all M3 courses, learning objectives were met through carefully designed questions given to students prior to each class session. Class sessions were completely led by students (i.e., reversed classroom) presenting solution to the assigned questions. The application of M3 to our course has led to several desirable student outcomes: 1) engagement and ownership of the course material, 2) development of a strong sense of community, and 3) uniform learning outcomes. One of the difficulties we experienced with applying M3 was the creation of the course material. It was tough to create questions that were challenging enough without overwhelming the students.
ID:
54
Year: 2004
Name: David Gisch
Institution: University of Northern Iowa
Subject area(s): history, Geometry
Title of Talk: Apollonius
Abstract: In Tangencies, Apollonius of Perga shows how to construct a circle that is tangent to three given circles. More generally, Apollonius' problem asks to construct the circle which is tangent to any three objects, which may be any combination of points, lines, and circles. The case when all three objects are circles is the most complicated case since up to eight solution circles are possible depending on the arrangement of the given circles. Within the last two centuries solutions have been given by J. D. Gergonne in 1816, Frederick Soddy in 1936, and most recently David Eppstein in 2001. We illustrate the solutions using the geometry software Cinderella
Year: 2004
Name: David Gisch
Institution: University of Northern Iowa
Subject area(s): history, Geometry
Title of Talk: Apollonius
Abstract: In Tangencies, Apollonius of Perga shows how to construct a circle that is tangent to three given circles. More generally, Apollonius' problem asks to construct the circle which is tangent to any three objects, which may be any combination of points, lines, and circles. The case when all three objects are circles is the most complicated case since up to eight solution circles are possible depending on the arrangement of the given circles. Within the last two centuries solutions have been given by J. D. Gergonne in 1816, Frederick Soddy in 1936, and most recently David Eppstein in 2001. We illustrate the solutions using the geometry software Cinderella
ID:
49
Year: 2004
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): History of Mathematics, number theory
Title of Talk: How did Leonardo Pisano find three rational squares that differ by 5?
Abstract: This problem, which has often seemed intractable to students in a history of mathematics class, can in fact be approached in an understandable fashion, following Leonardo's own development in the Liber Quadratorum.
Year: 2004
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): History of Mathematics, number theory
Title of Talk: How did Leonardo Pisano find three rational squares that differ by 5?
Abstract: This problem, which has often seemed intractable to students in a history of mathematics class, can in fact be approached in an understandable fashion, following Leonardo's own development in the Liber Quadratorum.
ID:
255
Year: 2009
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): history of mathematics, mathematics education
Title of Talk: A Survey of MAA Study Tours and the Iowa Section
Abstract: Highlights of the MAA Study Tours, with special attention to the participation of members of the Iowa Section.
Year: 2009
Name: Joel Haack
Institution: University of Northern Iowa
Subject area(s): history of mathematics, mathematics education
Title of Talk: A Survey of MAA Study Tours and the Iowa Section
Abstract: Highlights of the MAA Study Tours, with special attention to the participation of members of the Iowa Section.