Mathematics, 06.01.2020 23:31 kayabwaller4589

There are n markers, each with one side white and the other side black, aligned in a row with their white sides up. at each step, if possible, we choose a marker with the white side up (but not one of the outermost markers), remove it, and reverse the two neighboring markers. prove that one can reach a configuration with only two markers left if and only if n − 1 is not divisible by 3.

Answers: 3

Show answers

Other questions on the subject: Mathematics

Mathematics, 21.06.2019 15:50, laylay120

Fredrick designed an experiment in which he spun a spinner 20 times and recorded the results of each spin

Answers: 1

continue

Mathematics, 21.06.2019 16:30, lanakay2006

We have enough material to build a fence around a station that has a perimeter of 180 feet the width of the rectangular space must be 3 1/4 feet what must the length be

Answers: 1

continue

Mathematics, 21.06.2019 18:10, lalaokawami0912

Find the smallest number by which the given number should be divided to make a perfect cube(with steps or the answer will get reported) a.108 b.2187

Answers: 1

continue

Mathematics, 21.06.2019 23:30, jlopez113

The bottom of ignacio's desktop is 74.5cm from the floor. ignacios sits in his adjustable chair, and the tops of his legs are 49.3cm from the floor. each clockwise rotation of the knob on the chair raises ignacio's legs by 4.8cm. write an inequality to determine the number of clockwise rotations, r, ignacio could make with the knob without his legs touching the desk.

Answers: 3

continue

You know the right answer?

There are n markers, each with one side white and the other side black, aligned in a row with their...