Lunar arithmetic

Last updated

Lunar arithmetic, formerly called dismal arithmetic, [1] [2] is a version of arithmetic in which the addition and multiplication operations on digits are defined as the max and min operations. Thus, in lunar arithmetic,

Contents

and

The lunar arithmetic operations on nonnegative multidigit numbers are performed as in usual arithmetic as illustrated in the following examples. The world of lunar arithmetic is restricted to the set of nonnegative integers.

 976 +  348  ----  978 (adding digits column-wise)
    976 ×     348    ----    876 (multiplying the digits of 976 by 8)   444  (multiplying the digits of 976 by 4)  333   (multiplying the digits of 976 by 3)  ------  34876 (adding digits column-wise)

The concept of lunar arithmetic was proposed by David Applegate, Marc LeBrun, and Neil Sloane. [3]

In the general definition of lunar arithmetic, one considers numbers expressed in an arbitrary base and define lunar arithmetic operations as the max and min operations on the digits corresponding to the chosen base. [3] However, for simplicity, in the following discussion it will be assumed that the numbers are represented using 10 as the base.

Properties of the lunar operations

A few of the elementary properties of the lunar operations are listed below. [3]

  1. The lunar addition and multiplication operations satisfy the commutative and associative laws.
  2. The lunar multiplication distributes over the lunar addition.
  3. The digit 0 is the identity under lunar addition. No non-zero number has an inverse under lunar addition.
  4. The digit 9 is the identity under lunar multiplication. No number different from 9 has an inverse under lunar multiplication.

Some standard sequences

Even numbers

It may be noted that, in lunar arithmetic, and . The even numbers are numbers of the form . The first few distinct even numbers under lunar arithmetic are listed below:

These are the numbers whose digits are all less than or equal to 2.

Squares

A square number is a number of the form . So in lunar arithmetic, the first few squares are the following.

Triangular numbers

A triangular number is a number of the form . The first few triangular lunar numbers are:

Factorials

In lunar arithmetic, the first few values of the factorial are as follows:

Prime numbers

In the usual arithmetic, a prime number is defined as a number whose only possible factorisation is . Analogously, in the lunar arithmetic, a prime number is defined as a number whose only factorisation is where 9 is the multiplicative identity which corresponds to 1 in usual arithmetic. Accordingly, the following are the first few prime numbers in lunar arithmetic:

Every number of the form , where is arbitrary, is a prime in lunar arithmetic. Since is arbitrary this shows that there are an infinite number of primes in lunar arithmetic.

Sumsets and lunar multiplication

There is an interesting relation between the operation of forming sumsets of subsets of nonnegative integers and lunar multiplication on binary numbers. Let and be nonempty subsets of the set of nonnegative integers. The sumset is defined by

To the set we can associate a unique binary number as follows. Let . For we define

and then we define

It has been proved that

where the "" on the right denotes the lunar multiplication on binary numbers. [4]

Magic squares of squares using lunar arithmetic

A magic square of squares is a magic square formed by squares of numbers. It is not known whether there are any magic squares of squares of order 3 with the usual addition and multiplication of integers. However, it has been observed that, if we consider the lunar arithmetic operations, there are an infinite amount of magic squares of squares of order 3. Here is an example: [2]

See also

Related Research Articles

<span class="mw-page-title-main">Arithmetic</span> Elementary branch of mathematics

Arithmetic is an elementary branch of mathematics that studies numerical operations like addition, subtraction, multiplication, and division. In a wider sense, it also includes exponentiation, extraction of roots, and taking logarithms. Arithmetic systems can be distinguished based on the type of number they operate on. Integer arithmetic restricts itself to calculations with positive and negative whole numbers. Rational number arithmetic includes operations on fractions that lie between integers. Real number arithmetic includes calculations with both rational and irrational numbers and covers the complete number line. Another distinction is based on the numeral system employed to perform calculations. Decimal arithmetic is the most common. It uses the basic numerals from 0 to 9 and their combinations to express numbers. Binary arithmetic, by contrast, is used by most computers and represents numbers as combinations of the basic numerals 0 and 1. Some arithmetic systems operate on mathematical objects other than numbers, such as interval arithmetic and matrix arithmetic.

<span class="mw-page-title-main">Euclidean algorithm</span> Algorithm for computing greatest common divisors

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

<span class="mw-page-title-main">Modular arithmetic</span> Computation modulo a fixed integer

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

<span class="mw-page-title-main">Multiplication</span> Arithmetical operation

Multiplication is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division. The result of a multiplication operation is called a product.

<i>p</i>-adic number Number system extending the rational numbers

In number theory, given a prime number p, the p-adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; p-adic numbers can be written in a form similar to decimals, but with digits based on a prime number p rather than ten, and extending to the left rather than to the right. Formally, given a prime number p, a p-adic number can be defined as a series

<span class="mw-page-title-main">Addition</span> Arithmetic operation

Addition is one of the four basic operations of arithmetic, the other three being subtraction, multiplication and division. The addition of two whole numbers results in the total amount or sum of those values combined. The example in the adjacent image shows two columns of three apples and two apples each, totaling at five apples. This observation is equivalent to the mathematical expression "3 + 2 = 5".

In mathematics, a quadratic irrational number is an irrational number that is the solution to some quadratic equation with rational coefficients which is irreducible over the rational numbers. Since fractions in the coefficients of a quadratic equation can be cleared by multiplying both sides by their least common denominator, a quadratic irrational is an irrational root of some quadratic equation with integer coefficients. The quadratic irrational numbers, a subset of the complex numbers, are algebraic numbers of degree 2, and can therefore be expressed as

In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit Hindu-Arabic numerals that is simple enough to perform by hand. It breaks down a division problem into a series of easier steps.

<span class="mw-page-title-main">Polynomial ring</span> Algebraic structure

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

Balanced ternary is a ternary numeral system that uses a balanced signed-digit representation of the integers in which the digits have the values −1, 0, and 1. This stands in contrast to the standard (unbalanced) ternary system, in which digits have values 0, 1 and 2. The balanced ternary system can represent all integers without using a separate minus sign; the value of the leading non-zero digit of a number has the sign of the number itself. The balanced ternary system is an example of a non-standard positional numeral system. It was used in some early computers and also in some solutions of balance puzzles.

In computing, a roundoff error, also called rounding error, is the difference between the result produced by a given algorithm using exact arithmetic and the result produced by the same algorithm using finite-precision, rounded arithmetic. Rounding errors are due to inexactness in the representation of real numbers and the arithmetic operations done with them. This is a form of quantization error. When using approximation equations or algorithms, especially when using finitely many digits to represent real numbers, one of the goals of numerical analysis is to estimate computation errors. Computation errors, also called numerical errors, include both truncation errors and roundoff errors.

A powerful number is a positive integer m such that for every prime number p dividing m, p2 also divides m. Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a2b3, where a and b are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful.

A Friedman number is an integer, which represented in a given numeral system, is the result of a non-trivial expression using all its own digits in combination with any of the four basic arithmetic operators (+, −, ×, ÷), additive inverses, parentheses, exponentiation, and concatenation. Here, non-trivial means that at least one operation besides concatenation is used. Leading zeros cannot be used, since that would also result in trivial Friedman numbers, such as 024 = 20 + 4. For example, 347 is a Friedman number in the decimal numeral system, since 347 = 73 + 4. The decimal Friedman numbers are:

In commutative algebra and field theory, the Frobenius endomorphism is a special endomorphism of commutative rings with prime characteristic p, an important class which includes finite fields. The endomorphism maps every element to its p-th power. In certain contexts it is an automorphism, but this is not true in general.

In number theory, natural density, also referred to as asymptotic density or arithmetic density, is one method to measure how "large" a subset of the set of natural numbers is. It relies chiefly on the probability of encountering members of the desired subset when combing through the interval [1, n] as n grows large.

In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an explicit well-ordered set that represents the result of the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. In addition to these usual ordinal operations, there are also the "natural" arithmetic of ordinals and the nimber operations.

In mathematical logic, a definable set is an n-ary relation on the domain of a structure whose elements satisfy some formula in the first-order language of that structure. A set can be defined with or without parameters, which are elements of the domain that can be referenced in the formula defining the relation.

In mathematical logic, Skolem arithmetic is the first-order theory of the natural numbers with multiplication, named in honor of Thoralf Skolem. The signature of Skolem arithmetic contains only the multiplication operation and equality, omitting the addition operation entirely.

<span class="mw-page-title-main">Real number</span> Number representing a continuous quantity

In mathematics, a real number is a number that can be used to measure a continuous one-dimensional quantity such as a distance, duration or temperature. Here, continuous means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion.

In number theory, two positive integers a and b are said to be multiplicatively independent if their only common integer power is 1. That is, for integers n and m, implies . Two integers which are not multiplicatively independent are said to be multiplicatively dependent.

References

  1. "A087097 Lunar primes (formerly called dismal primes)". OEIS. The OEIS Foundation. Retrieved 21 October 2021.
  2. 1 2 Woll, C (2019). "There Is a 3×3 Magic Square of Squares on the Moon—A Lot of Them, Actually". The Mathematical Intelligencer. 41: 73–76. doi:10.1007/s00283-018-09866-4. S2CID   119641219 . Retrieved 19 October 2021.
  3. 1 2 3 Applegate, David; LeBrun, Marc; Sloane, N. J. A. (2011). "Dismal Arithmetic". Journal of Integer Sequences . 14. arXiv: 1107.1130 . Retrieved 20 October 2021.
  4. Gal Gross (2021). "Maximally Additively Reducible Subsets of the Integers". Journal of Integer Sequences. 23 (Article 20.10.5). arXiv: 1908.05220 . Retrieved 21 October 2021.