AI & ChatGPT searches , social queriess for MULTIPLE SUBSET-SUM
Search references for MULTIPLE SUBSET-SUM. Phrases containing MULTIPLE SUBSET-SUM
See searches and references containing MULTIPLE SUBSET-SUM!
Search references for MULTIPLE SUBSET-SUM. Phrases containing MULTIPLE SUBSET-SUM
See searches and references containing MULTIPLE SUBSET-SUM!MULTIPLE SUBSET-SUM
Mathematical optimization problem
The multiple subset sum problem is an optimization problem in computer science and operations research. It is a generalization of the subset sum problem
Multiple_subset_sum
Decision problem in computer science
The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset S {\displaystyle S} of integers
Subset_sum_problem
each class, we get the multiple-choice knapsack problem: If for each item the profit and weight are equal, we get the subset sum problem (often the corresponding
List_of_knapsack_problems
Mathematical problem
says that any multiset of 2n − 1 integers has a subset of size n the sum of whose elements is a multiple of n, but that the same is not true of multisets
Zero-sum_problem
Problem in combinatorial optimization
knapsack problem is often used to refer specifically to the subset sum problem. The subset sum problem is one of Karp's 21 NP-complete problems. Knapsack
Knapsack_problem
Use of multiple antennas in radio
Multiple-input and multiple-output (MIMO) (/ˈmaɪmoʊ, ˈmiːmoʊ/) is a wireless technology that multiplies the capacity of a radio link using multiple transmit
MIMO
Infinite sum
finite subset A 0 {\displaystyle A_{0}} of I {\displaystyle I} such that S − ∑ i ∈ A a i ∈ V for every finite superset A ⊇ A 0 . {\displaystyle S-\sum _{i\in
Series_(mathematics)
Number of subsets of a given size
interpretation: the left side sums the number of subsets of {1, ..., n} of sizes k = 0, 1, ..., n, giving the total number of subsets. (That is, the left side
Binomial_coefficient
Set of statistical processes for estimating the relationships among variables
least squares computes the unique line (or hyperplane) that minimizes the sum of squared differences between the true data and that line (or hyperplane)
Regression_analysis
Infinite series that is not convergent
{\displaystyle 1+{\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{4}}+{\frac {1}{5}}+\cdots =\sum _{n=1}^{\infty }{\frac {1}{n}}.} The divergence of the harmonic series was
Divergent_series
Statistical measure of how far values spread from their average
variance of Y. The expression above can be extended to a weighted sum of multiple variables: Var ( ∑ i n a i X i ) = ∑ i = 1 n a i 2 Var ( X i )
Variance
partitioning a multiset of numbers into a fixed number of subsets, such that the sums of the subsets are as similar as possible. It was first presented by
Multiway_number_partitioning
Mathematical set of all subsets of a set
mathematics, the power set (or powerset) of a set S is the set of all subsets of S, including the empty set and S itself. In axiomatic set theory (as
Power_set
for the two-dimensional knapsack problem. The same is true for the multiple subset sum problem: the quasi-dominance relation should be: s quasi-dominates
Fully polynomial-time approximation scheme
Fully_polynomial-time_approximation_scheme
Barcode format
widths. All widths are multiples of a basic "module". Each bar and space is 1 to 4 modules wide, and the symbols are fixed width: the sum of the widths of the
Code_128
Divergent sum of positive unit fractions
infinite series formed by summing all positive unit fractions: ∑ n = 1 ∞ 1 n = 1 + 1 2 + 1 3 + 1 4 + 1 5 + ⋯ . {\displaystyle \sum _{n=1}^{\infty }{\frac
Harmonic_series_(mathematics)
Statistical interpretation with many tests
simultaneously considers a set of statistical inferences or estimates a subset of selected parameters based on observed values. The probability of false
Multiple_comparisons_problem
different definitions are common. 1. A ⊂ B {\displaystyle A\subset B} may mean that A is a subset of B, and is possibly equal to B; that is, every element
Glossary of mathematical symbols
Glossary_of_mathematical_symbols
Clustering and community detection algorithm
return newly refined partition. */ function refine_partition_subset(Graph G, Partition P, Subset S) R = {v | v ∈ S, E(v, S − v) ≥ γ * degree(v) * (degree(S)
Leiden_algorithm
Number that is abundant but not semiperfect
the sum of the proper divisors (divisors including 1 but not itself) of the number is greater than the number, but no subset of those divisors sums to
Weird_number
Statistical method
estimator. These include its relationship to ridge regression and best subset selection and the connections between lasso coefficient estimates and so-called
Lasso_(statistics)
Type of vector space in math
{\displaystyle \sum _{b\in B}\left|x(b)\right|^{2}=\sup \sum _{n=1}^{N}\left|x(b_{n})\right|^{2}} the supremum being taken over all finite subsets of B. It follows
Hilbert_space
Vector space with a notion of nearness
in X . {\displaystyle X.} The sum of a compact set and a closed set is closed. However, the sum of two closed subsets may fail to be closed (see this
Topological_vector_space
Number in {..., –2, –1, 0, 1, 2, ...}
N {\displaystyle \mathbb {N} } is a subset of Z {\displaystyle \mathbb {Z} } , which in turn is a subset of the set of all rational numbers Q
Integer
Subset of a group that forms a group itself
\mathbb {Z} ,} because 2 and 3 are elements of this subset whose sum, 5, is not in the subset. Similarly, the union of the x-axis and the y-axis in
Subgroup
Generalization of mass, length, area and volume
{\displaystyle \Sigma } a σ-algebra over X {\displaystyle X} , defining subsets of X {\displaystyle X} that are "measurable". A set function μ {\displaystyle
Measure_(mathematics)
Natural number
A005835 (Pseudoperfect (or semiperfect) numbers n: some subset of the proper divisors of n sums to n.)". The On-Line Encyclopedia of Integer Sequences
78_(number)
Set of the values of a function
More generally, evaluating f {\displaystyle f} at each element of a given subset A {\displaystyle A} of its domain X {\displaystyle X} produces a set, called
Image_(mathematics)
Construct related to weighted sums and averages
a finite subset of A, one can replace the unweighted cardinality |B| of B by the weighted cardinality ∑ a ∈ B w ( a ) . {\displaystyle \sum _{a\in B}w(a)
Weight_function
Mathematical function for the probability a given outcome occurs in an experiment
distribution is a mathematical description of the probabilities of events, i.e. subsets of the sample space. The sample space, often represented in notation by
Probability_distribution
Every graph has evenly many odd vertices
two subsets, with each edge having one endpoint in each subset. It follows from the same double counting argument that, in each subset, the sum of degrees
Handshaking_lemma
Greatest lower bound and least upper bound
In mathematics, the infimum (abbreviated inf; pl.: infima) of a subset S {\displaystyle S} of a partially ordered set P {\displaystyle P} is the greatest
Infimum_and_supremum
Theorem in calculus
surface. Φ ( V ) = ∑ V i ⊂ V Φ ( V i ) {\displaystyle \Phi (V)=\sum _{V_{\text{i}}\subset V}\Phi (V_{\text{i}})} The flux Φ out of each volume is the surface
Divergence_theorem
Multivariate functions can be written using univariate functions and summing
{\displaystyle f(x,y)=\sum _{i=1}^{5}g(\phi _{i}(x)+t\phi _{i}(y))} Since C [ I 2 ] {\textstyle C[I^{2}]} has a countable dense subset, we can apply the Baire
Kolmogorov–Arnold representation theorem
Kolmogorov–Arnold_representation_theorem
Result in combinatorics and graph theory
Hall's marriage condition. The implication holds because, for each subset W of X, the sum of weights near vertices of W is |W|, so the edges adjacent to them
Hall's_marriage_theorem
Concept in combinatorics (part of mathematics)
{\displaystyle \sum _{i=1}^{m}k_{i}=n} . The coefficient above counts the number of flags V 1 ⊂ ⋯ ⊂ V m {\displaystyle V_{1}\subset \dots \subset V_{m}} of
Q-Pochhammer_symbol
Set of all possible outcomes or results of a statistical trial or experiment
They can also be finite, countably infinite, or uncountably infinite. A subset of the sample space is an event, denoted by E {\displaystyle E} . If the
Sample_space
Mathematical models of strategic interactions
science and computer science. Initially, game theory addressed two-person zero-sum games, in which a participant's gains or losses are exactly balanced by the
Game_theory
Probability of making type I errors when performing multiple hypotheses tests
significance of any subset R {\textstyle {\mathcal {R}}} of the m {\textstyle m} tests is assessed by calculating the HMP for the subset, p ∘ R = ∑ i ∈ R
Family-wise_error_rate
Process in machine learning and statistics
In machine learning, feature selection is the process of selecting a subset of relevant features (variables, predictors) for use in model construction
Feature_selection
Type of supervised learning in machine learning
x ∈ B w ( x ) {\displaystyle w_{B}=\sum _{x\in B}w(x)} . There are two major flavors of algorithms for Multiple Instance Learning: instance-based and
Multiple_instance_learning
Mathematical set with an ordering
subset of powers of 2, which does not have any upper bound. If the number 0 is included, this will be the greatest element, since this is a multiple of
Partially_ordered_set
Smallest convex set containing a given set
containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane
Convex_hull
Equality of areas of a sliced disk
Then the pizza theorem states (Upton 1968): The sum of the areas of the odd-numbered sectors equals the sum of the areas of the even-numbered sectors. The
Pizza_theorem
Mode of convergence of an infinite series
all finite subsets of A {\displaystyle A} directed by inclusion ⊆ {\displaystyle \subseteq } and x H := ∑ i ∈ H x i {\textstyle x_{H}:=\sum _{i\in H}x_{i}}
Absolute_convergence
Feature of some programming languages
assert(a.rows == b.rows); double[] sum; sum.length = a.elems.length; sum[] = a.elems[] + b.elems[]; return new DiagonalMatrix(sum); } In a language with only
Multiple_dispatch
Finite sum of distinct unit fractions
are partitioned into finitely many subsets, then one of the subsets has a finite subset of itself whose reciprocals sum to one. That is, for every r > 0
Egyptian_fraction
Formulation of quantum mechanics
{\sum _{F\subset A\cap B}\left|\int {\mathcal {D}}\varphi O_{\text{in}}[\varphi ]e^{i{\mathcal {S}}[\varphi ]}F[\varphi ]\right|^{2}}{\sum _{F\subset A}\left|\int
Path_integral_formulation
Machine learning algorithm
_{G}(p)=\sum _{i=1}^{J}\left(p_{i}\sum _{k\neq i}p_{k}\right)=\sum _{i=1}^{J}p_{i}(1-p_{i})=\sum _{i=1}^{J}(p_{i}-p_{i}^{2})=\sum _{i=1}^{J}p_{i}-\sum
Decision_tree_learning
Inequality between integrals in Lp spaces
or C n . {\displaystyle \sum _{k=1}^{n}|x_{k}\,y_{k}|\leq \left(\sum _{k=1}^{n}|x_{k}|^{p}\right)^{\frac {1}{p}}\left(\sum _{k=1}^{n}|y_{k}|^{q}\right)^{\frac
Hölder's_inequality
Statistical modeling method
no linear relationship with the response at all, or to identify which subsets of explanatory variables may contain redundant information about the response
Linear_regression
Which means that the output Y {\displaystyle Y} can be described by a small subset of input variables. More generally, assume a dictionary ϕ j : X → R {\displaystyle
Structured sparsity regularization
Structured_sparsity_regularization
Theorem in functional analysis
j ∈ T a i j | . {\displaystyle \|A\|_{\square }=\max _{S\subset [m],T\subset [n]}\left|\sum _{i\in S,j\in T}a_{ij}\right|.} The notion of cut norm is
Grothendieck_inequality
Unconditionally convergent series converge absolutely
{\displaystyle I\subset I'} then S ( a , I ) ⊂ S ( a , I ′ ) {\displaystyle S(a,I)\subset S(a,I')} . If the series is an absolutely convergent sum, then S (
Riemann_series_theorem
Theory for how the brain handles memory recall
\right\|={\sqrt {\sum _{j=1}^{L}(p(j)-m_{i}(j))^{2}}}} . Due to the stochastic nature of context, it is almost never the case in multiple trace theory that
Multiple_trace_theory
Type of average of a collection of numbers
arr-ith-MET-ik), arithmetic average, or just the mean or average is the sum of a collection of numbers divided by the count of numbers in the collection
Arithmetic_mean
Ideal that maps to zero a subset of a module
In mathematics, the annihilator of a subset S of a module over a ring is the ideal formed by the elements of the ring that always give zero when multiplied
Annihilator_(ring_theory)
Submodule of a mathematical ring
ring is a special subset of its elements. Ideals generalize certain subsets of the integers, such as the even numbers or the multiples of 3. Addition and
Ideal_(ring_theory)
Programming language for statistics
operator: > mtcars_subset_rows <- subset(mtcars, cyl == 4) > num_mtcars_subset <- nrow(mtcars_subset_rows) > print(num_mtcars_subset) [1] 11 While the
R_(programming_language)
On Hamiltonian cycles in planar graphs
the sum is not a multiple of three, and in particular is not zero. Since there is no way of partitioning the faces into two subsets that produce a sum obeying
Grinberg's_theorem
Numbers obtained by adding the two previous ones
number of subsets S of {1, ..., n} without consecutive integers, that is, those S for which {i, i + 1} ⊈ S for every i. A bijection with the sums to n+1
Fibonacci_sequence
Numbers parameterizing ways to partition a set
is the number of ways to partition a set of n objects into k non-empty subsets and is denoted by S ( n , k ) {\displaystyle S(n,k)} or { n k } {\displaystyle
Stirling numbers of the second kind
Stirling_numbers_of_the_second_kind
Machine learning technique
Cossock, David and Zhang, Tong (2008). Statistical Analysis of Bayes Optimal Subset Ranking Archived 2010-08-07 at the Wayback Machine, page 14. Yandex corporate
Gradient_boosting
In algebra, integer associated to a module
v n ) = V {\displaystyle 0\subset {\text{Span}}_{k}(v_{1})\subset {\text{Span}}_{k}(v_{1},v_{2})\subset \cdots \subset {\text{Span}}_{k}(v_{1},\ldots
Length_of_a_module
Data mining technique
indicator of the similarity between two sets. Let U be a set and A and B be subsets of U, then the Jaccard index is defined to be the ratio of the number of
MinHash
Two-dimensional manifold
in which every point has an open neighbourhood homeomorphic to some open subset of the Euclidean plane E2. Such a neighborhood, together with the corresponding
Surface_(topology)
Average uncertainty in variable's states
{\displaystyle \mathrm {H} (X):=-\sum _{x\in {\mathcal {X}}}p(x)\log p(x),} where Σ {\displaystyle \Sigma } denotes the sum over the variable's possible values
Entropy_(information_theory)
Differential operator in mathematics
\Delta } . In a Cartesian coordinate system, the Laplacian is given by the sum of second partial derivatives of the function with respect to each independent
Laplace_operator
Statistical model validation technique
complementary subsets, performing the analysis on one subset (called the training set), and validating the analysis on the other subset (called the validation
Cross-validation_(statistics)
Type of statistical measure over subsets of a dataset
numbers and a fixed subset size, the first element of the moving average is obtained by taking the average of the initial fixed subset of the number series
Moving_average
Inverse of a finite difference
calculus of finite differences, the indefinite sum (or antidifference operator), denoted by ∑ x {\textstyle \sum _{x}} or Δ − 1 {\displaystyle \Delta ^{-1}}
Indefinite_sum
Shape with three sides
three internal angles, each one bounded by a pair of adjacent edges; the sum of angles of a triangle always equals a straight angle (180 degrees or π
Triangle
Type of numeric sequence
^{d}} , called the initial vector and common difference respectively. A subset of N d {\displaystyle \mathbb {N} ^{d}} is said to be linear if it is of
Generalized arithmetic progression
Generalized_arithmetic_progression
Calculus of vector-valued functions
the machinery of differential geometry, of which vector calculus forms a subset. Grad and div generalize immediately to other dimensions, as do the gradient
Vector_calculus
Matrix of inner products of vectors
⊂ R 3 {\displaystyle \phi :U\to S\subset \mathbb {R} ^{3}} for ( x , y ) ∈ U ⊂ R 2 {\displaystyle (x,y)\in U\subset \mathbb {R} ^{2}} : ∫ S f d A =
Gram_matrix
Test used in the analysis of stratified or matched categorical data
the statistic and decide policy based upon it. Define a statistic to be subset stable iff R {\displaystyle R} is bounded between min ( r i ) {\displaystyle
Cochran–Mantel–Haenszel statistics
Cochran–Mantel–Haenszel_statistics
Algebraic structure with an associative operation and an identity element
a i , {\displaystyle \sum _{I}a_{i}=\sup _{{\text{finite }}E\subset I}\;\sum _{E}a_{i},} and M together with this infinitary sum operation is a complete
Monoid
Alignment of more than two molecular sequences
weight based on a certain heuristic that helps to score each alignment or subset of the original graph. When determining the best suited alignments for each
Multiple_sequence_alignment
Machine learning algorithm
abess (Adaptive Best Subset Selection, also ABESS) is a machine learning method designed to address the problem of best subset selection. It aims to determine
Abess
Method of mathematical integration
The cumulative count is found by summing, over all subsets of the domain, the product of the measure on that subset (total time in days) and the bar height
Lebesgue_integral
Mathematical proposition equivalent to the axiom of choice
nonempty subset of R, For every x, y ∈ I, the sum x + y is in I, For every r ∈ R and every x ∈ I, the product rx is in I. #1 - I is a nonempty subset of R
Zorn's_lemma
Degree of differentiability of a function or map
differentiability: a complex function that is complex differentiable on an open subset of C {\displaystyle \mathbb {C} } is holomorphic and hence analytic on that
Smoothness
Theorem in complex analysis
following: Denoting by C the set of complex numbers, let K be a closed subset of C ∪ { ∞ } {\displaystyle \mathbb {C} \cup \{\infty \}} and let f be a
Runge's_theorem
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
Set which cannot be assigned a meaningful "volume"
Zermelo–Fraenkel set theory, the axiom of choice entails that non-measurable subsets of R {\displaystyle \mathbb {R} } exist. The notion of a non-measurable
Non-measurable_set
Theory discussing interactions between inequalities
instead be predicted as the sum of the effects each of these aspects has on the way they are treated. By contrast, King's multiple jeopardy overturned the
Multiple_jeopardy
NP-hard problem in combinatorial optimization
proper subset Q can form a sub-tour, so the solution returned is a single tour and not the union of smaller tours. Intuitively, for each proper subset Q of
Travelling_salesman_problem
Algebraic expansion of powers of a binomial
{\displaystyle {\tbinom {n}{k}}} gives the number of different combinations (i.e. subsets) of k {\displaystyle k} elements that can be chosen from an n {\displaystyle
Binomial_theorem
Operations research that evaluates multiple conflicting criteria in decision making
; Koksalan, M. (2009). "Generating a Representative Subset of the Efficient Frontier in Multiple Criteria Decision Making". Operations Research. 57: 187–199
Multiple-criteria decision analysis
Multiple-criteria_decision_analysis
Unique numeric book identifier since 1970
the sum of all the thirteen digits, each multiplied by its (integer) weight, alternating between 1 and 3, is a multiple of 10. As ISBN-13 is a subset of
ISBN
Selection of items from a set
or a pear and an orange. More formally, a k-combination of a set S is a subset of k distinct elements of S. So, two combinations are identical if and only
Combination
Ideal in a ring which has properties similar to prime elements
In algebra, a prime ideal is a subset of a ring that shares many important properties of a prime number in the ring of integers. The prime ideals for the
Prime_ideal
Least-weight tree connecting graph vertices
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all
Minimum_spanning_tree
Expected value of a random variable given that certain conditions are known to occur
number of values, the "conditions" are that the variable can only take on a subset of those values. More formally, in the case when the random variable is
Conditional_expectation
Mathematical set with repetitions allowed
a} in the multiset. The support, root, or carrier of a multiset is the subset of U {\displaystyle U} formed by the elements a ∈ U {\displaystyle
Multiset
Associative algebra used in combinatorics
}}\end{array}}\right.} where the sum is over all chains S = T 0 ⊂ T 1 ⊂ ⋯ ⊂ T n = T , {\displaystyle S=T_{0}\subset T_{1}\subset \cdots \subset T_{n}=T,} and the only
Incidence_algebra
Combinatorial and geometric result used in measure theory of Euclidean spaces
that it is possible to cover, up to a Lebesgue-negligible set, a given subset E of Rd by a disjoint family extracted from a Vitali covering of E. There
Vitali_covering_lemma
Conditions for switching order of integration in calculus
{\displaystyle \sum _{(m,n)\in \mathbb {N} \times \mathbb {N} }a_{m,n}=\sum _{m=1}^{\infty }\sum _{n=1}^{\infty }a_{m,n}=\sum _{n=1}^{\infty }\sum _{m=1}^{\infty
Fubini's_theorem
Statistical procedure
simultaneously or infers a subset of parameters selected based on the observed values. The major issue in any discussion of multiple-comparison procedures
Dunnett's_test
Book by Marvin Minsky and Seymour Papert
{\displaystyle 0<\sum _{g\in G}\sum _{j}b_{j}(\psi _{j}\circ g)(A)=\sum _{g\in G}\sum _{j}b_{g^{-1}(j)}\psi _{j}(A)=\sum _{j}\left(\sum _{g\in G}b_{g^{-1}(j)}\right)\psi
Perceptrons_(book)
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Female
English
 Pet form of English Susannah, SUSE means "lily." Compare with another form of Suse.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : variant of Skelton.
Boy/Male
Bengali, Christian, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Telugu
A Good Friend
Boy/Male
Australian, Vietnamese
Many; Multiple
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : probably a variant of Pullen.
Boy/Male
Hindu, Indian
Un Countable; Multiple; Countless
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Female
German
 Pet form of German Susanne, SUSE means "lily." Compare with another form of Suse.
Surname or Lastname
English
English : regional name for someone from the county of Sussex, named ‘(territory of) the South Saxons’, from Old English sūth + Seaxe.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Boy/Male
Hindu, Indian, Tamil
Multiple
Boy/Male
Hebrew
God shall multiply.
Boy/Male
Muslim
Multiple lights. Luster.
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
Girl/Female
Spanish
The laurel tree or sweet bay tree symbolic of honor and victory.
Boy/Male
Hindu, Indian, Telugu
Son of Priyavrata
Biblical
peace; tied; chained; perfection; retribution
Girl/Female
Indian, Telugu
Having Fame
Boy/Male
Anglo, British, English, German
Noble
Boy/Male
Arabic
King; Fire; Lion; Leader
Surname or Lastname
German
German : from a Germanic personal name formed with an element reflected in Gothic hrotheigs ‘victorious’ (which in Old High German merges with rÅt ‘red’).English : variant spelling of Grubb.
Boy/Male
Australian, Portuguese
Priceless; Flourishing; Flower
Boy/Male
American, Australian, British, Christian, Danish, English, French, German, Hebrew, Swedish
Blessed; Right-hand Son; Similar to Benedict; Happy
Boy/Male
British, English
Place Name; The Brook
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
imp. & p. p.
of Sublet
a.
Having many flues; as, a multiflue boiler. See Boiler.
n.
The number which is to be multiplied by another number called the multiplier. See Note under Multiplication.
v. i.
To become upset.
n.
An apple, or a pear, of a russet color; as, the English russet, and the Roxbury russet.
n.
The number by which another number is multiplied; a multiplier.
n.
The number by which another number is multiplied. See the Note under Multiplication.
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.
A quantity containing another quantity a number of times without a remainder.
imp. & p. p.
of Multiply
v. t.
To subjoin; to subnect.
v. t.
To submit; to make accountable.
n.
A russet color; a pigment of a russet color.
a.
Manifold; multiple.
n.
One who, or that which, multiplies or increases number.
n.
Anything resembling a gusset in a garment
a.
Tending to multiply; having the power to multiply, or incease numbers.
p. pr. & vb. n.
of Multiply
a.
Exposed; liable; prone; disposed; as, a country subject to extreme heat; men subject to temptation.
n.
Cloth or clothing of a russet color.