AIME 1996: Interesting Counting Question

Two of the squares of a 7 by 7 checkerboard are painted yellow, and the rest are painted green. Two color schemes are equivalent if one can be obtained from the other by applying a rotation in the plane of the board. How many inequivalent color schemes are possible?

How would you do this AIME question with Polya-Burnsides Theorem (also called Burnsides Lemma) instead of direct counting or casework?

#MathCompetitions

Note by Shaan Bhandarkar
7 years, 11 months ago

No vote yet
2 votes

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

I separated it into two cases but then I used the theorem you mentioned (though I had never heard it called that before). I've basically just thought of it as intentional overcounting.

First case, the two squares are mirror images if viewed across the central square. (In this case, there are 24 pairs of these points). You will essentially be doublecounting these though if you count all 24 (because you could flip the board 90 degrees on half of them and get the other half). Thus, this case only has 12.

Second case, the two squares are not mirror images. Total number of ways to pick 2 out of 49 squares is 49C2 = (49)(48) / (2)(1). However, we cannot include the 24 pairs we just counted in case 1. Note, in this case, you actually count each true possibility 4 times (because the board has four sides you can view from). This means that we need to do [49C2 - 24] / 4 for this case.

Case 1 + case 2 = 12 + [49C2 - 24]/4 = 300 possibilities

Owen Scott - 7 years, 11 months ago

Here's a link you might find helpful

Taehyung Kim - 7 years, 11 months ago
×

Problem Loading...

Note Loading...

Set Loading...