2000 people are sitting around a round table. Each one of them is either a truth-sayer (who always tells the truth) or a liar (who always lies). Each person said: "At least two of the three people next to me to the right are liars". How many truth-sayers are there in the circle?
IL-GILLIS 2023
Israel National Olympiad 2023.
Other problems
The non-negative integers satisfy . Find the largest possible value for .
A triangle is given together with an arbitrary circle . Let be the reflection of with respect to , the reflection of with respect to , and the reflection of with respect to . It is known that the circles don't intersect each other. Let be the meeting point of the two internal common tangents to (see picture). Similarly, is the meeting point of the internal common tangents of , and is the meeting point of the internal common tangents of . Prove that the triangles are congruent.
Attachments:

For each positive integer , find all triples of real numbers for which
Let be an equilateral triangle whose sides have length . The midpoints of are respectively. Points were chosen on so that is a rectangle. Inside this rectangle are three semi-circles with the same radius, as in the picture (the endpoints are on the edges of the rectangle, and the arcs are tangent). Find the minimum possible value of the radii of the semi-circles.
Attachments:

Determine if there exists a set of different real numbers with the following property: For every (not necessarily distinct) there are in so that .
Ana and Banana are playing a game. Initially, Ana secretly picks a number . In each subsequent turn of the game, Banana may pick a positive integer , and Ana will reveal to him the most common digit in the product (written in decimal notation). In the case when at least two digits are tied for being the most common, Ana will reveal all of them to Banana. For example, if , Ana will tell Banana that the digit is the most common, while if , Ana will reveal that and are the most common. Banana's goal is to determine with certainty the number after some number of turns. Does he have a winning strategy?