Automorphic number

Last updated March 22, 2024

In mathematics, an automorphic number (sometimes referred to as a circular number) is a natural number in a given number base $b$ whose square "ends" in the same digits as the number itself.

Definition and properties

Given a number base $b$ , a natural number $n$ with $k$ digits is an automorphic number if $n$ is a fixed point of the polynomial function $f(x)=x^{2}$ over $\mathbb {Z} /b^{k}\mathbb {Z}$ , the ring of integers modulo $b^{k}$ . As the inverse limit of $\mathbb {Z} /b^{k}\mathbb {Z}$ is $\mathbb {Z} _{b}$ , the ring of $b$ -adic integers, automorphic numbers are used to find the numerical representations of the fixed points of $f(x)=x^{2}$ over $\mathbb {Z} _{b}$ .

For example, with $b=10$ , there are four 10-adic fixed points of $f(x)=x^{2}$ , the last 10 digits of which are:

\ldots 0000000000

\ldots 0000000001

\ldots 8212890625

(sequence A018247 in the OEIS )

\ldots 1787109376

(sequence A018248 in the OEIS )

Thus, the automorphic numbers in base 10 are 0, 1, 5, 6, 25, 76, 376, 625, 9376, 90625, 109376, 890625, 2890625, 7109376, 12890625, 87109376, 212890625, 787109376, 1787109376, 8212890625, 18212890625, 81787109376, 918212890625, 9918212890625, 40081787109376, 59918212890625, ... (sequence A003226 in the OEIS ).

A fixed point of $f(x)$ is a zero of the function $g(x)=f(x)-x$ . In the ring of integers modulo $b$ , there are $2^{\omega (b)}$ zeroes to $g(x)=x^{2}-x$ , where the prime omega function $\omega (b)$ is the number of distinct prime factors in $b$ . An element $x$ in $\mathbb {Z} /b\mathbb {Z}$ is a zero of $g(x)=x^{2}-x$ if and only if $x\equiv 0{\bmod {p}}^{v_{p}(b)}$ or $x\equiv 1{\bmod {p}}^{v_{p}(b)}$ for all $p|b$ . Since there are two possible values in $\lbrace 0,1\rbrace$ , and there are $\omega (b)$ such $p|b$ , there are $2^{\omega (b)}$ zeroes of $g(x)=x^{2}-x$ , and thus there are $2^{\omega (b)}$ fixed points of $f(x)=x^{2}$ . According to Hensel's lemma, if there are $k$ zeroes or fixed points of a polynomial function modulo $b$ , then there are $k$ corresponding zeroes or fixed points of the same function modulo any power of $b$ , and this remains true in the inverse limit. Thus, in any given base $b$ there are $2^{\omega (b)}$ $b$ -adic fixed points of $f(x)=x^{2}$ .

As 0 is always a zero-divisor, 0 and 1 are always fixed points of $f(x)=x^{2}$ , and 0 and 1 are automorphic numbers in every base. These solutions are called trivial automorphic numbers. If $b$ is a prime power, then the ring of $b$ -adic numbers has no zero-divisors other than 0, so the only fixed points of $f(x)=x^{2}$ are 0 and 1. As a result, nontrivial automorphic numbers, those other than 0 and 1, only exist when the base $b$ has at least two distinct prime factors.

Automorphic numbers in base b

All $b$ -adic numbers are represented in base $b$ , using A−Z to represent digit values 10 to 35.

$b$	Prime factors of $b$	Fixed points in $\mathbb {Z} /b\mathbb {Z}$ of $f(x)=x^{2}$	$b$ -adic fixed points of $f(x)=x^{2}$	Automorphic numbers in base $b$
6	2, 3	0, 1, 3, 4	$\ldots 0000000000$ $\ldots 0000000001$ $\ldots 2221350213$ $\ldots 3334205344$	0, 1, 3, 4, 13, 44, 213, 344, 5344, 50213, 205344, 350213, 1350213, 4205344, 21350213, 34205344, 221350213, 334205344, 2221350213, 3334205344, ...
10	2, 5	0, 1, 5, 6	$\ldots 0000000000$ $\ldots 0000000001$ $\ldots 8212890625$ $\ldots 1787109376$	0, 1, 5, 6, 25, 76, 376, 625, 9376, 90625, 109376, 890625, 2890625, 7109376, 12890625, 87109376, 212890625, 787109376, 1787109376, 8212890625, ...
12	2, 3	0, 1, 4, 9	$\ldots 0000000000$ $\ldots 0000000001$ $\ldots 21{\text{B}}61{\text{B}}3854$ $\ldots 9{\text{A}}05{\text{A}}08369$	0, 1, 4, 9, 54, 69, 369, 854, 3854, 8369, B3854, 1B3854, A08369, 5A08369, 61B3854, B61B3854, 1B61B3854, A05A08369, 21B61B3854, 9A05A08369, ...
14	2, 7	0, 1, 7, 8	$\ldots 0000000000$ $\ldots 0000000001$ $\ldots 7337{\text{A}}{\text{A}}0{\text{C}}37$ $\ldots 6{\text{A}}{\text{A}}633{\text{D}}1{\text{A}}8$	0, 1, 7, 8, 37, A8, 1A8, C37, D1A8, 3D1A8, A0C37, 33D1A8, AA0C37, 633D1A8, 7AA0C37, 37AA0C37, A633D1A8, 337AA0C37, AA633D1A8, 6AA633D1A8, 7337AA0C37, ...
15	3, 5	0, 1, 6, 10	$\ldots 0000000000$ $\ldots 0000000001$ $\ldots 624{\text{D}}4{\text{B}}{\text{D}}{\text{A}}86$ $\ldots 8{\text{C}}{\text{A}}1{\text{A}}3146{\text{A}}$	0, 1, 6, A, 6A, 86, 46A, A86, 146A, DA86, 3146A, BDA86, 4BDA86, A3146A, 1A3146A, D4BDA86, 4D4BDA86, A1A3146A, 24D4BDA86, CA1A3146A, 624D4BDA86, 8CA1A3146A, ...
18	2, 3	0, 1, 9, 10	...000000 ...000001 ...4E1249 ...D3GFDA
20	2, 5	0, 1, 5, 16	...000000 ...000001 ...1AB6B5 ...I98D8G
21	3, 7	0, 1, 7, 15	...000000 ...000001 ...86H7G7 ...CE3D4F
22	2, 11	0, 1, 11, 12	...000000 ...000001 ...8D185B ...D8KDGC
24	2, 3	0, 1, 9, 16	...000000 ...000001 ...E4D0L9 ...9JAN2G
26	2, 13	0, 1, 13, 14	...0000 ...0001 ...1G6D ...O9JE
28	2, 7	0, 1, 8, 21	...0000 ...0001 ...AAQ8 ...HH1L
30	2, 3, 5	0, 1, 6, 10, 15, 16, 21, 25	...0000 ...0001 ...B2J6 ...H13A ...1Q7F ...S3MG ...CSQL ...IRAP
33	3, 11	0, 1, 12, 22	...0000 ...0001 ...1KPM ...VC7C
34	2, 17	0, 1, 17, 18	...0000 ...0001 ...248H ...VTPI
35	5, 7	0, 1, 15, 21	...0000 ...0001 ...5MXL ...TC1F
36	2, 3	0, 1, 9, 28	...0000 ...0001 ...DN29 ...MCXS

Extensions

Automorphic numbers can be extended to any such polynomial function of degree $n$ ${\textstyle f(x)=\sum _{i=0}^{n}a_{i}x^{i}}$ with b-adic coefficients $a_{i}$ . These generalised automorphic numbers form a tree.

a-automorphic numbers

An $a$ -automorphic number occurs when the polynomial function is $f(x)=ax^{2}$

For example, with $b=10$ and $a=2$ , as there are two fixed points for $f(x)=2x^{2}$ in $\mathbb {Z} /10\mathbb {Z}$ ( $x=0$ and $x=8$ ), according to Hensel's lemma there are two 10-adic fixed points for $f(x)=2x^{2}$ ,

\ldots 0000000000

\ldots 0893554688

so the 2-automorphic numbers in base 10 are 0, 8, 88, 688, 4688...

Trimorphic numbers

A trimorphic number or spherical number occurs when the polynomial function is $f(x)=x^{3}$ .^[1] All automorphic numbers are trimorphic. The terms circular and spherical were formerly used for the slightly different case of a number whose powers all have the same last digit as the number itself.^[2]

For base $b=10$ , the trimorphic numbers are:

0, 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, 76, 99, 125, 249, 251, 375, 376, 499, 501, 624, 625, 749, 751, 875, 999, 1249, 3751, 4375, 4999, 5001, 5625, 6249, 8751, 9375, 9376, 9999, ... (sequence A033819 in the OEIS )

For base $b=12$ , the trimorphic numbers are:

0, 1, 3, 4, 5, 7, 8, 9, B, 15, 47, 53, 54, 5B, 61, 68, 69, 75, A7, B3, BB, 115, 253, 368, 369, 4A7, 5BB, 601, 715, 853, 854, 969, AA7, BBB, 14A7, 2369, 3853, 3854, 4715, 5BBB, 6001, 74A7, 8368, 8369, 9853, A715, BBBB, ...

Programming example

defhensels_lemma(polynomial_function,base:int,power:int)->list[int]:"""Hensel's lemma."""ifpower==0:return[0]ifpower>0:roots=hensels_lemma(polynomial_function,base,power-1)new_roots=[]forrootinroots:foriinrange(0,base):new_i=i*base**(power-1)+rootnew_root=polynomial_function(new_i)%pow(base,power)ifnew_root==0:new_roots.append(new_i)returnnew_rootsbase=10digits=10defautomorphic_polynomial(x:int)->int:returnx**2-xforiinrange(1,digits+1):print(hensels_lemma(automorphic_polynomial,base,i))

Related Research Articles

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.

In probability and statistics, a Bernoulli process is a finite or infinite sequence of binary random variables, so it is a discrete-time stochastic process that takes only two values, canonically 0 and 1. The component Bernoulli variablesX_i are identically distributed and independent. Prosaically, a Bernoulli process is a repeated coin flipping, possibly with an unfair coin. Every variable X_i in the sequence is associated with a Bernoulli trial or experiment. They all have the same Bernoulli distribution. Much of what can be said about the Bernoulli process can also be generalized to more than two outcomes ; this generalization is known as the Bernoulli scheme.

In mathematics, a modular form is a (complex) analytic function on the upper half-plane, $, that satisfies:$

In mathematics, p-adic analysis is a branch of number theory that deals with the mathematical analysis of functions of p-adic numbers.

In algebraic geometry, a projective variety over an algebraically closed field k is a subset of some projective n-space $over k that is the zero-locus of some finite family of homogeneous polynomials of n + 1 variables with coefficients in k, that generate a prime ideal, the defining ideal of the variety. Equivalently, an algebraic variety is projective if it can be embedded as a Zariski closed subvariety of .$

In transcendental number theory, the Lindemann–Weierstrass theorem is a result that is very useful in establishing the transcendence of numbers. It states the following:

In mathematics, complex multiplication (CM) is the theory of elliptic curves E that have an endomorphism ring larger than the integers. Put another way, it contains the theory of elliptic functions with extra symmetries, such as are visible when the period lattice is the Gaussian integer lattice or Eisenstein integer lattice.

In mathematics, Kähler differentials provide an adaptation of differential forms to arbitrary commutative rings or schemes. The notion was introduced by Erich Kähler in the 1930s. It was adopted as standard in commutative algebra and algebraic geometry somewhat later, once the need was felt to adapt methods from calculus and geometry over the complex numbers to contexts where such methods are not available.

In mathematics, deformation theory is the study of infinitesimal conditions associated with varying a solution P of a problem to slightly different solutions P_ε, where ε is a small number, or a vector of small quantities. The infinitesimal conditions are the result of applying the approach of differential calculus to solving a problem with constraints. The name is an analogy to non-rigid structures that deform slightly to accommodate external forces.

In mathematics, the Chern–Weil homomorphism is a basic construction in Chern–Weil theory that computes topological invariants of vector bundles and principal bundles on a smooth manifold M in terms of connections and curvature representing classes in the de Rham cohomology rings of M. That is, the theory forms a bridge between the areas of algebraic topology and differential geometry. It was developed in the late 1940s by Shiing-Shen Chern and André Weil, in the wake of proofs of the generalized Gauss–Bonnet theorem. This theory was an important step in the theory of characteristic classes.

In mathematics, Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number $p$ , then this root can be lifted to a unique root modulo any higher power of $p$ . More generally, if a polynomial factors modulo $p$ into two coprime polynomials, this factorization can be lifted to a factorization modulo any higher power of $p$ .

In model theory and related areas of mathematics, a type is an object that describes how a element or finite collection of elements in a mathematical structure might behave. More precisely, it is a set of first-order formulas in a language L with free variables x₁, x₂,..., x_n that are true of a set of n-tuples of an L-structure $. Depending on the context, types can be complete or partial and they may use a fixed set of constants, A, from the structure . The question of which types represent actual elements of leads to the ideas of saturated models and omitting types .$

In mathematics, Brauer's theorem, named for Richard Brauer, is a result on the representability of 0 by forms over certain fields in sufficiently many variables.

In mathematics, a Witt vector is an infinite sequence of elements of a commutative ring. Ernst Witt showed how to put a ring structure on the set of Witt vectors, in such a way that the ring of Witt vectors $over the finite field of order is isomorphic to, the ring of -adic integers . They have a highly non-intuitive structure upon first glance because their additive and multiplicative structure depends on an infinite set of recursive formulas which do not behave like addition and multiplication formulas for standard p-adic integers.$

In mathematics, particularly numerical analysis, the Bramble–Hilbert lemma, named after James H. Bramble and Stephen Hilbert, bounds the error of an approximation of a function $by a polynomial of order at most in terms of derivatives of of order . Both the error of the approximation and the derivatives of are measured by norms on a bounded domain in . This is similar to classical numerical analysis, where, for example, the error of linear interpolation can be bounded using the second derivative of . However, the Bramble-Hilbert lemma applies in any number of dimensions, not just one dimension, and the approximation error and the derivatives of are measured by more general norms involving averages, not just the maximum norm.$

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

In mathematics, an algebraic number field is an extension field $of the field of rational numbers such that the field extension has finite degree . Thus is a field that contains and has finite dimension when considered as a vector space over .$

In mathematics the Jacobian ideal or gradient ideal is the ideal generated by the Jacobian of a function or function germ. Let $denote the ring of smooth functions in variables and a function in the ring. The Jacobian ideal of is$

In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient. Ideal lattices are a new concept, but similar lattice classes have been used for a long time. For example, cyclic lattices, a special case of ideal lattices, are used in NTRUEncrypt and NTRUSign.

In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fixed integer $, there exists a subset of the natural numbers satisfying$

References

↑ See Gérard Michon's article at
↑ "spherical number" . Oxford English Dictionary (Online ed.). Oxford University Press.(Subscription or participating institution membership required.)

examples of 1-automorphic numbers at PlanetMath .

External links

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] See Gérard Michon's article at

[2] "spherical number" . Oxford English Dictionary (Online ed.). Oxford University Press.(Subscription or participating institution membership required.)

[1]

[2]