ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the two-player game in which players alternately choose integers from {2,3,…,n}\{2,3,\ldots,n\} to be included in some set AA (the same set for both players) such that no a∣ba\mid b for aeqb∈Aa eq b\in A. The game ends when no legal move is possible. One player wants the game to last as long as possible, the other wants the game to end quickly. How long can the game be guaranteed to last for? At least ϵn\epsilon n moves? (For ϵ>0\epsilon>0 and nn sufficiently large.) At least (1−ϵ)n2(1-\epsilon)\frac{n}{2} moves?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.