Induction and Science Bowl: Difference between pages

From Computer Science at Indiana State University
(Difference between pages)
Jump to navigation Jump to search
VisualWikitext
m 1 revision imported
 
 
Line 1: Line 1:
==Assignment (current)==
Since 2001, the Indiana State University has hosted the Indiana Regional of the DOE National Middle School Science Bowl each year. Currently, this is coordinated between the departments of Mathematical Sciences, and Electronics and Computer Engineering Technology. The competition normally takes place on the last Saturday in February in Root Hall on ISU's campus. The event is staffed mostly by ISU faculty and students, and receives financial support from ISU's College of Arts and Sciences.
You can use the following definitions and identities in the problems about binomial coefficients. Here I use the notation "(n choose k)" for [https://en.wikipedia.org/wiki/Binomial_coefficient binomial coefficients].
* (k choose 0) = 1, for any integer k >= 0
* if i < j, then (i choose j) = 0.
* (n+1 choose i+1) = (n choose i) + (n choose i+1). This holds for n >= i and for both being at least 0. You can see that this identity is true using the following reasoning. We want to choose i+1 items out of a group of n+1. Take the first of the n+1 items, let us call it x. If we choose x as one of the i+1 items, we need to choose n additional items out of the remaining i; that is we will have (n choose i) remaining options for how to end up with i+1 items. If we do not choose x as one of the i+1 items, then we need to choose i+1 items from the remaining n items. So we have the total number of choices as: (n choose i) + (n choose i+1). Note that this identity also shows up in [https://en.wikipedia.org/wiki/Pascal's_triangle Pascal's Triangle], where two items on a given row are added up to give an item in the next row.


Some problems are from [https://courses.csail.mit.edu/6.042/spring18/mcs.pdf MCS].  
=Contact=
Mr. Derrick Bowman, [mailto:Derrick.Bowman@indstate.edu Derrick.Bowman@indstate.edu], senior instructor of mathematics at ISU, is the coordinator for the event. Dr. Jeff Kinne, [mailto:jkinne@cs.indstate.edu jkinne@cs.indstate.edu], professor of computer science at ISU, is co-coordinator. Dr. Henjin Chi, professor emeritus of mathematics at ISU, was the founder of the event.


Some hints/notes/comments are in ''italics''.
'''Volunteers - [https://docs.google.com/document/d/1xhx1JUrrGg9Ke5dmA0ae8EDJD_1ASDOCH3IraVy96b4/edit?usp=sharing start here (FAQ)]'''


# Prove a formula. Use induction to prove the first and third identities listed here: https://en.wikipedia.org/wiki/List_of_mathematical_series#Binomial_coefficients_2
'''Teams - information on parking, lunch, etc. is below. The schedule of matches is here - [https://docs.google.com/spreadsheets/d/1fZGm8Hoiunyxx1p77haPAwu-I43YV1usxJRePlmLyYk/edit?usp=sharing 2026 Schedule and Results.] We will have copies of a printout of the schedule, etc. for everyone. We will have a printout of the rules and score sheets for coaches.'''
## Prove that the summation of (n choose k) for k=0 up to n, is equal to 2<sup>n</sup>. <br>''Prove the base case for the smallest n that it is true for. In this case that is n=0. For the inductive step you have to do it in general for n going to n+1. Just showing the next value of n after the base case is not enough. I am asking you to prove this using induction, not using the binomial theorem. ''
## Prove that the summation of (k choose m) for k=0 up to n, is equal to ( (n+1) choose (m+1)).
# Prove an inequality.  MCS Problem 5.5 - prove that 1 + (1/4) + (1/9) + ... + (1/n<sup>2</sup>) < 2 - 1/n.  <br> ''Note - do /not/ use the exact formula for what the LHS is; rather just use induction and algebra. Note that the claim is /not/ true for n=1, so that should not be your base case.''
# Where are given incorrect proofs wrong. Potential problem areas to consider: base case(s), how the base case(s) is/are used, inductive argument. <br>''I am looking for you to find where precisely in the bad proof the problem is. It is not enough to "just" argue that the claim is wrong - I want to see where in their proof they are wrong. For wrong induction proofs, the most common places to look are: base case does not hold (even though the inductive argument might work), inductive argument would work but assumes more from the base case than was shown.''
## MCS Problem 5.22, a false claim that every Fibonacci number is even.
## MCS Problem 5.7, a false claim that 2 + 3 + ... n = n*(n+1)/2.
# Prove something geometric, MCS Problem 5.10.  Note that both parts (a) and (b) in the problem should be proved by induction. Note that the "length" of a DET in the problem will always be a power of 2 (they double when you make the next larger DET), so for the inductive step you will be going from n (which you assume is a power of 2) and arguing what happens for length 2n.


Other problems that would normally be assigned, but not this time.
=Competition Format=
* Prove a recursive algorithm is correct.  
Teams compete from different schools. A team is 4 or 5 middle school students, with 4 competing at any given time. The moderator reads "toss up" questions from different categories of math and science (see the link to sample questions below), and the first person to ring in gets a chance to answer. When a toss-up question is answered correctly, the team gets 4 points and a chance at a "bonus" question that the team discusses as a team. Bonus questions are worth 10 points. See the link below to the official rules for more details.
* Prove a graph property.


==Assignment (old)==
All teams compete in a round robin fashion during the morning. After lunch, the top 8 teams (based on results from the round robin rounds) compete in a double-elimination tournament to determine the winner of the region. Teams that are eliminated can stay to watch other matches or compete in "fun rounds" after they are eliminated.
Some problems are from [https://courses.csail.mit.edu/6.042/spring18/mcs.pdf Mathematics for Computer Science].


# See the proof related to tiling from the Induction (II) page in the OneNote notes (in the Proofs section). Consider an 8x8 board with the "red" or missing square being the one in the lower right corner.  Show how the proof by induction would construct a valid tiling for this board.
=Date and Time=
# Consider the formula for a geometric sum. This is given in MCS problem 5.4 and also [https://en.wikipedia.org/wiki/Geometric_series#Sum here] on Wikipedia. Study the proof of the formula using induction and practice giving this proof to yourself (on the board, on paper, or in a document). Visit the CS help lab and give a demo of the proof to one of the lab assistants.  You will have at most 10 minutes to complete the argument, and if you cannot get it by then you will need to come back and try again another time.  If you are able to give the proof properly, the lab assistant will let you know that you have completed it and they will sign off on it in [https://sycamoresindstate-my.sharepoint.com/:x:/g/personal/jeffrey_kinne_indstate_edu/ESbWO8QmBg9Jn9-ufDqR6_EBPzUbhzjVjyyzAPEAcjbMgg?e=XBpLEa this document].
The regional competition is normally the last or second-to-last Saturday in February. The date is normally approved and announced in the summer for the following year. The contest normally begins around 8-9am, with teams arriving at least 15 minutes early to check-in on site. The final match of the contest is normally around 4:30pm.
# MCS problem 5.2 - finding the problem in an incorrect induction proof for a tiling problem.
# MCS problem 5.7 - finding the problem in an incorrect induction proof for an arithmetic sum.
# MCS problem 5.12 - prove the distributive law of intersection over union.
# MCS problem 5.13 - prove a formula about the area of the Koch snowflake fractal.
# MCS problem 5.17 - prove a formula about the number of satisfying assignments for a certain logical formula construction.
# MCS problem 5.23 - determine what is true given certain assumptions.
# MCS problem 5.28 - determine what is true and prove it using induction, see also problem 5.32.
# MCS problem 5.31 - a strong induction proof that is a little tricky.


===Grading notes===
For 2026, the contest will be on Saturday Feb 7, with team check-in at 8:30am and the last match of the day concluding by around 4:30. Team check-in will be in the main first floor hall of Root Hall.
Some overall grading notes based on assignments turned in for those.
* Please make sure your solutions are in the right order when you hand them in - don't make me look through all of your files for each problem.
* Be careful about how you word things with your induction proofs. You /prove/ the base case(s) (oftentimes it is enough to plug in numbers to verify that a formula holds, but sometimes you do have something you need to prove). For the inductive part, you /assume/ the inductive assumption and must /show/ or /demonstrate/ that it works for k+1 or n+1 (you don't /assume/ that it is true for k+1 or n+1).
* The base cases need to be proved (though sometimes the proof for a base case is really just plugging in numbers and verifying that it works).
* You need to have enough explanation for someone to read this, understand it, and be completely convinced.  It is not enough to just have a sequence of equations with no explanation.
* For the base cases, you will work out what the base case is, and you need to have a sentence something like - "and this is correct because ...", with the because part depending on the problem. The point is - you don't assume the reader finishes the thought in their mind, you have to finish the thought for them.


And some grading notes particular to each problem.
=Location=
#
The contest takes place in the basement classrooms in Root Hall on ISU's campus. The address is 424 N. 7th Street, Terre Haute, Indiana 47809. Team check-in is in room A-011 in the basement. See [http://maps.google.com/maps/ms?msa=0&msid=202482877780754297710.0004ad7bf1654f4d6c424&ie=UTF8&ll=39.471589,-87.407055&spn=0.001202,0.012038&t=m&source=embed this google map] for the location of Root Hall. Note that all parking lots at ISU are free on the weekend (with the exception of gated or metered lots, none of which are very close to Root Hall). There are parking lots close to the department off of 7th, 8th, and 9th streets. For more on visiting ISU, see the [https://indianastate.edu/map interactive map] or [https://indianastate.edu/sites/default/files/2024-12/university-map.pdf printable map].
#* I gave credit as long as you had a valid tiling and showed how it was built from four 4x4 tilings. I was hoping you would explain it nicely in terms of tracing the induction argument backwards from the 8x8 board, but I gave credit even if you did not explain it this way.
 
#* Note that there should only be one triomino that goes between the different 4x4 sections, and it should be the one from the induction argument. If you gave a valid 8x8 tiling but one that could not have resulted from the inductive argument, you do not get full credit.
=Detailed Schedule and Results=
#
The schedule of matches for the 2025 contest is linked below. The top 8 teams will continue competing after lunch in a double elimination tournament, with the last match around 4 or 4:30pm. Teams that are eliminated often stick around for a bit to have some "fun round" matches against parents or each other - rooms that no longer have matches in them will be left open for a period of time for this.
#* Make sure you visited the lab to demonstrate the proof - that is what this question was asking you to do.
 
#* Note that as long as you were checked off as okay by the lab I did not look at anything you might have handed in for this problem (some people included the proof in their submission in canvas).
The results and schedule from recent years are in the following -
#
 
#* I gave credit as long as you identified a problem in either the statement itself or where that shows up in the bad proof. I really wanted you to find where in the bad proof it was wrong, but as long as you identified why the claim is not true I gave credit.
* [https://docs.google.com/spreadsheets/d/1hoAyUOOM6QY2Nqv_aWm-qoZqxgp0QsCR6K1R3j80QRc/edit?usp=sharing 2025 Schedule and Results]
#* Note that the base case for n=0 /does/ work. Check what the text has for the P(n) statement when it was proved in the chapter, and that does work for n=0. So that is not the problem with the proof.
* [https://docs.google.com/spreadsheets/d/1rYXptWcJyCAoQGpCY51nEhqJjjnk5YF3D9baet_UoZk/edit#gid=588263783 2024 Schedule and Results]
#
* [https://docs.google.com/spreadsheets/d/1u6LeObav0dnKB-7FVmSRPv5_DrfktcNb-GiL92YM_YE/edit?usp=sharing 2023 Schedule and Results]
#* It is not enough to pick a random value of n and check that the /claim/ does not work for that value of n. You need to look at the /bad proof/ and determine where exactly it is wrong.
* [https://docs.google.com/spreadsheets/d/1JadvBO0JA_uEEOC4xHuJqpOUByrrKPb9STnTNYgDCbc/edit?usp=sharing 2022 Schedule and Results]
#* The base case for n=0 /is/ true, so that is not the problem.
* [https://docs.google.com/spreadsheets/d/10JReQM6gW6--mYU2QPLz7jBonFgcbr733RkuTRuCs70/edit?usp=sharing 2021 Schedule and Results]
#
* [https://docs.google.com/spreadsheets/d/1b0co6xDtdlSJrMOCSbpJAYdwxDsdJ-p-4GB8W7hIULk/edit?usp=sharing 2020 Schedule and Results]
#* Note that I did not expect you to prove the n=2 case. That is in the text, so I was assuming you should just state that this base case was already proved.
* [https://docs.google.com/spreadsheets/d/1m345BKzFW8aEBuho5XyODuYvbixLki1JLO_s2wTaZT4/edit?usp=sharing 2019 Schedule and Results]
#* You should make use of induction. Some of you gave something for your inductive step that doesn't actually use the inductive assumption - you more or less argued for the inductive claim directly.  For this problem you should make it a real induction proof (which ends up being shorter and simpler than trying to argue it without induction).
* [https://docs.google.com/spreadsheets/d/1eKG_I-QeiJhe1qIUnOBW1OvrqGjV3tYbF8EO9TvF0h0/edit?usp=sharing 2018 Schedule and Results]
#
* [https://docs.google.com/spreadsheets/d/1tc_raqlgBEUgazfidwg3MELa28zQeixGn5SlrPvq6G4/edit?usp=sharing 2017 Schedule and Results]
#* You need to justify why your formulas are the way they are - length of the side, number of new little triangles, area of the new little triangles, etc.
 
#* Be careful with your notation. Use the same notation that is used in the book (in terms of what a_n means, s_n, etc.). If you make up new notation (e.g., side length at the n-th iteration) then be consistent with it. If you use notation one way in part of your solution and another way in a different part, then your solution is incorrect (since it is not consistent).
=National Competition=
#
The winning team from each regional contest, including the Indiana Regional, is invited to participate in the national contest in Washington, D.C. The Department of Energy pays for the trip for each winning team (team members and coach) to travel to Washington, D.C. The national event is normally during the last week of April or first week in May, from a Thursday to Monday.
#* For part a) you need to explain why it works in general, not just for the first few values of n. In general, showing something works for the first few values of n is /not/ a proof.
 
#* Make sure to check your work - a number of people ended up with an expression for T_{k+1} that is not actually correct.
=Eligibility=
#
The middle school regional contest is for middle school students only (grades 6, 7, 8). A separate competition for high school students takes place in Indianapolis; see [https://science.osti.gov/wdts/nsb/Regional-Competitions/High-School-Regionals/ High School Regionals] for details. Teams must be approved by the school principal. The Indiana Regional normally takes teams from Indiana, Michigan, and Ohio.
#* Note that the range of values for n is 0, 1, 2, 3, ... in this problem.
 
#* For part a), an item is "true" if the assumption in the part (together with knowing that P(n) -> P(n+3) and that P(5) is true) would imply the conclusion. For part b) remember that we still know that P(n) -> P(n+3) for all n >= 0.
=Refreshments and Lunch=
#* For both parts, pay attention to whether n is qualified in what is being asked (e.g., is it asking for all n or just for some).
Lunch will be in the Sycamore Dining Hall (401 Chestnut St. and labeled on the google map). Each team coach is given a meal card with sufficient funds for 7 meals (5 team members plus two coaches) at the Sycamore Dining Hall (dining hall serving brunch, buffet style). Family members can join teams and pay for their own meals (about $12-13 per person).
#
 
#* Like the other problems, this should be a proof - you need to explain and convince the person reading that the statement is true. It is not enough to "just" show your work that you convinced yourself that it works out.
Light refreshments (Square Donuts, fruit, cookies, drinks) are provided in the morning and afternoon for all who are present.
#* Note that you can figure out which ones it will work for by just starting with each value of n=1, n=2, etc. to see which ones work, until you start to see what the answer will be. You still need a proof after that too.
 
#* The inductive step for this one is a little different. In most of the other induction proofs, we assume up to n and then look at n+1. For the n+1 case we normally make use of the claim for n. For this one, if you are looking at n+1 it makes more sense to use the claim for n+1-4 or n+1-7. Also note that the inductive assumption is /not/ that we can do all integers up to n, because some values of n /cannot/ be done (e.g., 13); rather the inductive assumption will be that all values of n starting from a particular value up to n can be done.
=Registration=
#* It is possible on this problem (and on induction problems in general) to have a claim that is correct, with a correct proof, but that does not include /all/ of the cases that can be done. For example, you might claim that all multiples of 28 work for this problem; that is true, but that does not include /all/ of the ones that work.
See the official information about the Indiana Regional at the DOE at the link below for information about registering. Registration normally opens sometime in October.
#
 
#* Note that the problem is suggesting to use /strong/ induction. With normal induction, if you are trying to show the induction hypothesis for n, you use the assumption it is true for n-1. With strong induction, rather than using the assumption for n-1, you look at some smaller value(s) (e.g., n/3).
=Registration Fee=
#* Note that in your induction arguments, be careful to keep track of what you are assuming about n. If your induction argument only works for n >= 5 (for example) then you would need to check the base cases up to that point.
Coaches should ensure the team registration fee is paid. This can be brought the day of the contest or mailed ahead of time. If paying by check, please make the check out to Indiana State University with Science Bowl in the memo line. Checks can be mailed to
#* Most ways to do this problem will need some already known inequalities. For example, 1+x <= e**x for all x>=0 (though this is not one that you will need). You can check for these with desmos or some other graphing site/app.
 
<blockquote>
ECET Department, attn Science Bowl<br>
Indiana State University<br>
650 Cherry St.<br>
Terre Haute IN, 47809<br>
</blockquote>
 
If you need a receipt for payment please let us know at the contest.
 
=Rules for Spectators=
The following are NOT ALLOWED during competition.
 
* Electronic devices
* Pictures/video (you can take pictures/video before or after matches)
* Writing
* Talking/whispering
* Ringing phone
* Entering room during match<br>
''You may only enter the room during halftime or in between matches.''
* The team coach ONLY may keep score on the DOE scoresheet.
 
The team members ONLY may challenge during the contest, BEFORE the next question.
 
The national DOE NSB office has also asked us to more closely monitor who is present at the regional events. It should only be those who are competing, their coaches, and families. We have the right to 1) ask to see a photo ID from everyone, ages 19 and over, who attends the regional and 2) request the name, city, and state of everyone, ages 18 and younger.
 
=Resources=
* Official information at DOE website -  [https://science.osti.gov/wdts/nsb/Regional-Competitions/Middle-School-Regionals Middle School Regionals],[https://science.osti.gov/wdts/nsb/Regional-Competitions/Resources Rules], [https://www.youtube.com/channel/UC_rhpi0lBeD1U-6nD2zvlBA DOE Science Youtube] (includes videos of championship match), [https://science.osti.gov/wdts/nsb/Regional-Competitions/Resources/MS-Sample-Questions Sample questions]
* Material to study: [http://www.physics4kids.com/ physics4kids], [http://www.cosmos4kids.com/ cosmos4kids], [http://www.biology4kids.com/ biology4kids], [http://www.chem4kids.com/ chem4kids], [http://www.geography4kids.com/ geography4kids], [http://mathguy.us/MathHandbooks.php mathguy]
* Math Counts - [https://www.mathcounts.org/resources/school-handbook school handbook], [https://www.mathcounts.org/programs/competition-series/past-competitions past competitions], [https://www.mathcounts.org/resources/problem-archive problem of the week]
* DOE Middle School Science Bowl info at [https://en.wikipedia.org/wiki/National_Middle_School_Science_Bowl wikipedia]
* Short Science Videos - [https://www.youtube.com/user/pbsdigitalstudios PBS Digital Studios]
* [http://cs.indstate.edu/%7Ejkinne/kids/scienceBowlTimer.html Timer/scoring web app] that we use ([http://cs.indstate.edu/~jkinne/kids/scienceBowlTimer_2021.html modified for 2021 regionals]), or '''[https://cs.indstate.edu/~jkinne/kids/scienceBowlTimer_new.html Timer/scoring for 2026]'''
* [https://buzzin.live/ A free online buzzer website]
* [http://buzzersystems.com/deluxe/index.htm Buzzer system] that we use
* [https://cs.indstate.edu/info/files/scoresheet_big2.pdf Score sheets] that coaches may fill in during a match
* Volunteers - first look at some sample questions linked above, read Rules linked just above, watch some of the national finals for middle school (linked above), and then check [https://docs.google.com/document/d/1xhx1JUrrGg9Ke5dmA0ae8EDJD_1ASDOCH3IraVy96b4/edit?usp=sharing FAQ for Judges/Volunteers].  See also the DOE NSB information for volunteers: [https://science.osti.gov/wdts/nsb/Volunteers NSB Volunteers].
 
=Historical Results=
The winning teams at the Indiana Middle School Regional have been as follows, in bold. 2nd through 5th place are also given for years that we still have this data. For all years except 2021 and 2022, there is a tie for 5th place due to the double elimination format that is normally used. If a school is listed twice in a year, then this is for two of their teams. For the winning team, if we know what their final place was at nationals that is listed in (). Our regional winner has won the national competition in 2013, 2007, 2006, and 2005.
 
* 2025: '''Creekside Middle School''' (top 24 at nationals), Sycamore, Meyzeek, Creekside, Sycamore, Woodrow Wilson
* 2024: '''Sycamore School''' (tied for 7th at nationals), Sycamore, Creekside, Clague, Mason, Creekside
* 2023: '''Sycamore School''' (tied for 5th at nationals, Clague, Sycamore, Creekside, Woodrow Wilson, Creekside
* 2022: '''Sycamore School''' (top 9 at nationals), Creekside, Clague, Creekside, Cranbrook
* 2021: '''Sycamore School''', Mason, Creekside, Clague, Creekside
* 2020: '''Sycamore School''' (top 32 at nationals), Sycamore, Clague, Mason, Greenhills, Honey Creek
* 2019: '''Sycamore School''', Sycamore, Honey Creek, Creekside, Woodrow Wilson, St. Patrick
* 2018: '''Creekside Middle School''' (tied for 7th at nationals), Sycamore, Creekside, Honey Creek, Woodrow Wilson, Honey Creek
* 2017: '''Sycamore School''' (tied for 7th at nationals), Creekside, Creekside, Sycamore, Honey Creek, Greenhills
* 2016: '''Sycamore School (second place at nationals)'''
* 2015: '''Sycamore School''' (tied for 7th at nationals)
* 2014: '''Sycamore School'''
* 2013: '''Creekside Middle School (first place at nationals)'''
* 2012: '''Creekside Middle School''' (tied for 13th at nationals)
* 2011: '''Sycamore School'''
* 2010: '''Klondike Middle School'''
* 2009: '''Honey Creek Middle School'''
* 2008: '''Honey Creek Middle School'''
* 2007: '''Honey Creek Middle School (first place at nationals)'''
* 2006: '''Honey Creek Middle School (first place at nationals)'''
* 2005: '''Honey Creek Middle School (first place at nationals)'''
* 2004: '''Honey Creek Middle School'''
* 2003: '''Honey Creek Middle School'''
* 2002: '''Honey Creek Middle School'''
* 2001: '''Honey Creek Middle School'''
 
Note: tshirt colors that have been used in recent years - [https://cs.indstate.edu/files/tshirt_2026.jpg jade dome], [https://cs.indstate.edu/files/tshirt_2025.jpg yellow], [https://cs.indstate.edu/files/tshirt_2024.jpg purple], [https://cs.indstate.edu/files/tshirt_2023.png red/maroon], [https://cs.indstate.edu/files/tshirt_2022.png orange], [https://cs.indstate.edu/files/tshirt_2021.png grey], [https://cs.indstate.edu/files/tshirt_2020.png navy].

Revision as of 18:47, 5 February 2026

Since 2001, the Indiana State University has hosted the Indiana Regional of the DOE National Middle School Science Bowl each year. Currently, this is coordinated between the departments of Mathematical Sciences, and Electronics and Computer Engineering Technology. The competition normally takes place on the last Saturday in February in Root Hall on ISU's campus. The event is staffed mostly by ISU faculty and students, and receives financial support from ISU's College of Arts and Sciences.

Contact

Mr. Derrick Bowman, Derrick.Bowman@indstate.edu, senior instructor of mathematics at ISU, is the coordinator for the event. Dr. Jeff Kinne, jkinne@cs.indstate.edu, professor of computer science at ISU, is co-coordinator. Dr. Henjin Chi, professor emeritus of mathematics at ISU, was the founder of the event.

Volunteers - start here (FAQ)

Teams - information on parking, lunch, etc. is below. The schedule of matches is here - 2026 Schedule and Results. We will have copies of a printout of the schedule, etc. for everyone. We will have a printout of the rules and score sheets for coaches.

Competition Format

Teams compete from different schools. A team is 4 or 5 middle school students, with 4 competing at any given time. The moderator reads "toss up" questions from different categories of math and science (see the link to sample questions below), and the first person to ring in gets a chance to answer. When a toss-up question is answered correctly, the team gets 4 points and a chance at a "bonus" question that the team discusses as a team. Bonus questions are worth 10 points. See the link below to the official rules for more details.

All teams compete in a round robin fashion during the morning. After lunch, the top 8 teams (based on results from the round robin rounds) compete in a double-elimination tournament to determine the winner of the region. Teams that are eliminated can stay to watch other matches or compete in "fun rounds" after they are eliminated.

Date and Time

The regional competition is normally the last or second-to-last Saturday in February. The date is normally approved and announced in the summer for the following year. The contest normally begins around 8-9am, with teams arriving at least 15 minutes early to check-in on site. The final match of the contest is normally around 4:30pm.

For 2026, the contest will be on Saturday Feb 7, with team check-in at 8:30am and the last match of the day concluding by around 4:30. Team check-in will be in the main first floor hall of Root Hall.

Location

The contest takes place in the basement classrooms in Root Hall on ISU's campus. The address is 424 N. 7th Street, Terre Haute, Indiana 47809. Team check-in is in room A-011 in the basement. See this google map for the location of Root Hall. Note that all parking lots at ISU are free on the weekend (with the exception of gated or metered lots, none of which are very close to Root Hall). There are parking lots close to the department off of 7th, 8th, and 9th streets. For more on visiting ISU, see the interactive map or printable map.

Detailed Schedule and Results

The schedule of matches for the 2025 contest is linked below. The top 8 teams will continue competing after lunch in a double elimination tournament, with the last match around 4 or 4:30pm. Teams that are eliminated often stick around for a bit to have some "fun round" matches against parents or each other - rooms that no longer have matches in them will be left open for a period of time for this.

The results and schedule from recent years are in the following -

National Competition

The winning team from each regional contest, including the Indiana Regional, is invited to participate in the national contest in Washington, D.C. The Department of Energy pays for the trip for each winning team (team members and coach) to travel to Washington, D.C. The national event is normally during the last week of April or first week in May, from a Thursday to Monday.

Eligibility

The middle school regional contest is for middle school students only (grades 6, 7, 8). A separate competition for high school students takes place in Indianapolis; see High School Regionals for details. Teams must be approved by the school principal. The Indiana Regional normally takes teams from Indiana, Michigan, and Ohio.

Refreshments and Lunch

Lunch will be in the Sycamore Dining Hall (401 Chestnut St. and labeled on the google map). Each team coach is given a meal card with sufficient funds for 7 meals (5 team members plus two coaches) at the Sycamore Dining Hall (dining hall serving brunch, buffet style). Family members can join teams and pay for their own meals (about $12-13 per person).

Light refreshments (Square Donuts, fruit, cookies, drinks) are provided in the morning and afternoon for all who are present.

Registration

See the official information about the Indiana Regional at the DOE at the link below for information about registering. Registration normally opens sometime in October.

Registration Fee

Coaches should ensure the team registration fee is paid. This can be brought the day of the contest or mailed ahead of time. If paying by check, please make the check out to Indiana State University with Science Bowl in the memo line. Checks can be mailed to

ECET Department, attn Science Bowl
Indiana State University
650 Cherry St.
Terre Haute IN, 47809

If you need a receipt for payment please let us know at the contest.

Rules for Spectators

The following are NOT ALLOWED during competition.

  • Electronic devices
  • Pictures/video (you can take pictures/video before or after matches)
  • Writing
  • Talking/whispering
  • Ringing phone
  • Entering room during match

You may only enter the room during halftime or in between matches.

  • The team coach ONLY may keep score on the DOE scoresheet.

The team members ONLY may challenge during the contest, BEFORE the next question.

The national DOE NSB office has also asked us to more closely monitor who is present at the regional events. It should only be those who are competing, their coaches, and families. We have the right to 1) ask to see a photo ID from everyone, ages 19 and over, who attends the regional and 2) request the name, city, and state of everyone, ages 18 and younger.

Resources

Historical Results

The winning teams at the Indiana Middle School Regional have been as follows, in bold. 2nd through 5th place are also given for years that we still have this data. For all years except 2021 and 2022, there is a tie for 5th place due to the double elimination format that is normally used. If a school is listed twice in a year, then this is for two of their teams. For the winning team, if we know what their final place was at nationals that is listed in (). Our regional winner has won the national competition in 2013, 2007, 2006, and 2005.

  • 2025: Creekside Middle School (top 24 at nationals), Sycamore, Meyzeek, Creekside, Sycamore, Woodrow Wilson
  • 2024: Sycamore School (tied for 7th at nationals), Sycamore, Creekside, Clague, Mason, Creekside
  • 2023: Sycamore School (tied for 5th at nationals, Clague, Sycamore, Creekside, Woodrow Wilson, Creekside
  • 2022: Sycamore School (top 9 at nationals), Creekside, Clague, Creekside, Cranbrook
  • 2021: Sycamore School, Mason, Creekside, Clague, Creekside
  • 2020: Sycamore School (top 32 at nationals), Sycamore, Clague, Mason, Greenhills, Honey Creek
  • 2019: Sycamore School, Sycamore, Honey Creek, Creekside, Woodrow Wilson, St. Patrick
  • 2018: Creekside Middle School (tied for 7th at nationals), Sycamore, Creekside, Honey Creek, Woodrow Wilson, Honey Creek
  • 2017: Sycamore School (tied for 7th at nationals), Creekside, Creekside, Sycamore, Honey Creek, Greenhills
  • 2016: Sycamore School (second place at nationals)
  • 2015: Sycamore School (tied for 7th at nationals)
  • 2014: Sycamore School
  • 2013: Creekside Middle School (first place at nationals)
  • 2012: Creekside Middle School (tied for 13th at nationals)
  • 2011: Sycamore School
  • 2010: Klondike Middle School
  • 2009: Honey Creek Middle School
  • 2008: Honey Creek Middle School
  • 2007: Honey Creek Middle School (first place at nationals)
  • 2006: Honey Creek Middle School (first place at nationals)
  • 2005: Honey Creek Middle School (first place at nationals)
  • 2004: Honey Creek Middle School
  • 2003: Honey Creek Middle School
  • 2002: Honey Creek Middle School
  • 2001: Honey Creek Middle School

Note: tshirt colors that have been used in recent years - jade dome, yellow, purple, red/maroon, orange, grey, navy.

Retrieved from "https://cs.indstate.edu/web/index.php?title=Induction&oldid=647"