Friedman number
An integer is a Friedman number if it can be put into an equation such that both sides use the same digits but the right hand side has one or more basic arithmetic operators (addition, subtraction, multiplication, division, exponentiation) interspersed. Brackets, as usual, are essential to clarify the order of operations. These numbers are named after Erich Friedman, Assoc. Professor of Mathematics at Stetson University. With the help of his students he has researched Friedman numbers in bases 2 through 10 and even with Roman numerals.
When both sides use the digits in the same order, the number is called a ”nice” or ”strong” Friedman number. For example, .
These concepts can be transplanted into any standard positional numbering system using 0. Transplanting into the realm of Roman numerals, however, requires the addition of the extra constraint that the right hand side of the equation use at least one other operator besides addition or subtraction.
0.1 Links
http://www.stetson.edu/ efriedma/mathmagic/0800.htmlProblem of the Month, August 2000
http://www.research.att.com/projects/OEIS?Anum=A036057Sloane’s A036057
http://www.research.att.com/projects/OEIS?Anum=A080035Sloane’s A080035
Title | Friedman number |
---|---|
Canonical name | FriedmanNumber |
Date of creation | 2013-03-22 15:36:45 |
Last modified on | 2013-03-22 15:36:45 |
Owner | aplant (12431) |
Last modified by | aplant (12431) |
Numerical id | 10 |
Author | aplant (12431) |
Entry type | Definition |
Classification | msc 11A63 |