Saturday, November 2, 2013
Southeast Missouri State University, Cape Girardeau, Missouri
Funding for this conference is provided by NSF grant DMS-0846477 through the MAA Regional
Undergraduate Mathematics Conference Program
Thank you for coming! We hope that you have a splendid day, and that you leave with some valuable
information and joyful memories. If you have any questions, please ask. We want to help!
Schedule
All Sessions are in room 200 Johnson Hall, Lunch & snacks are in 219 & 221 (Restrooms are downstairs)
9:00 – 9:55
9:55 - 10:05
10:05 – 10:50
10:50-11:00
11:00-11:15
11:15-11:30
11:30-11:35
Registration
Welcome and Opening Remarks By Chair Dr. Randolph and Dean McGowan
Invited Address
Wesley Calvert (SIUC)
Title: What Does a Random Number Look Like?
Abstract: Is there anything really random in the universe? How could we tell? And what would it be
like? Could certain things I can actually "see" be truly random? The digits of π, perhaps? After all,
they can't repeat, and that's enough to be random, isn't it? Or is it? If I had a number whose decimal
expansion had a one the 10-10k place for every positive integer k and zeros everywhere else, that never
repeats, but it doesn't look very random, either. Questions like these got me into math in the first place,
and I've been very happy to learn in the past few years that they actually have interesting answers --and random numbers often look like no number you've ever met.
Break/Questions
Student Talks – Room 200
Irina Stallion (Southeast Missouri State)
Title: Solving Journal Problems
Abstract: In this presentation, I will discuss the strategies I used to solve a mathematical journal
problem concerning the inequality a^4+b^4+c^4-3abc>3/8.
Le'Mark Russell (SIUC)
Title: Introduction to Quantum Mechanics with emphasis on information processing
Abstract: Quantum Mechanics has evolved from an experimental field of scientific study to an abstract
mathematical discipline. In this presentation, we present the mathematical postulates that form the basis
of Quantum Mechanics and present a mathematical understanding of quantum entanglement.
Break/Questions
11:35-11:50
Michael Ruddy (University of Tennessee at Martin)
Title: Positive Periodic Solutions for a Higher Order Functional Difference Equation
Abstract: In this presentation, we consider a higher order functional difference equation on Z with a
parameter lambda. Sufficient conditions are obtained for the existence of at least one or two positive
periodic solutions. The proof utilizes a fixed-point theorem.
11:50-12:05
Alex Dunn (Southeast MO State)
Title: The Birthday Problem
Abstract: This presentation takes a look at what's described as the "pigeonhole principal" and
uses an interesting birthday anomaly to explain its process. Using a statistical equation to
determine the chances of someone sharing your own birthday.
12:05– 12:15
12:15-12:30
12:30-12:45
12:45-1:35
1:35-1:50
1:50-2:05
2:05-2:10
2:10-2:25
2:25-2:40
2:40-2:45
2:45-3:00
3:00 - 3:15
Break/Questions
Ben Elwood (SIUC)
Title: An Introduction to Modular Forms
Abstract: In this presentation, I will introduce some essential concepts of modular forms, along with a
few examples, such as Eisenstein series. I will also briefly discuss some of their applications in areas of
mathematical physics such as string theory and black hole information.
Quanquan Li (Southeast MO State)
Title: Compare Classical Pivotal Quantity with Generalized Pivotal Quantity
Abstract: In statistical inference, we want to estimate the population parameter by constructing
confidence intervals by using a sample. We note that the nature of some problems is very complex, and
the Classical Pivotal Quantity method may not yield any satisfactory results. Therefore, we investigate
the applicability of the recent generalized variable approach. This generalized variable approach has
been used successfully to develop confidence intervals involving anon-standard parameters, such as
lognormal mean and normal quantiles. In my talk, I’m going to introduce the Classical Pivotal Quantity
method and Generalized Pivotal Quantity method, and make a comparison of two methods through
several examples.
Lunch Break
Minhua Zhu (Southeast MO State)
Title: Mathematics of Spider Webs
Abstract: This presentation will discuss the mathematics involved in the Spider Webs.
http://prezi.com/o_a7dxy-zmsg/arachnomatics-the-mathematics-of-spiders/
Maxwell Stone (Southeast MO State)
Title: The Golden Ratio and The Fibonacci Sequence
Abstract: I will explain the golden ratio and fibonacci sequence. I will discuss the mathematics behind
them. I will explain their appearance in nature and other aspects of life.
Break/Questions
Mansor Sufran (SIUC)
Title: Solving the Quintic by Series
Abstract: Scientists have showed and proved that quintic equation can not be solved by algebra
. I am going to show a method to solve the quintic and get it's roots by series. This method can
be even used for higher degrees of polynomials.
Hilary Packard (SIUC)
Title: Quantum Entanglement
Abstract: Quantum entanglement is one of the most fascinating facets of quantum mechanics research.
Many studies have been done on the subject, including Scrodinger's famous thought experiment
involving a cat and Einstein, Poldolsky and Rosen's EPR Paradox. Here we will take a brief look at
quantum entanglement and its significance in the world of quantum mechanics.
Break/Questions
Ben Kingen and Rebekah Layton (Southeast MO State)
Title: When does f-1 = 1/f?
Abstract: In this presentation, we will explore when the reciprocal of a function is its inverse. For
example, when x is a nonzero real number, x-1 represents its reciprocal 1/x. However, sin-1(x) is not
equal to 1/sin(x). We will be demonstrating when f-1 = 1/ f where f : X  Y denotes a bijective function
between two subsets of X and Y of the real numbers. We will discuss the domain and range of such a
function as well as some examples where the domain of f consists of only one or two points. Also,
through the composition and transformations of functions, we will be able to prove certain identities
that follow from f-1 = 1/ f.
Kolton Benoit (Southeast MO State)
Title: Math in Computer Programming: Loops
Abstract: Presentation briefly explains some basic programming commands of C++ and describes what
3:15 - 3:30
loops are. The different types of loops are explained and demonstrated with a basic example. Simple
math is used in a basic loop and a more complex nested loop, a loop within another loop.
Concluding Address and Door Prizes, By Dan Daly and Andy Schwartz
Please Return the Survey Before You Leave!