AI & ChatGPT searches , social queriess for MULTIPLICATIVE SEQUENCE
Search references for MULTIPLICATIVE SEQUENCE. Phrases containing MULTIPLICATIVE SEQUENCE
See searches and references containing MULTIPLICATIVE SEQUENCE!
Search references for MULTIPLICATIVE SEQUENCE. Phrases containing MULTIPLICATIVE SEQUENCE
See searches and references containing MULTIPLICATIVE SEQUENCE!MULTIPLICATIVE SEQUENCE
Concept in mathematics
In mathematics, a multiplicative sequence or m-sequence is a sequence of polynomials associated with a formal group structure. They have application in
Multiplicative_sequence
Ring homomorphism from the cobordism ring of manifolds to another ring
In mathematics, a genus of a multiplicative sequence is a ring homomorphism from the ring of smooth compact manifolds up to the equivalence of bounding
Genus of a multiplicative sequence
Genus_of_a_multiplicative_sequence
Finite or infinite ordered list of elements
In other instances, sequences are often called multiplicative, if an = na1 for all n. Moreover, a multiplicative Fibonacci sequence satisfies the recursion
Sequence
Number which when multiplied by x equals 1
is a number which when multiplied by x yields the multiplicative identity, 1. The multiplicative inverse of a fraction a b {\displaystyle {\tfrac {a}{b}}}
Multiplicative_inverse
Arithmetical operation
generalizations See Multiplication in group theory, above, and multiplicative group, which for example includes matrix multiplication. A very general, and
Multiplication
Numbers obtained by adding the two previous ones
Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the Fibonacci sequence are known
Fibonacci_sequence
Group of units of the ring of integers modulo n
the multiplication is associative, commutative, and that the class of 1 is the unique multiplicative identity. Finally, given a, the multiplicative inverse
Multiplicative group of integers modulo n
Multiplicative_group_of_integers_modulo_n
Mathematical formula
0, 3, 6, 9, 2, 5, 8, 2, 8, 4, 0. (sequence A031347 in the OEIS) Multiplicative digital roots are the multiplicative equivalent of digital roots, with
Multiplicative_digital_root
Property of a number
is the smallest number of multiplicative persistence 3. In base 10, there is thought to be no number with a multiplicative persistence greater than 11;
Persistence_of_a_number
Mathematical operation in linear algebra
as matrix multiplication (up to a multiplicative constant), the computational complexity of matrix multiplication appears throughout numerical linear
Matrix_multiplication
Gives the signature of a smooth compact oriented manifold in terms of Pontryagin numbers
Hirzebruch–Riemann–Roch theorem. The L-genus is the genus for the multiplicative sequence of polynomials associated to the characteristic power series x
Hirzebruch_signature_theorem
Characteristic class in algebraic topology
\operatorname {td} _{j}} defines the Todd polynomials: they form a multiplicative sequence with Q {\displaystyle Q} as characteristic power series. If E {\displaystyle
Todd_class
Two raised to an integer power
is the multiplicative order of 2 modulo 5k, which is φ(5k) = 4 × 5k−1 (see Multiplicative group of integers modulo n).[citation needed] (sequence A140300
Power_of_two
Algorithm to multiply two numbers
such a short sequence. In addition to the standard long multiplication, there are several other methods used to perform multiplication by hand. Such
Multiplication_algorithm
Way to write a number as a product of other numbers
pointwise. Although the study of multiplicative partitions has been ongoing since at least 1923, the name "multiplicative partition" appears to have been
Multiplicative_partition
Topics referred to by the same term
(mathematics), a classifying property of a mathematical object Genus of a multiplicative sequence Geometric genus In graph embedding, the genus of the graph is the
Genus_(disambiguation)
Number used in combinatorial game theory
Nimber multiplication is associative and commutative, with the ordinal 1 as the multiplicative identity element. Moreover, nimber multiplication distributes
Nimber
Telecommunication device that obscures signals
systems. A multiplicative scrambler is recursive, and a multiplicative descrambler is non-recursive. Unlike additive scramblers, multiplicative scramblers
Scrambler
Number of "holes" of a surface
structure of biomolecules. Arithmetic genus Geometric genus Genus of a multiplicative sequence Genus of a quadratic form Group (mathematics) Spinor genus Popescu-Pampu
Genus_(mathematics)
Natural number
generally, in algebra, it denotes the multiplicative identity in any unital ring or field. An element with a multiplicative inverse is called a unit, generalizing
1
Mathematical table
columns for multiplication by 1, the multiplicative identity, which satisfies a × 1 = a. The traditional rote learning of multiplication was based on
Multiplication_table
Performing order of mathematical operations
is replaced with multiplication by the reciprocal (multiplicative inverse) then the associative and commutative laws of multiplication allow the factors
Order_of_operations
Recursive integer sequence
The Catalan numbers are a sequence of natural numbers that occur in various counting problems, often involving recursively defined objects. They are named
Catalan_number
Patterns of nucleic acids that occur in multiple copies throughout the genome
based on the length of the repeated sequence and/or the mode of multiplication. While some repeated DNA sequences are important for cellular functioning
Repeated_sequence_(DNA)
Method for computing the relation of two integers with their greatest common divisor
With that provision, x is the modular multiplicative inverse of a modulo b, and y is the modular multiplicative inverse of b modulo a. Similarly, the
Extended_Euclidean_algorithm
Function equal to the product of its values on coprime factors
not multiplicative. However, r 2 ( n ) / 4 {\displaystyle r_{2}(n)/4} is multiplicative. In the On-Line Encyclopedia of Integer Sequences, sequences of
Multiplicative_function
Mathematics optimization problem
chain multiplication (or the matrix chain ordering problem) is an optimization problem concerning the most efficient way to multiply a given sequence of
Matrix_chain_multiplication
Number used for counting
objects "larger", than the other. A sequence is a list of objects in a specific order. More precisely, a sequence is a function that assigns an object
Natural_number
Arithmetic operation
invertible elements in a multiplicative monoid, that is, an algebraic structure, with an associative multiplication and a multiplicative identity denoted 1
Exponentiation
Sequence of homomorphisms such that each kernel equals the preceding image
(multiplicative notation). Consider the sequence 0 → A → B {\displaystyle 0\to A\to B} . The image of the leftmost map is 0. Therefore the sequence is
Exact_sequence
Online database of integer sequences
more – More terms of the sequence are wanted. Readers can submit an extension. mult – The sequence corresponds to a multiplicative function. Term a(1) should
On-Line Encyclopedia of Integer Sequences
On-Line_Encyclopedia_of_Integer_Sequences
Tool in homological algebra
algebra to H(E; R). The multiplicative structure can be very useful for calculating differentials on the sequence. Spectral sequences can be constructed by
Spectral_sequence
Cycle through all length-k sequences
In combinatorial mathematics, a de Bruijn sequence of order n on a size-k alphabet A is a cyclic sequence in which every possible length-n string on A
De_Bruijn_sequence
Complex-valued mathematical sequence
{\tilde {u}}} is the multiplicative inverse of u modulo N ZC {\displaystyle N_{\text{ZC}}} . 3. The auto correlation of a Zadoff–Chu sequence with a cyclically
Zadoff–Chu_sequence
2017 research paper by Google
others. These multiplicative units are conceptually distinct from the additive attention mechanism later introduced for sequence-to-sequence models. Neural
Attention_Is_All_You_Need
Algebraic ring without a multiplicative identity
same properties as a ring, but without assuming the existence of a multiplicative identity. The term rng is meant to suggest that it is a ring without
Rng_(algebra)
Infinite integer series where the next number is the sum of the two preceding it
Lucas sequence is an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and the
Lucas_number
Irreducible polynomial whose roots are nth roots of unity
with the multiplicative order modulo a prime number. More precisely, given a prime number p and an integer b coprime with p, the multiplicative order of
Cyclotomic_polynomial
Vector space of infinite sequences
of functions and pointwise scalar multiplication. All sequence spaces are linear subspaces of this space. Sequence spaces are typically equipped with
Sequence_space
Sequence of integers
In number theory, the Padovan sequence is the sequence of integers P(n) defined by the initial values: P ( 0 ) = P ( 1 ) = P ( 2 ) = 1 , {\displaystyle
Padovan_sequence
Iterative algorithm on numbers
-\beta } to produce the next number of the sequence. Repeat step 2. The sequence is called a Kaprekar sequence and the function K b ( n ) = α − β {\displaystyle
Kaprekar's_routine
Numbers with a certain property involving recursive summation
1^{2}+0^{2}=1} . On the other hand, 4 is not a happy number because the sequence starting with 4 2 = 16 {\displaystyle 4^{2}=16} and 1 2 + 6 2 = 37 {\displaystyle
Happy_number
Computation modulo a fixed integer
a modular multiplicative inverse of a modulo m. If a ≡ b (mod m) and a−1 exists, then a−1 ≡ b−1 (mod m) (compatibility with multiplicative inverse, and
Modular_arithmetic
Algorithm for modelling sequential data
others. These multiplicative units are conceptually distinct from the additive attention mechanism later introduced for sequence-to-sequence models. Neural
Transformer_(deep_learning)
Open problem on 3x+1 and x/2 functions
after receiving his doctorate. The sequence of numbers involved is sometimes referred to as the hailstone sequence, hailstone numbers or hailstone numerals
Collatz_conjecture
Axiomatic definition of a class of L-functions
exponentiation of Dirichlet series, one can deduce that an is a multiplicative sequence and that F p ( s ) = ∑ n = 0 ∞ a p n p n s for Re ( s ) > 1. {\displaystyle
Selberg_class
Integer invariant of certain classes of topological manifolds
structure is divisible by 16. Hirzebruch signature theorem Genus of a multiplicative sequence Rokhlin's theorem Hatcher, Allen (2003). Algebraic topology (PDF)
Signature_(topology)
Algorithm for fast modular multiplication
Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for performing fast modular multiplication. It was introduced
Montgomery modular multiplication
Montgomery_modular_multiplication
Ten raised to an integer power
ten are: 1, 10, 100, 1,000, 10,000, 100,000, 1,000,000, 10,000,000... (sequence A011557 in the OEIS) In decimal notation the nth power of ten is written
Power_of_10
Theorem about natural numbers
proved by Reuben Goodstein in 1944, which states that every Goodstein sequence (as defined below) eventually terminates at 0. Laurence Kirby and Jeff
Goodstein's_theorem
Mathematical sequence of numbers
A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by
Geometric_progression
In number theory, two positive integers a and b are said to be multiplicatively independent if their only common integer power is 1. That is, for integers
Multiplicative_independence
Number sequence 3,0,2,3,2,5,5,7,10,...
mathematics, the Perrin numbers are a doubly infinite constant-recursive integer sequence with characteristic equation x3 = x + 1. The Perrin numbers, named after
Perrin_number
Number used to approximate the square root of 2
In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational
Pell_number
Square of numbers with equal row, column and diagonal totals
some other operation. For example, a multiplicative magic square has a constant product of numbers. A multiplicative magic square can be derived from an
Magic_square
Modulation technique to reduce signal interference
end. This is commonly implemented by the element-wise multiplication with the spreading sequence, followed by summation over a message symbol period. This
Direct-sequence spread spectrum
Direct-sequence_spread_spectrum
Repeated sum of a number's digits
_{b}(a)\cdot \operatorname {dr} _{b}(c)).} This is a consequence of multiplicative compatibility modulo b − 1 {\displaystyle b-1} . Compatibility with
Digital_root
Branch of elementary mathematics
{\displaystyle 48\div 8=48\times {\tfrac {1}{8}}} . The multiplicative identity element is 1 and the multiplicative inverse of a number is the reciprocal of that
Arithmetic
Integer having a non-trivial divisor
15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36. (sequence A002808 in the OEIS) Every composite number can be written as the product
Composite_number
Mapping arbitrary data to fixed-size values
(modulo) by a constant can be inverted to become a multiplication by the word-size multiplicative-inverse of that constant. This can be done by the programmer
Hash_function
Algebraic structure with addition, multiplication, and division
+ (−a) = 0. Multiplicative inverses: for every a ≠ 0 in F, there exists an element in F, denoted by a−1 or 1/a, called the multiplicative inverse of a
Field_(mathematics)
Spectral sequence
In mathematics, the Adams spectral sequence is a spectral sequence introduced by J. Frank Adams (1958) which computes the stable homotopy groups of topological
Adams_spectral_sequence
Count of the possible partitions of a set
numbers, then B n {\displaystyle B_{n}} gives the number of different multiplicative partitions of N {\displaystyle N} . These are factorizations of N {\displaystyle
Bell_number
Multiplicative function in number theory
The Möbius function μ ( n ) {\displaystyle \mu (n)} is a multiplicative function in number theory introduced by the German mathematician August Ferdinand
Möbius_function
Discrete Fourier transform algorithm
computes the discrete Fourier transform (DFT), or its inverse (IDFT), of a sequence. A Fourier transform converts a signal from its original domain (often
Fast_Fourier_transform
Algorithm that generates an approximation of a random number sequence
generating a sequence of numbers whose properties approximate the properties of sequences of random numbers. The PRNG-generated sequence is not truly
Pseudorandom_number_generator
Mathematical sequence
integer sequence devised by and named after Stanisław Ulam, who introduced it in 1964. The standard Ulam sequence (the (1, 2)-Ulam sequence) starts with
Ulam_number
Abundant number whose proper divisors are all deficient numbers
abundant numbers are: 20, 70, 88, 104, 272, 304, 368, 464, 550, 572 ... (sequence A071395 in the OEIS) The smallest odd primitive abundant number is 945
Primitive_abundant_number
Mathematical form
integral (as a continuous equivalent to the product of a sequence or as the multiplicative version of the normal/standard/additive integral. The product
Product_(mathematics)
Numbers in a type of Lucas sequence
integer sequence named after the German mathematician Ernst Jacobsthal. Like the related Fibonacci numbers, they are a specific type of Lucas sequence U n
Jacobsthal_number
Modular arithmetic concept
classes modulo n. As explained in the article multiplicative group of integers modulo n, this multiplicative group Z n × {\displaystyle \mathbb {Z} _{n}^{\times
Primitive_root_modulo_n
Number representing a continuous quantity
{a}{b}},} or a / b {\displaystyle a/b} and defined as the multiplication of a with the multiplicative inverse of b; that is, a b = a b − 1 . {\displaystyle
Real_number
Pair of integers related by their divisors
10856), (12285, 14595), (17296, 18416), (63020, 76084), and (66928, 66992) (sequence A259180 in the OEIS). It is unknown if there are infinitely many pairs
Amicable_numbers
Algorithm for integer multiplication
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a
Karatsuba_algorithm
Number of orderings allowing ties
2^{n-1}} ordered multiplicative partitions. Numbers that are neither squarefree nor prime powers have a number of ordered multiplicative partitions that
Ordered_Bell_number
Multiplicative partitions of factorials are expressions of values of the factorial function as products of powers of prime numbers. They have been studied
Multiplicative partitions of factorials
Multiplicative_partitions_of_factorials
Type of vector space in math
Hilbert spaces include spaces of square-integrable functions, spaces of sequences, Sobolev spaces consisting of generalized functions, and Hardy spaces
Hilbert_space
Algebraic structure with addition and multiplication
defined to have a multiplicative identity, while a structure with the same axiomatic definition but without the requirement for a multiplicative identity is
Ring_(mathematics)
Type of number introduced by Mike Keith
True sequence = [] y = x while y > 0: sequence.append(y % b) y = y // b digit_count = len(sequence) sequence.reverse() while sequence[len(sequence) - 1]
Keith_number
Number that when multiplied by another number moves its last digit to its front
University Press UK, 2000. Sequence OEIS: A092697 in the On-Line Encyclopedia of Integer Sequences. Bernstein, Leon (1968), "Multiplicative twins and primitive
Parasitic_number
Names of numbers in English
attacks) is usually read nine eleven. A few numbers have specialised multiplicative numbers (adverbs), also called adverbial numbers, which express how
English_numerals
Type of Poulet number
and a super-Poulet number. The super-Poulet numbers below 10,000 are (sequence A050217 in the OEIS): It is relatively easy to get super-Poulet numbers
Super-Poulet_number
Number equal to the sum of its proper divisors
function s(n) = σ(n) − n, and the aliquot sequence associated with a perfect number is a constant sequence. All perfect numbers are also S {\displaystyle
Perfect_number
Italian mathematician (c. 1170 – c. 1240/50)
of Liber Abaci (Book of Calculation) and also introduced Europe to the sequence of Fibonacci numbers, which he used as an example in Liber Abaci. Fibonacci
Fibonacci
fast multiplication algorithm for large integers Toom–Cook multiplication: (Toom3) a multiplication algorithm for large integers Multiplicative inverse
List_of_algorithms
Prime number of the form 2^n – 1
(sequence A002515 in the OEIS). For these primes p, 2p + 1 is congruent to 7 mod 8, so 2 is a quadratic residue mod 2p + 1, and the multiplicative order
Mersenne_prime
Binary search variation with simplified midpoint calculation
permutation used by multiplicative binary search places the optimal number of keys in the first (root) block, regardless of block size. Multiplicative binary search
Multiplicative_binary_search
Mathematical sequence satisfying a specific pattern
In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the
Arithmetico-geometric sequence
Arithmetico-geometric_sequence
Number that is the result of operation on its own digits
2502, 2503, 2504, 2505, 2506, 2507, 2508, 2509, 2592, 2737, 2916, ... (sequence A036057 in the OEIS). Friedman numbers are named after Erich Friedman,
Friedman_number
Number of integers coprime to and less than n
1 ) = 1 {\displaystyle \gcd(1,1)=1} . Euler's totient function is a multiplicative function, meaning that if two numbers m {\displaystyle m} and n {\displaystyle
Euler's_totient_function
Space of bounded sequences
^{\infty }} is a sequence space whose elements are the bounded sequences. The vector space operations, addition and scalar multiplication, are applied coordinate
L-infinity
Special semigroup of positive rational numbers
of the multiplicative semigroup of all positive rational numbers. The elements of a generating set of this semigroup are related to the sequence of numbers
3x_+_1_semigroup
Algorithmic technique
SDPs), and game theory. "Multiplicative weights" implies the iterative rule used in algorithms derived from the multiplicative weight update method. It
Multiplicative weight update method
Multiplicative_weight_update_method
Product of numbers from 1 to n
convention that the empty product, a product of no factors, is equal to the multiplicative identity. There is exactly one permutation of zero objects: with nothing
Factorial
Relationship among tones of the chromatic scale
Circle of fifths text table Pitch constellation Multiplicative group of integers modulo n Multiplication (music) Circle of thirds Music written in all major
Circle_of_fifths
Number in {..., –2, –1, 0, 1, 2, ...}
integer has a multiplicative inverse (as is the case of the number 2), which means that Z {\displaystyle \mathbb {Z} } under multiplication is not a group
Integer
Algebraic structure in linear algebra
viewed as vector addition and its multiplication viewed as scalar multiplication. More generally, all n-tuples (sequences of length n) ( a 1 , a 2 , … ,
Vector_space
Mathematical group that can be generated as the set of powers of a single element
its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This
Cyclic_group
Class of binary number
These numbers give the positions of the zero values in the Thue–Morse sequence, and for this reason they have also been called the Thue–Morse set. Non-negative
Evil_number
Method for producing composition algebras
Furthermore, for any non-zero complex number z, conjugation gives a multiplicative inverse, z − 1 = z ∗ | z | 2 . {\displaystyle z^{-1}={\frac {z^{*}}{|z|^{2}}}
Cayley–Dickson_construction
MULTIPLICATIVE SEQUENCE
MULTIPLICATIVE SEQUENCE
Girl/Female
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Sanskrit, Telugu
Sequence
Surname or Lastname
English
English : from a medieval male personal name (from Latin Hilarius, a derivative of hilaris ‘cheerful’, ‘glad’, from Greek hilaros ‘propitious’, ‘joyful’). The Latin name was chosen by many early Christians to express their joy and hope of salvation, and was borne by several saints, including a 4th-century bishop of Poitiers noted for his vigorous resistance to the Arian heresy, and a 5th-century bishop of Arles. Largely due to veneration of the first of these, the name became popular in France in the forms Hilari and Hilaire, and was brought to England by the Norman conquerors.English : from the much rarer female personal name Eulalie (from Latin Eulalia, from Greek eulalos ‘eloquent’, literally well-speaking, chosen by early Christians as a reference to the gift of tongues), likewise introduced into England by the Normans. A St. Eulalia was crucified at Barcelona in the reign of the Emperor Diocletian and became the patron of that city. In England the name underwent dissimilation of the sequence -l-l- to -l-r- and the unfamiliar initial vowel was also mutilated, so that eventually the name was considered as no more than a feminine form of Hilary (of which the initial aspirate was in any case variable).
Boy/Male
Indian, Sikh
Music; In-sequence
Girl/Female
Tamil
Anuloma | அநà¯à®²à¯‹à®®à®¾
Sequence
Anuloma | அநà¯à®²à¯‹à®®à®¾
Female
Hebrew
(מֵרַב) Variant spelling of Hebrew Merab, MERAV means "increase, multiplication."Â
Boy/Male
Indian, Sanskrit
Order; Sequence
Female
Hebrew
(מֵרַב) Variant spelling of Hebrew Merav, MERAB means "increase, multiplication." In the bible, this is the name of the eldest daughter of King Saul.Â
MULTIPLICATIVE SEQUENCE
MULTIPLICATIVE SEQUENCE
Boy/Male
Biblical American
My light, who diffuses light.
Boy/Male
Greek American English French Latin
Dark.
Boy/Male
Indian, Italian, Latin
First Born
Female
Egyptian
, the consort of Antef III.
Surname or Lastname
English
English : habitational name from a place in Worcestershire, named Bransford, from Old English brægen ‘hill’ + ford ‘hill’.
Boy/Male
British, English
Blessed
Surname or Lastname
English (Yorkshire)
English (Yorkshire) : from a medieval personal name, Spivey.
Boy/Male
Muslim
Boy/Male
Hindu, Indian, Kannada, Malayalam, Marathi, Tamil, Telugu
Lord Krishna; Descedent of Yadu
Boy/Male
Tamil
Life, Spirit, Energy, Might, Another name for braluna and vishnu
MULTIPLICATIVE SEQUENCE
MULTIPLICATIVE SEQUENCE
MULTIPLICATIVE SEQUENCE
MULTIPLICATIVE SEQUENCE
MULTIPLICATIVE SEQUENCE
a.
Consisting of many, or of more than one; multiple; multifold.
n.
The art of increasing gold or silver by magic, -- attributed formerly to the alchemists.
n.
The act or process of populating; multiplication of inhabitants.
n.
An increase above the normal number of parts, especially of petals; augmentation.
a.
Tending to multiply; having the power to multiply, or incease numbers.
n.
Superabundant fecundity or multiplication of the species.
n.
The number or sum obtained by adding one number or quantity to itself as many times as there are units in another number; the number resulting from the multiplication of two or more numbers; as, the product of the multiplication of 7 by 5 is 35. In general, the result of any kind of multiplication. See the Note under Multiplication.
n.
The result of any process inverse to multiplication. See the Note under Multiplication.
a.
Characterized by polysyndeton, or the multiplication of conjunctions.
n.
A disease (morbus pediculous) consisting in the excessive multiplication of lice on the human body.
n.
Formation into, or multiplication of, vacuoles.
adv.
So as to multiply.
n.
The number which is to be multiplied by another number called the multiplier. See Note under Multiplication.
n.
The act or process of multiplying, or of increasing in number; the state of being multiplied; as, the multiplication of the human species by natural generation.
n.
Multiplication or increase by gemmation or budding.
v. t.
To add (any given number or quantity) to itself a certain number of times; to find the product of by multiplication; thus 7 multiplied by 8 produces the number 56; to multiply two numbers. See the Note under Multiplication.
n.
The process of repeating, or adding to itself, any given number or quantity a certain number of times; commonly, the process of ascertaining by a briefer computation the result of such repeated additions; also, the rule by which the operation is performed; -- the reverse of division.
n.
The number by which another number is multiplied. See the Note under Multiplication.
n.
The chain of micrococci formed by the division of the micrococci in multiplication.