2016 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 1

Revision as of 04:29, 12 January 2019 by Timneh (talk | contribs) (Created page with "== Problem == Suppose there are <math>9</math> lights arranged on tic-tac-toe board so that one is in each square. Suppose further that there are six light switches one for e...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Suppose there are $9$ lights arranged on tic-tac-toe board so that one is in each square. Suppose further that there are six light switches one for each row and column. Flipping any of these switches turns on all lights that are off and turns off all lights that are in the column/row controlled by this switch. If there is exactly one light on, can you turn all the lights on using the given switches? As in all problems you need to explain your answer.

Solution

See also

2016 UNM-PNM Contest II (ProblemsAnswer KeyResources)
Preceded by
First question
Followed by
Problem 2
1 2 3 4 5 6 7 8 9 10
All UNM-PNM Problems and Solutions

[[Category:]]