|
|
|
|
Friedman number
|
(Definition)
|
|
|
Consider the integer 28547. In the equation
 expressed in base 10, both sides use the same digits.
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,
![$ 3125=(3 + [1 \times 2])^5$](http://images.planetmath.org:8080/cache/objects/7533/l2h/img2.png "$ 3125=(3 + [1 \times 2])^5$") .
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.
Problem of the Month, August 2000
Sloane's A036057
Sloane's A080035
|
"Friedman number" is owned by aplant. [ full author list (2) | owner history (1) ]
|
|
(view preamble)
Cross-references: order, Roman numerals, even, bases, numbers, order of operations, division, multiplication, subtraction, addition, operators, right hand side, digits, sides, base, equation, integer
There are 2 references to this entry.
This is version 7 of Friedman number, born on 2005-12-22, modified 2006-10-03.
Object id is 7533, canonical name is FriedmanNumber.
Accessed 1389 times total.
Classification:
| AMS MSC: | 11A63 (Number theory :: Elementary number theory :: Radix representation; digital problems) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
