benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / John and Gary are playing a game. John spins a spinner numbered with integers…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

John and Gary are playing a game. John spins a spinner numbered with integers from 1 to 20. Gary then writes a list of all of the positive factors of the number spun except for the number itself. Gary then creates a new spinner with all of the numbers on his list. John then spins this spinner, and the process continues. The game is over when the spinner has no numbers on it. If John spins a 20 on his first spin, what is the maximum number of total spins (including the one he already made) that John can make before the game is over?

level

Level 5

type

Prealgebra

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
399abb6b-a1f2-5bd4-83a6-60e48d1127c9
task_key
prealgebra--test--399abb6b-a1f2-5bd4-83a6-60e48d1127c9
task_revision_id
1
config / split
prealgebra / test

Official source

initial import