Combinatorics, Case Analysis / Checking Cases, Processes / Procedures
This category covers problems involving sequences of operations or steps that evolve over time or iterations. Questions might ask about the outcome of a process, whether it terminates, or properties of its state after a certain number of steps. Often related to algorithms or invariants.
-
Question
The numbers with a digit sum of 28 are written on the board in ascending order. What is the 24th number among them?
Sources: -
Circle of Liars - The Truth Claim
In a circle, `n` people are seated, each of whom is either a liar or a truth-teller.
The people are looking towards the center of the circle. A liar always lies, and a truth-teller always tells the truth.
Each of the people knows exactly who is a liar and who is a truth-teller.
Each of the people says that the person sitting two places to their left (that is, next to the person sitting next to them), is a truth-teller.
It is known that in the circle there is at least one liar, and at least one truth-teller.
a. Is it possible that `n = 2017`?
b. Is it possible that `n = 5778`?
(Solution format: "word, word" for example "cat, puppy")
Sources:Topics:Logic -> Reasoning / Logic Number Theory -> Division -> Parity (Even/Odd) Combinatorics -> Case Analysis / Checking Cases -> Processes / Procedures Proof and Example -> Proof by Contradiction Logic -> Truth-tellers and Liars Problems- Gillis Mathematical Olympiad, 2017-2018 Question 1
-
A 2022x2022 Board and Inversion Operations
We have a `2022 times 2022` board with real numbers.
In each move, we can choose a row or a column and a real number `c`.
Then, we replace each number in the row or column from `x` to `c - x`.
Is it possible to get from any board to any other board?
-
Number Network
In the diagram, the numbers on the edges indicate the differences between the numbers inside the circles. Place positive numbers inside the circles and discover what the number in the bottom circle is.
Sources: -
Letter Replacement
Each letter represents a different digit; whenever a specific letter appears, it is necessarily the same digit.
Find `B-E/2`
Given: `AB*C=DE`
And also `F^D=GF`
-
Question
A two-digit number is written on the board.
Sources:
Avi said: "The digit 5 appears in this number."
Beni said: "This is a square number."
Gili said: "This number is greater than 50."
Dani said: "The number is divisible by 7."
Then the teacher said: "There are three correct statements here and one incorrect statement.".
What number was written on the board? -
Minimal Table
Given a table of size `3 times 3`. Hilla wants to write digits from 1 to 9 in the table's cells, such that all the sums in the rows and columns of the table are different, and the total sum of the table is as small as possible.
Sources:
It is allowed to repeat the same digit multiple times. What is the smallest sum that Hilla can obtain? -
How Many Liars?
A tourist is traveling in a land of liars and truth-tellers. All truth-tellers always tell the truth, and all liars always lie.
The tourist meets four friends: Alice, Betty, John, and Donald, and asks them: "How many of the four of you are liars?"
Alice answers: 0
Betty answers: 1
John answers: 2
Donald answers: 3
Can we know for certain how many of them are liars?
Sources: -
Donkey in the Middle
Avi, Beni, and Gadi played "Donkey in the Middle" - at any moment someone stands in the middle and tries to catch a ball that the other two are passing. If he succeeds, one of the other two replaces him.
Sources:
After the game, it turned out that Avi stood in the middle 8 times, Beni 4 times, and Gadi 13 times.
Who was the first and who was the last to stand in the middle? -
Question
The numbers `1,2,3,4,5` are written at the vertices of a regular pentagon, with each number at exactly one vertex. A trio of vertices is called successful if it forms an isosceles triangle, where the number at its apex is greater than the numbers at the other two vertices, or where the number at its apex is smaller than the numbers at the other two vertices.
Find the maximum number of successful trios that can exist.