Skip to main content
Concord Academy

Math Club

DESCRIPTION

Each week Mondays at 6:30 in LABS 111 for recreational math and Thursdays at 6:30 in LABS 111 for math for competitions.  Everyone is welcome to attend every week or just once if you want to check it out.  Please reach out to a friendly cohead or advisor if you have questions.

 

Forum:

http://vbulletin.concordacademy.org/...search-Society

 

Student Officers:

Jason He & Raphi Kang.

 

Faculty or Staff Advisors:

Shawn Bartok

 

Recent work:

We plan to attend the Harvard MIT Math Tournament in November!  Please email any of the faculty advisor(s) or cohead(s) with questions or for more information.

 

Resources

List of summer math camps US​ (word doc)​​​

List of summer math camps in US (pdf)

 

Current Problem of the Fortnight:

Consider the 5x5 grid below:

pof grid.png

Assume that each square has a whole number between 1 and 9 with repeats allowed.  There are a lot of ways to fill this grid in!  We will treat a filled in grid like a word search, but instead we’ll look for numbers.  In particular, we will look for perfect squares that are two or three digits, e.g. we’re looking for 25 since 52=25 and we’re not looking for 2500 since it has four digits (even though 502=2500). 

Remember, we are approaching this like a word search so you can create a perfect square diagonally and even backwards!  This means that the perfect squares 144, 441, 25, & others are already included. 

The Problem:  Fill in the grid to give yourself as many unique, two/three digit perfect squares as possible.  Since there are 28 eligible perfect square you can’t possibly do better than 28.  I will consider a solution a winner if you find a grid that exceeds my best attempt or if your grid has more perfect squares than any other submitted solution.

N.B. It’s entirely possible that there is no way to get all 28 so don’t beat yourself up if you fall several short of that goal.
 

Solutions are due by 3:30 PM on 4/24.  Please direct all solutions to Shawn Bartok (office 212).