In positional notation, a numeral digit contributes its value multiplied by a weight determined by its position. Fix an integer radix . A finite string of numeral digits , with , represents the nonnegative integer
The rightmost position has weight ; each move left multiplies the weight by . This weight is the place value. For a nonzero integer, the canonical string has . Zero is written with the single numeral digit . Leading zeros are permitted in a fixed-width display but omitted in the canonical form: . A negative integer is written with a separate minus sign and the positional notation for its absolute value; the minus sign is not a numeral digit.[ref]
For example,
The zero is essential inside this string: , not . It records that the tens position contributes nothing while keeping the hundreds and units in their proper positions. The same integer has binary representation
Figure 1.
One integer, two encodings:
. Each numeral digit is multiplied by its place value. Decimal uses the weights ; binary uses . Zero digits preserve positions without contributing to the total. Both rows sum to . Details.
Repeated Euclidean division constructs the representation exactly. Set . At each step write
Keep the remainder and continue with the integer quotient . A positive quotient strictly decreases, so eventually it is zero. Substituting the successive equations back into the first gives : the numeral digits are obtained from right to left. The remainder modulo uniquely fixes , and then the quotient uniquely fixes the remaining string by the same reasoning. This proves existence and uniqueness once leading zeros are excluded. The needed unique quotient and remainder are precisely the conclusion of the Euclidean division theorem.[ref]
This finite expansion concerns nonnegative integers. Extending positional notation to fractional positions uses weights to the right of a point; an arbitrary real number need not have a finite digit string. In particular, the decimal representation represents , while the base-two string represents . The radix is part of the interpretation.
The benefit is compact arithmetic: positions can encode every nonnegative integer below . To see the upper endpoint, fill all positions with ; the finite geometric series gives . Carrying in addition exchanges units of one place value for one unit of the next. Thus a short string stores a large count and also supplies an algorithm for computing with it.
Digit reversal reverses a numeral's digit string in a specified radix and width. If has exactly displayed digits, allowing leading zeros, define
It is an involution on the width- strings: reversing twice restores every digit to its original position.
In four-bit binary representation, reverses to , so the numbers three and twelve are paired at that width. With canonical decimal numerals, reverses to the displayed string , whose numerical value is . Reversing the canonical numeral then gives , so dropping width and leading zeros destroys the involution property.
The distinction between a digit string and its integer value is essential in bit-reversal permutations used to reorder indexed data. It also distinguishes numeric digit reversal from reversing a negative numeral's separate sign.
The bit-reversal permutation of writes each index using exactly binary digits, reverses those digits, and interprets the result as another index. Leading zeros matter. Reversing twice restores the original index, so this permutation is an involution.
For , the index order becomes : for example, maps to . It occurs naturally in radix-two Fast Fourier transform implementations. Repeatedly separating even from odd indices consumes the low-order bits first; traversing the resulting recursion tree reverses the order in which the index bits are read. Some implementations permute inputs, others permute outputs, and other layouts avoid an explicit reversal. The discrete Fourier transform itself is independent of this storage choice.[ref]
The digit sum of a nonnegative integer in a specified radix is the sum of its numerical digits. If
write , with . For example, . In binary representation, the digit sum is the Hamming weight of the digit string.
Since , the positional expansion gives
In decimal representation, this yields the familiar divisibility tests by and : the integer and its digit sum have the same remainder modulo either. For , both and leave remainder modulo . The argument explains the rule from modular arithmetic, rather than relying on a pattern noticed in examples.
The alternating digit sum of a nonnegative integer in radix is
with a positive sign on the units digit. Starting the signs from the opposite end can change the overall sign, so the convention should be stated.
Because , the positional expansion gives . This proves a divisibility test: divides the number exactly when it divides its alternating digit sum. In decimal notation, has alternating sum and equals .
The rule differs from the ordinary digit sum test modulo , which instead uses . Both follow from the same modular arithmetic principle of replacing the radix by its residue before evaluating the digit polynomial.
Scientific notation writes a nonzero real quantity as with an integer and . For example, and .
The exponent records the scale while the significand records the reported digits. Multiplication adds the exponents, so . The displayed precision must still reflect the accuracy of the underlying measurement; rewriting a value does not add information. The number zero is written separately because the normalized form excludes it.
Golden ratio base is a positional notation with base . A finite digit string represents , usually using digits and allowing both positive and negative powers.
The identity gives the rewrite , so representations need a normalization convention. In particular, . Avoiding adjacent ones removes many finite ambiguities. This links an irrational numerical base to Fibonacci numbers and to symbolic rules for rewriting digit strings.
A phigital number is a number represented using golden ratio base, with digits weighted by powers of . The word describes the representation rather than a separate kind of arithmetic object.
For example, . Since , distinct strings can represent the same value unless a normalization convention is imposed. Finite phigital expansions belong to , because , so even negative powers can be reduced to integer combinations of .
In decimal representation, a bouncy number is a positive integer whose sequence of numerical digits is neither nondecreasing nor nonincreasing from left to right. Equivalently, one adjacent pair strictly rises and another strictly falls. For example, is bouncy, while and are not. Repeated numerical digits are permitted by the weak order conditions: is nondecreasing.
A number satisfying both weak order conditions has every numerical digit equal, so the overlap consists exactly of the positive repdigits, such as . If count the nondecreasing, nonincreasing and repdigit positive integers at most , respectively, inclusion-exclusion gives the count of bouncy numbers as
This reduces counting the complement of two monotonicity conditions to counting those two simpler families and their explicit overlap.
A mixed-radix positional notation using factorials as place values: with . For lexicographic order on permutations, division by selects the next symbol when symbols remain; the remainder gives the rank within that block.
Factoradic indexing uses the factorial number system to rank or unrank permutations of an ordered -element set. For zero-based rank , write with . Read the digits from highest factorial down, selecting the indexed item from the remaining ordered elements and removing it.
For rank among permutations of , . Select index , giving , then index , giving , then the remaining : the result is . This produces a bijection between ranks and lexicographically ordered permutations.
A nonnegative integer whose positional notation reads the same forwards and backwards, with no leading zeros. This property depends on the base: is a palindromic number in both decimal representation and binary representation, since .
A palindromic number in binary representation, with no leading zeros. Every positive binary palindrome is an odd number, because its first and last numerical digits must both be one.
A Lychrel number is a positive integer whose repeated reverse-and-add process never reaches a palindromic number in the chosen radix. Each step performs digit reversal and adds the reversed integer to the current value. For example, reaches a decimal palindrome in one step, so is not a base-ten Lychrel number.
Failure to reach a palindromic number within a fixed iteration limit establishes only a candidate. It does not prove that every later step also fails. A computation must therefore distinguish a bounded search result from the infinite claim in the definition.
A numerical digit is one symbol in a positional notation string, denoting an integer from zero through one less than the radix.
One of the ten numerical digits used in decimal representation.
A balanced number is a positive integer whose first decimal digits have the same digit sum as its last decimal digits, where is the number of numerical digits. For odd , the middle numerical digit appears on both sides and cancels, so only the equally long outer halves need to be compared.
For example, is balanced because . It is not a palindromic number: equality of two digit sums does not require reversed digits. At odd length, is balanced because the outer pairs and both sum to three; its middle digit is irrelevant to the equality.
Digit dynamic programming can tabulate counts and value sums of fixed-length halves indexed by digit sum, then match equal indices. The first half must begin with a nonzero numerical digit, while the last half may contain initial zeros, as in . Preserving the half length is essential when assembling the positional value.
A step number is a positive integer whose adjacent decimal digits differ by exactly . For example, and are step numbers, while is not: its first two numerical digits have difference zero. Repetition is allowed; only neighboring differences are constrained.
The numerical digits form a walk on the path graph , starting at a nonzero digit. From a last digit , the possible extensions are within the range . At endpoints there is only one extension.
For digit dynamic programming, record the last digit and a bit mask encoding the set of digits already visited. Appending updates the visited set by set union with . Here pandigital means that every decimal digit appears at least once; repetitions are allowed. Accept only final states whose visited set contains all ten numerical digits. This separates local adjacency from the global requirement to have seen every digit.
The digital root of a nonnegative integer in integer radix is the single numerical digit obtained by repeatedly taking its digit sum. For example, in decimal representation, , while .
The process terminates: if , some nonzero digit occupies a position above the units, so . The positive integers therefore decrease until a single numerical digit remains. Each step preserves the integer congruence class modulo .
For positive inputs, every digit sum stays positive. The final digit lies in , rather than . Choosing the representative in this range gives
with . This explains why a positive multiple of has decimal digital root , not zero. The formula combines modular arithmetic with the positivity of the terminating representative.
A number whose representation contains every numerical digit from a specified alphabet. The convention must specify the base, whether zero is required, and whether repetitions are allowed. In many counting problems, “0-to-9 pandigital” means that all ten decimal numerical digits occur exactly once; other problems require only that each occur at least once.
A pandigital prime is a prime number that is also a pandigital number for a specified radix, digit alphabet and repetition convention. For example, uses each of exactly once and is prime; trial division by prime numbers at most its square root verifies the latter condition.
The digit sum supplies a useful obstruction. A decimal number using exactly once has digit sum . If this sum is divisible by and the number exceeds , the number is composite. In particular, a number using all ten decimal digits exactly once has digit sum and cannot be prime. The filter follows from the digit sum integer congruence, independently of the order in which the digits occur.
The radix is the base of positional notation. In the ordinary integer-base case it is an integer , and successive place values differ by a factor of .
A positional representation in which each digit has its own positive integer base. Least-significant-first digits satisfy , and digit has weight . For positions, assume . Repeated Euclidean division by the successive bases converts that integer to digits; a backwards version of Horner's method converts the digits back.
The place value is the weight of a position in positional notation. A numeral digit at that position contributes to the represented number.
A decimal expansion writes a nonnegative real number using decimal digits at successive powers of ten:
Nonnegative indices describe the integer part, and negative indices describe the fractional part. For a negative real number, add a minus sign to the expansion of its positive magnitude. A terminating decimal has a zero tail; a general decimal expansion can require infinitely many fractional digits.
An infinite tail of nines can duplicate a terminating expansion. For example, the geometric series gives . The usual uniqueness convention excludes a final infinite tail of nines, and redundant leading zeros are ignored.
For a nonnegative integer , only finitely many nonnegative powers are needed: . This makes divisibility tests into polynomial calculations modulo the proposed divisor. Since ,
Thus is divisible by exactly when its alternating digit sum is divisible by . That sum need not be literally zero: for , it is , and .
A hereditary base representation expands not only the number in base , but also every exponent recursively in that same base. Changing the base at every depth defines the Goodstein base-change operation; replacing it by omega defines an ordinal rank of a Goodstein term.
Start at base two. At each nonzero step, change every base occurrence in the hereditary base representation to the next base and subtract one. Although the natural-number terms can grow, their ordinal ranks of a Goodstein term decrease strictly. Keep zero fixed once it is reached.
Every Goodstein sequence reaches zero. Before zero, the ordinal rank of a Goodstein term of each step is strictly smaller than the preceding one. An infinite sequence would contradict well-foundedness of the ordinals below epsilon zero.
Replacing every base occurrence by omega in a hereditary base representation gives a Cantor normal form below epsilon zero. Hereditary base change preserves this ordinal expression, and subtraction of one lowers it strictly. The ordinal is a termination measure even when the natural-number value increases.
The Goodstein function records the least step at which the Goodstein sequence from a given initial number reaches zero. With the initial step numbered zero, its values on are . Goodstein's theorem makes this effective termination-time function total.
For an integer base , a nonnegative integer has a finite positional representation with digits . Repeated Euclidean division gives the digits uniquely; appending zero high-place digits has no effect. The base need not be prime for uniqueness, but a prime base is useful in Lucas theorem and modular binomial coefficients.
The binary numeral system is positional notation with radix two. Each binary digit is zero or one, and its place value is a power of two. A one includes that weight in the sum; a zero skips it. The binary representation therefore selects and represents the integer .
To obtain those binary digits from , repeatedly use Euclidean division by two:
The remainders, in the order produced, are . Read them in reverse order to get . The final zero is the quotient that stops the conversion, not an additional leading binary digit. Starting with zero itself needs the special single-digit representation .
A useful independent check reads the binary digits from left to right. Start with and, for each binary digit , replace by . For , the intermediate values are . This reconstructs the integer without reversing a list and explains why appending a zero on the right doubles the value.
Binary is well suited to computation because each binary digit has just two possibilities. A stored bit can encode either possibility; groups of bits encode larger integers. Practical integer arithmetic can use a radix that is itself a power of two, grouping several binary digits into each stored numeral digit.[ref] A displayed negative integer, such as , uses a separate sign. A computer's particular signed storage convention is an additional encoding choice, so the displayed sign should not be confused with an extra binary place.
A binary digit is a zero or one in the base-two positional representation of an integer. The sum determines the Thue–Morse sequence and is the Hamming weight of the binary representation.
The most significant bit is the binary digit with greatest positional weight in a specified binary representation. For a positive integer written without leading zeros, it is the leading one: in , it has weight .
For a fixed-width word, the term instead denotes the leftmost position even when that bit is zero. In two's-complement signed representation, that position is the sign bit. Stating the width and whether the value is signed prevents confusing the highest position of a word with the highest nonzero bit of an integer.
The least significant bit is the binary digit in the position of weight . For a nonnegative integer , its value is , so it records parity. In it is one; in it is zero.
The phrase must be distinguished from the least significant set bit, the lowest position containing a one. For , that set bit has weight four, even though the least significant bit is zero. The distinction matters in bit masks, divisibility by powers of two, and binary arithmetic.
A decimal representation is positional notation with radix ten and numeral digits zero through nine. For an integer, the nonnegative part is a finite decimal expansion; a negative integer has a separate minus sign. For example, , whereas . The numeral digits alone do not determine the value: their positions do.
Fractional positions extend the same place value rule to the right of the decimal point, with successive weights . [ref] For example,
The matching binary representation is , since its fractional part is . These representations terminate in both bases; finiteness in one radix does not imply finiteness in another.
Leading zeros in the integer part and trailing zeros in the fractional part leave the value unchanged: . A zero appended to the right of an integer string has a different effect: . Keeping the decimal point fixed prevents confusing these two operations.
Every integer has a finite decimal expansion, but a noninteger rational number may need infinitely many fractional numeral digits, as in . A terminating decimal has a zero tail by convention. Infinite decimal strings have a further ambiguity that finite canonical integer strings do not: , because the geometric series sums to one. An infinite decimal tail denotes a limit, not a sufficiently long rounded approximation.
A terminating decimal is a decimal representation with only finitely many nonzero fractional numerical digits. For a reduced fraction with , this occurs exactly when every prime factor of is or .
If the representation terminates after fractional digits, write for an integer . Since are coprime integers, divides . This proves necessity. Conversely, if , choose . Then , making an integer and giving a finite representation.
For example, because divides . The reduced fraction has a denominator factor , so its decimal representation cannot terminate. A zero tail is distinct from a nonzero repeating block; the latter is measured by decimal period from multiplicative order.

Articles by others on the same topic (1)

Positional notation is a system for representing numbers in which the position of each digit within a number determines its value based on a specific base or radix. This system allows for the efficient representation of large numbers using only a finite set of symbols (digits). ### Key Features of Positional Notation: 1. **Base (Radix)**: The base of the positional number system determines how many distinct digits are used and the value of each digit's position.