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 16:30, BreadOfTheBear

Hi my sisters and brothers can tell me the answer because i don’t understand the question

Answers: 1

continue

Mathematics, 21.06.2019 21:00, OceanClaws

The area of a rectangle is 10 cm^2. one side of the rectangle is x cm. express the perimeter of the rectangle in terms of x and show that this rectangle cannot have a perimeter of 12 cm. the perimeter of the rectangle in terms of x is __ cm

Answers: 1

continue

Mathematics, 21.06.2019 21:30, happysage12

Every weekday, mr. jones bikes from his home to his job. sometimes he rides along two roads, the long route that is shown by the solid lines. other times, he takes the shortcut shown by the dashed line. how many fewer kilometers does mr. jones bike when he takes the shortcut instead of the long route?

Answers: 1

continue

Mathematics, 22.06.2019 00:00, Meliiiii

Afair die is cast four times. calculate the probability of obtaining exactly two 6's round to the nearest tenth of a percent

Answers: 1

continue

Do you know the correct answer?

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