Rosetta Code

Brazilian numbers

Find the first Brazilian numbers by searching for bases whose representation uses one repeated digit.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/brazilian_numbers.vibe
def base_digits(number: int, base: int) -> string
  if number == 0
    return "0"
  end

  digits = ""
  current = number

  while current > 0
    digits = "#{current % base}#{digits}"
    current = current // base
  end

  digits
end

def same_digits?(text: string) -> bool
  digits = text.chars
  digits.all? { |digit| digit == digits.first }
end

def brazilian?(number: int) -> bool
  base = 2
  while base <= number - 2
    digits = base_digits(number, base)
    if digits.length > 1 && same_digits?(digits)
      return true
    end
    base = base + 1
  end
  false
end

def first_brazilian_numbers(count: int) -> array<int>
  values: array<int> = []
  candidate = 7

  while values.length < count
    if brazilian?(candidate)
      values << candidate
    end
    candidate = candidate + 1
  end

  values
end

def run -> array<int>
  first_brazilian_numbers(10)
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.