olymmath

NO-ABEL 2002 Problem 4

    An integer is given N>1N> 1 . Arne and Britt play the following game: (1) Arne says a positive integer AA . (2) Britt says an integer B>1B> 1 that is either a divisor of AA or a multiple of AA . ( AA itself is a possibility.) (3) Arne says a new number AA that is either B−1,BB - 1, B or B+1B + 1 . The game continues by repeating steps 2 and 3. Britt wins if she is okay with being told the number NN before the 5050 th has been said. Otherwise, Arne wins. a) Show that Arne has a winning strategy if N=10N = 10 . b) Show that Britt has a winning strategy if N=24N = 24 . c) For which NN does Britt have a winning strategy?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator no-abel/2002/p4 · Tag 3G1R1KFYSC · Edit this page on GitHub · Keys: j next, k previous