Satisfiability Problem · Problem Statement

Lesson 8

Nikolai Chukhin · Alexander S. Kulikov

Problem. How many satisfying assignments does the following formula have? \[(x_{1} \lor \overline{x_2}) \land (x_{2} \lor \overline{x_3}) \land (x_{3} \lor \overline{x_4}) \land \dotsb \land (x_{n-1}\lor \overline{x_n}) \land (x_{n} \lor \overline{x_1})\]

5 points