AI & ChatGPT searches , social queriess for ARITHMETIC FUNCTION
Search references for ARITHMETIC FUNCTION. Phrases containing ARITHMETIC FUNCTION
See searches and references containing ARITHMETIC FUNCTION!
Search references for ARITHMETIC FUNCTION. Phrases containing ARITHMETIC FUNCTION
See searches and references containing ARITHMETIC FUNCTION!ARITHMETIC FUNCTION
Function whose domain is the positive integers
\log _{e}(x)} . In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function whose domain is the set of positive
Arithmetic_function
System of arithmetic in proof theory
elementary function arithmetic (EFA), also called elementary arithmetic and exponential function arithmetic, is the system of arithmetic with the usual
Elementary function arithmetic
Elementary_function_arithmetic
Multiplicative function in number theory
the OEIS). In number theory another arithmetic function closely related to the Möbius function is the Mertens function, defined by M ( n ) = ∑ k = 1 n μ
Möbius_function
Function defined on integers in number theory
In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy
Arithmetic_derivative
Function on an integer n which is log(p) if n equals p^k and zero otherwise
Mangoldt function is an arithmetic function named after German mathematician Hans von Mangoldt. It is an example of an important arithmetic function that
Von_Mangoldt_function
arithmetic function is some simpler or better-understood function which takes the same values "on average". Let f {\displaystyle f} be an arithmetic function
Average order of an arithmetic function
Average_order_of_an_arithmetic_function
Method for bounding the errors of numerical computations
errors in mathematical computation by computing function bounds. Numerical methods involving interval arithmetic can guarantee relatively reliable and mathematically
Interval_arithmetic
Function that can be written as a sum over prime factors
an additive function is an arithmetic function f(n) of the positive integer variable n such that whenever a and b are coprime, the function applied to
Additive_function
In number theory, the gcd-sum function, also called Pillai's arithmetical function, is defined for every n {\displaystyle n} by P ( n ) = ∑ k = 1 n gcd
Pillai's arithmetical function
Pillai's_arithmetical_function
Type of zeta function
mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers. The arithmetic zeta function generalizes
Arithmetic_zeta_function
Integers have unique prime factorizations
In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every
Fundamental theorem of arithmetic
Fundamental_theorem_of_arithmetic
Branch of algebraic geometry
Rational points can be directly characterized by height functions which measure their arithmetic complexity. The structure of algebraic varieties defined
Arithmetic_geometry
Function equal to the product of its values on coprime factors
In number theory, a multiplicative function is an arithmetic function f {\displaystyle f} of a positive integer n {\displaystyle n} with the property that
Multiplicative_function
Arithmetic function
multiplicative function (or totally multiplicative function) is an arithmetic function (that is, a function whose domain is the positive integers), such that
Completely multiplicative function
Completely_multiplicative_function
Arithmetic function related to the divisors of an integer
theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number
Divisor_function
Number of partitions of an integer
is credited with discovering that the partition function has nontrivial patterns in modular arithmetic. For instance the number of partitions is divisible
Partition function (number theory)
Partition_function_(number_theory)
Function representing the number of primes less than or equal to a given number
(t)}{t\log ^{2}(t)}}\mathrm {d} t.} Formulas for prime-counting functions come in two kinds: arithmetic formulas and analytic formulas. Analytic formulas for prime-counting
Prime-counting_function
Formula for the sum of an arithmetic function
sum of an arithmetic function, by means of an inverse Mellin transform. Let { a ( n ) } {\displaystyle \{a(n)\}} be an arithmetic function, and let g
Perron's_formula
Mathematical operation on arithmetical functions
convolution (or divisor convolution) is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav
Dirichlet_convolution
Number of integers coprime to and less than n
Dirichlet's theorem on arithmetic progressions. The Dirichlet series for φ(n) may be written in terms of the Riemann zeta function as: ∑ n = 1 ∞ φ ( n )
Euler's_totient_function
Type of average of a collection of numbers
In mathematics and statistics, the arithmetic mean ( /ˌærɪθˈmɛtɪk/ arr-ith-MET-ik), arithmetic average, or just the mean or average is the sum of a collection
Arithmetic_mean
Number divisible only by 1 and itself
there are arbitrarily long finite arithmetic progressions consisting only of primes. Euler noted that the function n 2 − n + 41 {\displaystyle n^{2}-n+41}
Prime_number
Relation between pairs of arithmetic functions
classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced
Möbius_inversion_formula
Computation modulo a fixed integer
In mathematics, modular arithmetic is a system of arithmetic operations for integers, differing from the usual ones in that numbers "wrap around" when
Modular_arithmetic
Type of asymptotic behavior useful in number theory
arithmetic function is some simpler or better-understood function which "usually" takes the same or closely approximate values. Let f be a function on
Normal order of an arithmetic function
Normal_order_of_an_arithmetic_function
orders of an arithmetic function in number theory, a branch of mathematics, are the best possible bounds of the given arithmetic function. Specifically
Extremal orders of an arithmetic function
Extremal_orders_of_an_arithmetic_function
Axioms for the natural numbers
define the arithmetical properties of the natural numbers. The naturals are assumed to be closed under a single-valued "successor" function S. For every
Peano_axioms
Branch of mathematical logic
common in second-order arithmetic, is greatly reduced. For example, a continuous function on the Cantor space is just a function that maps binary sequences
Reverse_mathematics
Number-theoretical function
In number theory, the sum of squares function is an arithmetic function that gives the number of representations for a given positive integer n {\displaystyle
Sum_of_squares_function
Topics referred to by the same term
by sigma function one can mean one of the following: The sum-of-divisors function σa(n), an arithmetic function Weierstrass sigma function, related to
Sigma_function
Arithmetic function
Liouville function, named after French mathematician Joseph Liouville and denoted λ ( n ) {\displaystyle \lambda (n)} , is an important arithmetic function. Its
Liouville_function
Topics referred to by the same term
Fourier coefficients of the Ramanujan modular form Divisor function, an arithmetic function giving the number of divisors of an integer This disambiguation
Tau_function
Mathematical function
the Chebyshev function is either a scalarising function (Tchebycheff function) or one of two related functions. The first Chebyshev function ϑ(x) or θ(x)
Chebyshev_function
Numbers obtained by adding the two previous ones
} For a given n, this matrix can be computed in O(log n) arithmetic operations, using the exponentiation by squaring method. Taking the determinant
Fibonacci_sequence
Mathematical series
(n)}{n^{s}}}} where L(χ, s) is a Dirichlet L-function. If the arithmetic function f has a Dirichlet inverse function f − 1 ( n ) {\displaystyle f^{-1}(n)}
Dirichlet_series
function Mathieu function Mittag-Leffler function Painlevé transcendents Parabolic cylinder function Arithmetic–geometric mean Ackermann function: in the theory
List of mathematical functions
List_of_mathematical_functions
Natural number
1088/0026-1394/31/6/013. Peano, Giuseppe (1889). Arithmetices principia, nova methodo exposita [The principles of arithmetic, presented by a new method]. An excerpt
1
Number used for counting
numbers coming after smaller ones in the list 1, 2, 3, .... Two basic arithmetical operations are defined on natural numbers: addition and multiplication
Natural_number
IEEE standard for floating-point arithmetic
numbers during arithmetic and conversions operations: arithmetic and other operations (such as trigonometric functions) on arithmetic formats exception
IEEE_754
Figurate number
S2CID 53079729 Wikimedia Commons has media related to triangular numbers. "Arithmetic series", Encyclopedia of Mathematics, EMS Press, 2001 [1994] Triangular
Triangular_number
Mathematical concept
and declaring a subset of A to be arithmetical if the set of corresponding Gödel numbers is arithmetical. A function f : A ⊆ N k → N {\displaystyle f:A\subseteq
Arithmetical_set
Combinational digital circuit
In computing, an arithmetic logic unit (ALU) is a combinational digital circuit that performs arithmetic and bitwise operations on integer binary numbers
Arithmetic_logic_unit
Branch of pure mathematics
of mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of
Number_theory
Arithmetic function
\mathbb {P} }\left(1+{\frac {1}{p^{2}(p-1)}}\right)=1.339784\ldots .} Arithmetic function Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren. Concrete Mathematics
Totient_summatory_function
Recursive integer sequence
binomial coefficients, by Stirling's approximation for n!, or via generating functions. The only Catalan numbers Cn that are odd are those for which n = 2k −
Catalan_number
Numeric quantity representing the center of a collection of numbers
purpose. The arithmetic mean, also known as "arithmetic average", is the sum of the values divided by the number of values. The arithmetic mean of a set
Mean
Count of the possible partitions of a set
doi:10.1017/S1757748900002334. Becker, H. W.; Riordan, John (1948). "The arithmetic of Bell and Stirling numbers". American Journal of Mathematics. 70 (2):
Bell_number
Integer having a non-trivial divisor
order of the factors. This fact is called the fundamental theorem of arithmetic. There are several known primality tests that can determine whether a
Composite_number
Number taken as representative of a list of numbers
elements is that element itself. The function g(x1, x2, ..., xn) = x1+x2+ ··· + xn provides the arithmetic mean. The function g(x1, x2, ..., xn) = x1x2···xn
Average
Number raised to the third power
In arithmetic and algebra, the cube of a number n is its third power, that is, the result of multiplying three instances of n together. The cube of a number
Cube_(algebra)
Device used for calculations
portable electronic device used to perform calculations, ranging from basic arithmetic to complex mathematics. The first solid-state electronic calculator was
Calculator
Iterative algorithm on numbers
_{i=0}^{n}b^{i}\right)+k\\&=m\\\end{aligned}}} Mathematics portal Arithmetic dynamics Collatz conjecture Dudeney number Factorion Happy number Kaprekar
Kaprekar's_routine
Number of prime factors of a natural number
counts the total number of prime factors with multiplicity (see arithmetic function). That is, if we have a prime factorization of n {\displaystyle n}
Prime_omega_function
Product of an integer with itself
is the difference-of-squares formula, which can be useful for mental arithmetic: for example, 47 × 53 can be easily computed as 502 − 32 = 2500 − 9 =
Square_number
Product of two prime numbers
Sequences. OEIS Foundation. Nowicki, Andrzej (2013-07-01), Second numbers in arithmetic progressions, arXiv:1306.6424 Conway, J. H. (2008-06-18), Counting Groups:
Semiprime
Mathematical function of two positive real arguments
geometric means. The arithmetic–geometric mean is used in fast algorithms for exponential, trigonometric functions, and other special functions, as well as some
Arithmetic–geometric_mean
Generalization of means
quasi-arithmetic mean or generalised f-mean or Kolmogorov-Nagumo-de Finetti mean is one generalisation of the more familiar means such as the arithmetic mean
Quasi-arithmetic_mean
N-th root of the product of n numbers
number, finding the arithmetic mean of the logarithms, and then returning the result to linear scale by using the exponential function exp {\displaystyle
Geometric_mean
Sum of all proper divisors of a natural number
26, 1, 76, 8, 43, ... (sequence A001065 in the OEIS) The aliquot sum function can be used to characterize several notable classes of numbers: 1 is the
Aliquot_sum
Hardware description language (VHDL) library package for use in electronic circuit design
for VHDL. It provides arithmetic functions for vectors. Overrides of std_logic_vector are defined for signed and unsigned arithmetic. It defines numeric
Numeric_std
Number
consequently dividing by 0 is generally considered to be undefined in arithmetic. As a numerical digit, 0 plays a crucial role in decimal notation: it
0
Arithmetical function
is a cyclotomic polynomial of p − k {\displaystyle p^{-k}} ), the arithmetic functions defined by J k ( n ) J 1 ( n ) {\displaystyle {\frac {J_{k}(n)}{J_{1}(n)}}}
Jordan's_totient_function
Mathematical operation
series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little
Dirichlet_series_inversion
arithmetic function over the divisors of a natural number n {\displaystyle n} , or equivalently the Dirichlet convolution of an arithmetic function f
Divisor_sum_identities
Summatory function of the Möbius function
Perron's formula Liouville's function Davenport, H. (November 1937). "On Some Infinite Series Involving Arithmetical Functions (Ii)". The Quarterly Journal
Mertens_function
Binary representation for signed numbers
Affeldt, Reynald & Marti, Nicolas (2006). Formal verification of arithmetic functions in SmartMIPS Assembly (PDF) (Report). Archived from the original
Two's_complement
Dirichlet's theorem on arithmetic progressions Linnik's theorem Elliott–Halberstam conjecture Functional equation (L-function) Chebotarev's density theorem
List_of_number_theory_topics
Class of natural numbers with many divisors
{d(n)}{n^{\varepsilon }}}\geq {\frac {d(k)}{k^{\varepsilon }}}} where d(n), the divisor function, denotes the number of divisors of n. The term was coined by Ramanujan
Superior highly composite number
Superior_highly_composite_number
Well-quasi-ordering of finite trees
arithmetic grows phenomenally fast as a function of n {\displaystyle n} , far faster than any primitive recursive function or the Ackermann function,
Kruskal's_tree_theorem
Count of permutations by cycles
for more general classes of products. In particular, for any fixed arithmetic function f : N → C {\displaystyle f:\mathbb {N} \rightarrow \mathbb {C} }
Stirling numbers of the first kind
Stirling_numbers_of_the_first_kind
Function in number theory given by Srinivasa Ramanujan
Spilker, Jürgen (1994). Arithmetical Functions. An introduction to elementary and analytic properties of arithmetic functions and to some of their almost-periodic
Ramanujan's_sum
Conjecture on zeros of the zeta function
every arithmetic scheme or a scheme of finite type over integers. The arithmetic zeta function of a regular connected equidimensional arithmetic scheme
Riemann_hypothesis
Algorithmic runtime requirements for common math procedures
Borwein & Borwein. The elementary functions are constructed by composing arithmetic operations, the exponential function ( exp {\displaystyle \exp } ), the
Computational complexity of mathematical operations
Computational_complexity_of_mathematical_operations
Mathematical system
In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative
Second-order_arithmetic
Computer approximation for real numbers
In computing, floating-point arithmetic (FP) is arithmetic on subsets of real numbers formed by a significand (a signed sequence of a fixed number of
Floating-point_arithmetic
general towers. A p-adic L-function arising in this way is typically called an arithmetic p-adic L-function as it encodes arithmetic data of the Galois module
P-adic_L-function
Quickly growing function
total-computable-but-not-primitive-recursive function, Ackermann's original function is seen to extend the basic arithmetic operations beyond exponentiation, although
Ackermann_function
Formalization of the natural numbers
see Skolem arithmetic. The language of PRA can express arithmetic propositions involving natural numbers and any primitive recursive function, including
Primitive recursive arithmetic
Primitive_recursive_arithmetic
Square of a triangular number
120 CE). Nicomachus, at the end of Chapter 20 of his Introduction to Arithmetic, pointed out that if one writes a list of the odd numbers, the first is
Squared_triangular_number
Mathematical concept
the arithmetic mean of the limit from the left and the limit from the right at discontinuities. His formula was given in terms of the related function f
Explicit formulae for L-functions
Explicit_formulae_for_L-functions
Mathematical concept
In mathematics, the inverse function of a function f (also called the inverse of f) is a function that undoes the operation of f. The inverse of f exists
Inverse_function
Numbers whose prime factors all divide the number more than once
(2k+1 − 1)k+1 are k-powerful numbers in an arithmetic progression. Moreover, if a1, a2, ..., as are k-powerful in an arithmetic progression with common difference
Powerful_number
Integer where the average of its positive divisors is also an integer
theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer. For instance, 6 is an arithmetic number because
Arithmetic_number
Certain type of divisor of an integer
[The number of bi-unitary divisors of an integer, in The Theory of Arithmetic Functions, Lecture Notes in Mathematics 251: 273–282, New York, Springer–Verlag]
Unitary_divisor
Numerical calculations carrying along derivatives
differentiation, and differentiation arithmetic is a set of techniques to evaluate the partial derivative of a function specified by a computer program. Automatic
Automatic_differentiation
Result of multiplying four instances of a number together
In arithmetic and algebra, the fourth power of a number n is the result of multiplying four instances of n together: n4 = n × n × n × n. Fourth powers
Fourth_power
Summability method in physics
{\displaystyle \epsilon _{i,j,k}} Zeta-function regularization gives an analytic structure to any sums over an arithmetic function f(n). Such sums are known as
Zeta_function_regularization
Number equal to the sum of its proper divisors
www-groups.dcs.st-and.ac.uk. Retrieved 9 May 2018. In Introduction to Arithmetic, Chapter 16, he says of perfect numbers, "There is a method of producing
Perfect_number
Number that is the result of operation on its own digits
expression using all its own digits in combination with any of the four basic arithmetic operators (+, −, ×, ÷), additive inverses, parentheses, exponentiation
Friedman_number
Ordered list of whole numbers
In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula
Integer_sequence
Limitative results in mathematical logic
provability within a system could be expressed purely in terms of arithmetical functions that operate on Gödel numbers of sentences of the system. Therefore
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Describes approximate behavior of a function
number theory, big O notation expresses bounds on the growth of an arithmetical function, as for the remainder term in the prime number theorem. In mathematical
Big_O_notation
study properties of arithmetical functions. Bell series were introduced and developed by Eric Temple Bell. Given an arithmetic function f {\displaystyle
Bell_series
set one of its elements. These properties concern how the function is affected by arithmetic operations on its argument. The following are special examples
List_of_types_of_functions
Summatory function of the divisor-counting function
In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic
Divisor_summatory_function
Number, product of consecutive integers
number in the Fibonacci sequence and the only pronic Lucas number. The arithmetic mean of two consecutive pronic numbers is a square number: n ( n + 1 )
Pronic_number
S-shaped curve
logarithmic curve, and by analogy with arithmetic and geometric. His growth model is preceded by a discussion of arithmetic growth and geometric growth (whose
Logistic_function
Ten raised to an integer power
pseudoprime Strong pseudoprime Arithmetic functions and dynamics Divisor functions Abundant Almost perfect Arithmetic Betrothed Colossally abundant Deficient
Power_of_10
Mathematical tool for summing arithmetic functions
Euler–Mascheroni constant. Perron's formula – Formula for the sum of an arithmetic function Apostol, Tom M. (1976). Introduction to analytic number theory. New
Dirichlet_hyperbola_method
Number that cannot be written as an aliquot sum
integer. That is, these numbers are not in the image of the aliquot sum function. Their study goes back at least to Abu Mansur al-Baghdadi (circa 1000 AD)
Untouchable_number
ARITHMETIC FUNCTION
ARITHMETIC FUNCTION
Male
Egyptian
, an Egyptian functionary.
Surname or Lastname
English (chiefly Kent and Sussex)
English (chiefly Kent and Sussex) : occupational name for a designer or engineer, from a Middle English reduced form of Old French engineor ‘contriver’ (a derivative of engaigne ‘cunning’, ‘ingenuity’, ‘stratagem’, ‘device’). Engineers in the Middle Ages were primarily designers and builders of military machines, although in peacetime they might turn their hands to architecture and other more pacific functions.German : from the Latin personal name Januarius (see January 1). Jänner is a South German word for ‘January’, and so it is possible that this is one of the surnames acquired from words denoting months of the year, for example by converts who had been baptized in that month, people who were born or baptized in that month, or people whose taxes were due in January.
Male
Egyptian
, an Egyptian functionary.
Boy/Male
Buddhist, Indian, Japanese
Mysterious Function
Surname or Lastname
English
English : occupational name for a dresser of cloth, Old English fullere (from Latin fullo, with the addition of the English agent suffix). The Middle English successor of this word had also been reinforced by Old French fouleor, foleur, of similar origin. The work of the fuller was to scour and thicken the raw cloth by beating and trampling it in water. This surname is found mostly in southeast England and East Anglia. See also Tucker and Walker.In a few cases the name may be of German origin with the same form and meaning as 1 (from Latin fullare).Americanized version of French Fournier.Samuel Fuller (1589–1633), born in Redenhall, Norfolk, England, was among the Pilgrim Fathers who sailed on the Mayflower in 1620. He was a deacon of the church and until his death functioned as Plymouth Colony’s physician.
Male
Egyptian
, the son of the functionary Heknofre.
Surname or Lastname
English
English : nickname from the animal, Middle English catte ‘cat’. The word is found in similar forms in most European languages from very early times (e.g. Gaelic cath, Slavic kotu). Domestic cats were unknown in Europe in classical times, when weasels fulfilled many of their functions, for example in hunting rodents. They seem to have come from Egypt, where they were regarded as sacred animals.English : from a medieval female personal name, a short form of Catherine.Variant spelling of German and Dutch Katt.
Surname or Lastname
English
English : topographic name for someone who lived by the gates of a medieval walled town. The Middle English singular gate is from the Old English plural, gatu, of geat ‘gate’ (see Yates). Since medieval gates were normally arranged in pairs, fastened in the center, the Old English plural came to function as a singular, and a new Middle English plural ending in -s was formed. In some cases the name may refer specifically to the Sussex place Eastergate (i.e. ‘eastern gate’), known also as Gates in the 13th and 14th centuries, when surnames were being acquired.Americanized spelling of German Götz (see Goetz).Translated form of French Barrière (see Barriere).In New England, Gates was the preferred English version of the name of an extensive French family, called Barrière dit Langevin.
Biblical
Look for pages within Wikipedia that link to this title
If a page was recently created here it may not be visible yet because of a delay in updating the database; wait a few minutes or try the function.
Look for pages within Wikipedia that link to this title
Male
Egyptian
, a high Egyptian functionary.
Male
Egyptian
, a great functionary.
Male
Celtic
, great justiciary, or functionary.
Male
Egyptian
, Functionary of the Interior.
ARITHMETIC FUNCTION
ARITHMETIC FUNCTION
Boy/Male
Indian, Punjabi, Sikh
Kind Devotee
Boy/Male
Arabic, Australian, Malaysian, Muslim, Pashtun
Lion
Boy/Male
Hindu, Indian
Light
Girl/Female
Hindu
Dove
Girl/Female
Arabic, Muslim
Face Reader
Boy/Male
American, Australian, Christian
Sickness
Boy/Male
Indian
Evil spirit.
Girl/Female
Indian
Is associated to Goddess Durga
Boy/Male
Muslim
Slave of the excellence, Servant of the glorious, Servant of the noble
Girl/Female
Latin
Rebirth.
ARITHMETIC FUNCTION
ARITHMETIC FUNCTION
ARITHMETIC FUNCTION
ARITHMETIC FUNCTION
ARITHMETIC FUNCTION
a.
Of or pertaining to a unit or units; relating to unity; as, the unitary method in arithmetic.
v. t.
To subject to arithmetical division.
v. t.
To subtract by arithmetical operation; to deduct.
n.
That part of arithmetic which treats of adding numbers.
n.
Arithmetic.
n.
One skilled in arithmetic.
a.
Having an assignable arithmetical or numerical value or meaning; not imaginary.
a.
Having equal differences; as, the terms of arithmetical progression are equidifferent.
n.
A book containing the principles of this science.
a.
Sexagesimal, or made on the scale of 60; as, logistic, or sexagesimal, arithmetic.
adv.
The arithmetical character 0; a cipher. See Cipher.
v. i.
To use figures in a mathematical process; to do sums in arithmetic.
n.
The four "liberal arts," arithmetic, music, geometry, and astronomy; -- so called by the schoolmen. See Trivium.
n.
The science of numbers; the art of computation by figures.
n.
Arithmetical subtraction.
n.
A system of arithmetic, in which numbers are expressed in a scale of 60; logistic arithmetic.
v. i.
To perform the arithmetical operation of addition; as, he adds rapidly.
a.
Of or pertaining to arithmetic; according to the rules or method of arithmetic.
n.
The rule of three, in arithmetic, in which the three given terms, together with the one sought, are proportional.
adv.
Conformably to the principles or methods of arithmetic.