An integer is a whole number, positive, negative, or zero. The set of all integers isThe positive integers are ; the negative integers are their opposites . Zero is neither positive nor negative. The nonnegative integers include zero and all the positive integers. On a number line, consecutive integers are one unit apart, negative integers lie to the left of zero, and positive integers lie to its right. [ref]
3.1 Introduction to Integers. Prealgebra 2e, §3.1: Locate Positive and Negative Numbers on the Number Line; Opposite Notation; Integers
The integers let counting describe changes in both directions. If a counter starts at and increases by five, it reaches : . Decreasing that result by four gives . In addition on the number line, the sign of the added integer chooses the direction and its absolute value gives the distance. The additive inverse reverses the change made by .
The integers have closure under a binary operation for addition, subtraction and multiplication: whenever , the results , and are still integers. Together these operations give the integers their ring structure.[ref]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. §7.1, p. 166, Definition 7.1; p. 167, Example 7.1: the integers with their usual addition and multiplication
For instance, , , and . General division has no such closure: is a rational number but not an integer. Some divisions are exact, such as ; division by zero is undefined. Euclidean division instead produces an integer quotient and a remainder, so retains the information that ordinary division puts into the fraction .An integer is the value, whereas its written numeral is an encoding. The decimal representation and the binary representation name the same integer. Changing positional notation changes how that value is displayed and how calculations are organized; it does not change the value itself.
For a positive integer , its cube-free part is . Then with , and no prime cube divides . This decomposition is unique by unique factorization.
For example, , so its cube-free part is . This is different from the radical of an integer, which keeps each prime only once and gives here. Removing the cube factor simplifies cube roots and identifies integers whose ratio is a rational cube.
A Hilbert number is a positive integer congruent to modulo : the first examples are . The Hilbert numbers form a multiplicative set, because a product of two integers congruent to modulo again has that residue.
This set inherits multiplication from the integers, but restricting its allowed factors changes divisibility questions. For example, belongs to the Hilbert numbers while does not. Its ordinary factorization is therefore unavailable as a factorization into smaller Hilbert numbers. The squarefree Hilbert number definition uses this restricted collection of factors.
In the multiplicative set of Hilbert numbers, a squarefree Hilbert number is one divisible by no square of a Hilbert number . This is weaker than being a squarefree integer: is a squarefree Hilbert number because its square divisor has outside the Hilbert numbers.
A cubefree integer is a positive integer divisible by no cube of a prime. Equivalently, every prime exponent in its prime factorization is at most two.
Roman numerals represent integers with symbols such as , , , , , , and . In a common modern convention, most values are added, with designated subtractive pairs such as and .
For example, . Unlike positional notation, a symbol does not acquire a power-of-ten weight from its position, and the ordinary system has no zero digit. Historical usage varies, so the modern subtractive convention should not be imposed on every inscription.
A repdigit is a positive integer whose base- expansion repeats one nonzero digit . For , and , the finite geometric series gives . For example, has decimal digits, all equal to five.
Every prime number not dividing divides infinitely many such repdigits. If it divides , every length works. Otherwise, if it does not divide , the Fermat little theorem gives divisibility for lengths that are multiples of , and division by is justified by its modular inverse. If , the sum is congruent to modulo , so lengths divisible by work instead. A prime dividing but not divides none, since . This distinction prevents invalid cancellation of the geometric-sum denominator.
In a positional notation of integer radix , a repunit is a repdigit whose numerical digits are all . A length- repunit, with , is the geometric seriesFor example, , while . The same string has different values in different radices.
Appending one numerical digit gives . Thus remainders modulo a positive integer obey , starting with . This recurrence relation avoids constructing huge integers. For decimal repunits modulo , the successive remainders are ; hence the six-digit repunit is divisible by .
A repunit divisible by exists exactly when are coprime integers, and one then exists with at most digits. Necessity follows because a common prime factor of divides every nonconstant term of , leaving remainder one. For sufficiency, examine modulo . If none is zero, the pigeonhole principle gives equal remainders at two indices . Their difference is . Cancelling the invertible factor modulo produces a divisible repunit of length .
For an integer and positive integer , Euclidean division writes with unique integer quotient and remainder . For , repeated quotient-and-remainder steps yield the digits of a base-p expansion when . The uniqueness follows because the difference of two permitted remainders cannot be a nonzero multiple of .
For an integer and positive integer , the remainder in Euclidean division is the unique integer in for which with an integer . It is not the full quotient .
Repeated division with remainder that determines successive digits of a quotient. To generate the fractional digits in base , multiply the current remainder by , divide by the denominator, and keep the resulting remainder for the next step.
For integers and , an integer division algorithm determines the binary numeral system digits of a quotient by testing and conditionally subtracting successively halved multiples of the divisor. The loop invariant , together with , makes each step a halving of the remaining quotient interval. Start with and large enough that . To decrease by one, subtract from and add to exactly when . Both branches preserve the displayed equality and establish . When , the quotient and remainder conditions hold.
A finite integer interval is a set with integers . Its cardinality is , including both endpoints. For example, contains five integers, although the real interval from to has length four.
Infinite integer intervals allow one or both endpoints to be unbounded. Statements about bounded gaps in words quantify over finite integer intervals; their endpoints are indices, rather than arbitrary real positions.
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 integerThe 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]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. §3.3, pp. 55–56: base-B digit vectors, separate sign and nonzero highest digit
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
Repeated Euclidean division constructs the representation exactly. Set . At each step writeKeep 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, defineIt 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]
Notes on the FFT by C. Sidney Burrus. radix-two decimation and digit-reversed ordering
The digit sum of a nonnegative integer in a specified radix is the sum of its numerical digits. Ifwrite , with . For example, . In binary representation, the digit sum is the Hamming weight of the digit string.
Since , the positional expansion givesIn 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 iswith 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.
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 asThis 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.
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 giveswith . 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 Computational Introduction to Number Theory and Algebra by Victor Shoup. §3.3, p. 56: choice of a power-of-two base for stored integer digits
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]
5.1 Decimals. Prealgebra 2e, §5.1, Name Decimals, Tables 5.1–5.2 and Figure 5.2: whole-number and fractional place values
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.
An Alexandrian integer is a positive integer for nonzero integers satisfyingThe factors may be negative. For example, arises from , since .
Conversely, a valid triple cannot be entirely positive, because then . Since its product is positive, exactly one factor is positive. Write it as , so . Both differences have the same sign; they cannot both be negative, because their product would be at most . Thus and are positive and give the parametrization. Enumerating factor pairs of therefore produces the candidates without searching arbitrary signed triples.
A sqube is a positive integer for distinct prime numbers . The ordering matters: , whereas . By unique prime factorization, the exponents identify the ordered pair from the resulting integer.
Every sqube is an Achilles number. It is a powerful number, because both prime exponents are at least two. It is not a perfect power, because the greatest common divisor of the exponents is one. This connects the square-cube construction to two general factorization classes.
A reversible number is a positive integer whose sum with its digit reversal has numerical digits that are all odd integers. Here the radix is ten, and reversing must preserve the digit length: the original number cannot end in zero, because that would create a leading zero after reversal.
For example, , so both and satisfy the rule. The example shows that internal zeros are allowed. In contrast, is excluded by the reversal-length condition, even though has odd digits.
The arithmetic carries couple mirrored digit positions. In , the units sum creates a carry, which makes the next digit . Treating the digit pairs independently would miss this dependence. A counting method can instead track carries from both ends and match them in the middle, avoiding enumeration of every integer of a given length.
A positive integer for which some division with integers and has as consecutive terms of a geometric progression in some order. Writing a reduced common ratio as with and , the three terms have the form for a positive integer .
In this positive integer context, a power of two is for a nonnegative integer , giving . Allowing negative or real exponents gives a broader meaning of exponentiation, which is not intended in the integer divisibility criteria here.
A Mersenne number has the form for a positive integer . Its binary representation consists of ones. For example, is composite, while is prime. If with , the finite geometric series factorizationhas two factors greater than one. Consequently a Mersenne prime requires a prime exponent, but shows that this condition alone is insufficient.
A Mersenne prime is a Mersenne number that is a prime number. It is the prime factor required by the Euclid-Euler theorem; generate . The family is named after Marin Mersenne.
A perfect number is a positive integer equal to the sum of all its positive proper divisors. The divisor itself is excluded: including it gives the equivalent condition for the sum-of-divisors function. The smallest examples are and .
For comparison, has proper divisors , whose sum is : it is a deficient number. The proper divisors of are , whose sum is : it is an abundant number. The proper-divisor sum classifies these examples with the same rule, and gives , so one is not a perfect number.
Proper divisors balance a perfect number, fall short of a deficient number, or exceed an abundant number
. Original exact proper-divisor sums for . Each bar is normalized by its candidate number, and its segments are labelled with the actual proper divisors. The dashed line at one marks equality with the candidate. These are finite arithmetic calculations, not empirical data. Details.The interesting question is how such balances can be constructed without testing every smaller integer as a possible divisor. The Euclid-Euler theorem answers it for even integers: a Mersenne prime gives , and every even perfect number arises this way. For , this produces . The connection links divisor sums to primality testing for a particular family, while keeping the necessary hypotheses visible.[ref]
Euclid's Elements already gives the construction in Book IX, Proposition 36: add a succession of powers of two, and if their sum is prime, multiply by the final power of two. The modern finite geometric series makes the same pattern transparent. This original statement supplies the forward construction, rather than the converse classification of all even perfect numbers.[ref]
An even integer is a perfect number if and only ifThis forces to be a prime number, as shown under Mersenne number. It does not say that every prime exponent works, nor classify possible odd integers.[ref]
Perfect numbers and Mersenne primes by Keith Conrad. Theorem 1.1, pp. 1–2: even-number equivalence and proof
For the forward direction, put and use coprimality of and . Multiplicativity of the sum-of-divisors function and the finite geometric series giveThe prime number hypothesis makes ; replacing it with a composite number changes this factor.
For a short converse outline, write with and an odd integer. The condition givesHere is a positive integer and a proper divisor of . If , the distinct divisors alone exceed the required sum . Thus and , forcing to be prime and .
The prime exponents give Mersenne primes and therefore perfect numbers. But gives . The resulting candidate hasso . It is an abundant number, not a perfect number. Checking only that the exponent is prime would miss this obstruction.
A positive integer whose proper-divisor sum is smaller than itself; equivalently, its sum-of-divisors function satisfies . For example, ; also .
A positive integer whose proper-divisor sum exceeds itself; equivalently, its sum-of-divisors function satisfies . For example, .
The parity of an integer records which of two classes it belongs to: an even number is divisible by , and an odd number is not. Euclidean division gives the unique expressionThe remainder encodes the parity. This applies to negative numbers too: is odd, while is even. Zero is an even number.
Reduction modulo respects addition and multiplication, so the quotient ring records parity arithmetic. If have remainders , then has remainder , and has remainder . In particular, the sum of two odd integers is even, whereas their product is odd. The relation shows that changing sign preserves parity.
Two integers have opposite parity when one is an even number and the other is an odd number. Their sum is then an odd number.
An odd number is an integer not divisible by . Equivalently, it has the unique formThe Euclidean division remainder is one. Examples include ; zero is excluded because it is an even number. The property is independent of primality: is a prime number, is a composite number, and is neither.
An even number is an integer divisible by , so it has the form for an integer . Examples include ; zero is even because . This is the zero remainder class in Euclidean division by .
The only prime number that is even is . Every greater positive even integer has as a proper divisor. This explains why many primality testing procedures handle separately before discarding other even inputs.
A positive integer is square-free when no square number greater than one is a divisor of . It suffices to exclude squares of prime numbers; equivalently, every prime valuation is zero or one:Thus the prime factorization of a square-free integer is a product of distinct prime factors, with no repetitions. One is included: its prime factorization is an empty product and all its prime valuations are zero. These equivalent tests are stated in Grinberg's notes. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781, Floor and arithmetic functions, Definition 2.1.2 and footnote 6
For signed integers, extend the definition by requiring to be a square-free integer, where denotes absolute value. Hence and both qualify. Zero does not: every prime number has its square as a divisor of zero. The Möbius function and radical of an integer below use their existing positive integer domains, so apply them to when handling a negative integer.
For example, is a square-free integer, whereas is not, because and . Being a composite number causes no problem: are all square-free integers. A square-free integer need not be coprime to another integer: and are both square-free integers but have greatest common divisor two. In fact the only signed integers coprime to every integer are , since .
Exact square-free integer classification of the integers from one to sixty
. Green cells are square-free integers; each red cell displays a prime number square that divides its label, choosing the smallest such prime number. Only need testing in this range. There are green cells. This original finite arithmetic diagram is an exact enumeration, not a measurement or an assertion about a limiting frequency. Details.For positive integers , the useful product criterion isThe proof outline is just addition of prime valuations: can stay at most one only if neither input repeats a prime factor and no prime factor occurs in both. Thus is a square-free integer, but is not. An equivalent characterization is that every factorization into positive integers has coprime factors. If , the factorization supplies two factors sharing ; conversely, a shared prime factor forces its square to divide . For , the unordered factor pairs all have greatest common divisor one; for , the pair fails.
Two existing arithmetic functions turn the definition into practical tests:The radical of an integer keeps one copy of each prime factor, so it changes precisely the integers with a repeated prime factor. Its definition is given in Evertse's exercise sheet. [ref]
https://pub.math.leidenuniv.nl/~evertsejh/dio12-ex4.pdf. Jan-Hendrik Evertse, Diophantine approximation, Homework IV, Exercise 20
The Möbius function assigns to a square-free integer with distinct prime factors and zero otherwise; squaring forgets the sign. Consequently counts exactly the green cells. This connects a restriction on repeated prime factors with weighted counting and inclusion-exclusion. [ref]Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781, Definition 2.1.2: the Möbius function
The squarefree part of a positive integer is the unique squarefree integer such that for a positive integer . For example, the squarefree part of is . It retains precisely the primes with odd prime exponents; the radical of an integer instead retains every distinct prime factor.
For a nonnegative real number , the squarefree counting function counts positive square-free integers:For example, , counting . The Möbius function gives the exact formulaTo see why, consider . Only square-free integers contribute. Choosing their prime factors from the primes whose squares divide gives the product . This is one when there are no such prime factors and zero otherwise, so it is the indicator function of squarefreeness. Summing over the positive integers and exchanging two finite sums leaves multiples of each . The floor function makes the formula exact for nonintegral too.
A positive integer is squarefull when every prime dividing it also divides it to at least the second power. Thus is not squarefull as soon as some prime satisfies but .
Every positive integer has a unique factorization with powerful, squarefree, and : assign each prime power of exponent at least two to , and each prime of exponent one to . In general differs from the squarefree part, which instead retains every prime of odd exponent.
An Achilles number is a powerful number greater than one that is not a perfect power. In its prime factorizationevery prime exponent satisfies , and . The first condition is precisely the definition of a powerful number. For the second, with integers exactly when divides every prime exponent; hence a greatest common divisor greater than one is precisely the obstruction.
For example, is an Achilles number because . By contrast, is powerful but is a perfect square, so it is not an Achilles number.
A strong Achilles number is a positive integer for which both and its Euler totient are Achilles numbers. For example,In each prime factorization, every prime exponent is at least two and their greatest common divisor is one. Thus both numbers are powerful without being perfect powers. The extra condition matters: is an Achilles number, but is not powerful, so is not a strong Achilles number.
A square number is an integer of the form for some integer . Consecutive nonnegative squares differ by .
The square part of a positive integer is its largest square divisor, . Dividing by its square part leaves the squarefree part.
For a nonnegative integer , compute its integer square root and accept exactly when . An approximate square root must be corrected with exact integer comparisons before this equality is tested. This procedure distinguishes a squareness test from merely approximating a square root.
Articles by others on the same topic
An integer is a whole number that can be positive, negative, or zero. Integers do not include fractions, decimals, or any non-whole numeric values. The set of integers is typically represented by the symbol **ℤ** and includes numbers such as: - Positive integers: 1, 2, 3, ... - Zero: 0 - Negative integers: -1, -2, -3, ...




