- #1
Loren Booda
- 3,125
- 4
Given a large but finite number line including an arbitrarily chosen number, what strategy of (un)equal bisections will isolate that number within a minimum of steps? For instance, should one choose equal bisecting, or would a series of unequal 2:1 bisecting be more efficient? Might e or phi be involved?