The Math and Computer Science Department received the 2017 William Putnam Mathematical Competition results. There were five Ashland University students that particpated, they were: Michael Woode, Emily Law, Kyle Puhl, Aaron Arnold and Kelly Luck. There were 4,638 participants from 575 institutions in this year's competition, with 2,291 (48.4%) receiving scores of 0. Unfortunately, all 5 of Ashland University's participants received scores of 0 this year, as well.
Thank you to all of you who participated in this year's exam.
Wednesday, February 21, 2018
School Science and Mathematics Recognizes Ashland University PSG
In the January 2018 issue of School Science and Mathematics, the Ashland University Problem Solving Group received credit for submitting a correct solution to Problem 5458. Emily Law was the primary author of the solution.
The editor incorrectly gave the credit to "The Honors Students at Ashland University," but on a positive note wrote, "But then The Honors Students at Ashland University in Ashland, Ohio upped the ante by finding additional ordered pairs..."
Congratulations to the Problem Solving Group.
Math Horizons Recognizes Ashland University PSG
Math Horizons recognized Ashland University's Problem Solving Group in their February, 2018 issue. PSG received credit for submitting a correct solution to Problem 358. Kyle Puhl was the primary author of the solution.
Congratulations to the Problem Solving Group.
Thursday, January 18, 2018
Walk-In Tutoring Spring 2018
Mathematics &
Computer Science
Walk-In Tutoring
Schedule Spring 2018
January 16 – April 26 _____________________________________________
Room 219 Kettering
Elementary Statistics – Math 208
Mondays 7:00
p.m. – 9:00 p.m.
Tuesdays TBA
Wednesdays 7:00 p.m. – 9:00 p.m.
Thursday 7:00 p.m. – 9:00 p.m.
(Simply
walk in and meet with the tutor as long as you need.)
___________________________________________
There is no cost for these tutoring services as
the support is provided by AU through your tuition.
Please see your
professor first for help!!!
Thursday, November 30, 2017
Study Break Coming Soon
Hey, all Math and Computer Science Department Students...
You are invited! Mark your calendars. The Math and Computer Science Department is hosting a Study Break on Monday, December 11 from 10:00 a.m. - 1:30 p.m. Stop in or stay the whole time in Patterson 204/211. There will be snacks and drinks for you!
Tuesday, November 21, 2017
Almni Share with Current Students
On November 7, 2017, the Department of Mathematics and Computer Science hosted a mathematics career panel. Jill (Montaquila) DeMatteis '89, Sarah (Hollewell) Black '95, Jeff Bonfiglio '96, and Ryan Wilson '07, shared with current students their career paths and gave advice for how best to prepare now for the unknown ahead.
Wednesday, November 8, 2017
Grace McCourt Added to OhioLINK Electronic Theses and Dissertations Center
Congratulations to Grace McCourt, whose thesis has been
added to the OhioLINK Electronic Theses & Dissertations Center. Grace's
is the 34th Ashland University Honors Thesis to join the more than 90,000
dissertations and theses in the OhioLINK ETD Center.
Grace McCourt presented a work
entitled, The Dishonest Salesperson
Problem. “In graph theory, a graph is a set of vertices connected by edges.
Consider a salesperson’s office that is located on a vertex v of a connected
graph G with n vertices. There are n-1 customers located at each of the other
vertices of the graph. The salesperson must make a driving trip whereby he or
she leaves the office, visits each customer exactly once and then returns to
the office. Because a profit is made on the mileage allowance, the salesperson
wants to drive as far as possible during the trip, which financially benefits
the salesperson at the loss of his or her employer, hence why the salesperson
is being described as dishonest. …What is the maximum possible distance he or
she can travel on such a trip, and how many different such trips are there? Problem
1654 from Mathematics Magazine first
posed and answered this question if the graph is a path graph, which represents
the office and customers as equally spaced along a straight road.” Grace
McCourt’s objective was to expand upon the result of Problem 1654 from Mathematics Magazine using combinatorics
and graph theory to derive results for the complete graph, in which each vertex
is connected to each other vertex by exactly one edge, and the hypercube, which
was defined in the presentation. McCourt also presented what was known for the
cycle graph, the complete bipartite graph, and the complete m-ary tree of
height h. Grace McCourt graduated May 2017 with a double major of Integrated
Mathematics Education and Mathematics. Her URCA Faculty sponsor was Dr. Chris
Swanson, a mathematics professor.
Subscribe to:
Comments (Atom)




