Problem 49572. Compute the largest number possible with the Brussels choice

• Created by ChrisR
• Appears in Cody Problems in Japanese

×

Like (3)

Difficulty:

(193)

Rate

• Solve Later   
• Add To GroupÂ

The Brussels choice (or Choix de Bruxelles) operation changes one number to another by taking a substring of the digits and either doubling it or (if the number is even) halving it. For example, starting with 9 and highlighting substrings, one can generate this sequence:

9, 18, 36, 312, 622, 644, 1288, 1488,...

Another possibility is

9, 18, 116, 232, 464, 924, 1844, 1888,...

Both of these excerpts have eight entries, but the second ends in a larger number than the first.

Write a function that takes an initial value and determines the largest number resulting after n steps. In the above examples, = 9 and . Return the number as a character string.

Solve

Solution Stats

18.84% Correct | 81.16% Incorrect

• 69 Solutions
• 12 Solvers

Last Solution submitted on Apr 15, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers12

Suggested Problems

• Project Euler: Problem 8, Find largest product in a large string of numbers

  1196 Solvers

• Bell Number calculator

  182 Solvers

• compress sequence into intervals

  90 Solvers

• Pattern Recognition 1 - Known Unit Length

  63 Solvers

• A Simple Tide Gauge with MATLAB

  379 Solvers

More from this Author291

• Compute the arithmetic derivative of integers

  25 Solvers

• Factor a number into Fermi-Dirac primes

  8 Solvers

• Determine the minimum number of swaps to sort a vector

  4 Solvers

• Compute the water table elevation in an unconfined aquifer with recharge

  4 Solvers

• Test approximations of the prime counting function

  15 Solvers