Problem 53905. Easy Sequences 64: Base-14 Arithmetic Function

• Created by Ramon Villamangca
• Appears in Easy Sequences Volume VIII

×

Like (0)

Difficulty:

(4)

Rate

• Solve Later   
• Add To GroupÂ

For an integer n, the base-14 arithmetic function, , is defined as follows:

• Convert n to base-14, using the letters '' for digits to .
• Replace the letters '' with the arithmetic operation symbols '', respectively.
• Remove any leading or trailing operation symbols.
• For consecutive operation symbols between two numeric symbols, retain only the first operation and remove all others.
• Evaluate the resulting expression in base-10.
• Return the evaluated expression as , rounded-off to the nearest integer.
• Finally, output if contains only "operation symbols", or if , or if , or if .

For example if :

Therefore:

.

Given a set positive integers N, find the integer x, , such that is minimized. If there are more than one integers, x in N that minimizes , please output the largest of those x's.

For example for :

Therefore, is minimized when , for . Since we are asked to select the largest minimizer, our program output should be .

Solve

Solution Stats

85.71% Correct | 14.29% Incorrect

• 7 Solutions
• 4 Solvers

Last Solution submitted on Jul 14, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers4

Suggested Problems

• Tic Tac Toe FTW

  1795 Solvers

• Back to basics 9 - Indexed References

  447 Solvers

• surrounded matrix

  1330 Solvers

• Characterize the final state of another digit inventory sequence

  14 Solvers

• Angle Between Analog Clock Hands

  101 Solvers

More from this Author116

• Easy Sequences 50: Blocked Gaussian Integers

  3 Solvers

• Easy Sequences 22: Sum of Proper Fractions

  8 Solvers

• Easy Sequences 90: Triple Summation of a Combinatorial Function

  2 Solvers

• Easy Sequences 104: One-line Code Challenge - GCDs of Sum of Consecutive Cubes

  4 Solvers

• Easy Sequences 18: Set Bits of Triple Summations

  7 Solvers