Discovery Learning: Green Group (in Pre-Algebra and below)
Speaker: Dr. Sinjini Sengupta, Texas A&M University
Title: I Walk the Line
Abstract: You live in a city where the roads lie on a grid. Your house is in one corner of the grid. Everyday, you walk to school at the opposite end of the grid. How many different ways can you walk to school? Suddenly there is a zombie infestation. How many ways can to walk to school, avoiding the zombies?
Discovery Learning: Blue Group (in Algebra I and/or Geometry)
Speaker: Dr. Phil Yasskin, Texas A&M University
Title: a+b+ab problem
Abstract: Write down the numbers from 1 to 100. Randomly select 2 numbers from the list, say a and b, and cross them off, but add to the list the number a+b+ab. You now have 99 numbers. Repeat this process until you have only 1 number left. What are all possible final numbers?
Discovery Learning: Red Group (in Algebra II)
Speaker: Dr. Kun Wang, Texas A&M University
Title: Ford Circles
Abstract: Starting with two circles tangent to the real line at 0 and 1, each with radius 1/2, we can construct a third circle tangent to the real line and also tangent to both of the first two circles. Repeating this process yields an infinite family of circles, each tangent to the real line and to two neighboring circles. These are known as Ford circles. A natural question is: What can we say about the positions of their centers and the sizes of their radii?
Discovery Learning: Green Group (in Pre-Algebra and below) and Blue Group ( Algebra I and Geometry)
Speaker: Dr. Phil Yasskin, Texas A&M University
Title: Light Bulbs
Abstract: We will be exploring factorization patterns through a game where all of the lightbulbs are turned off, and when a person walks down the hallway, they pull the string of certain lights to turn them on based on the number on their shirt. We will predict and prove solutions to scenarios with a small fixed number of lightbulbs and look into patterns to solve larger quantities.
Discovery Learning: Green Group (in Pre-Algebra and below) and Blue Group ( Algebra I and Geometry)
Speaker: Dr. John Weeks, Texas A&M University
Title: Chess at Maximum Capacity
Abstract: Given a set S of allowed chess pieces, we say the capacity of an m-by-n chessboard (with respect to) S is the maximum number of chess pieces from S that can be placed on the chessboard so that no one piece attacks another. We will explore this problem with small boards, set up an integer programming problem to help find the maximum capacity, then learn a few tricks that help us find the board states that achieve this capacity. Knowing how to play chess is not required.