AI & ChatGPT searches , social queries 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
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
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
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
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
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
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
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
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
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
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)
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
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
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
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
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
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
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
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
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
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
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
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)
Divergent sum of positive unit fractions
infinite series formed by summing all positive unit fractions: ∑ i = 1 ∞ 1 i = 1 + 1 2 + 1 3 + 1 4 + 1 5 + ⋯ . {\displaystyle \sum _{i=1}^{\infty }{\frac
Harmonic_series_(mathematics)
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
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
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
Feature of some programming languages
Multiple dispatch or multimethods is a feature of some programming languages in which a function or method can be dynamically dispatched based on the run-time
Multiple_dispatch
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
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)
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
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
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
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
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)
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
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
Set of the values of a function
input x {\displaystyle x} . The image by f {\displaystyle f} of a subset S {\displaystyle S} of the domain of f {\displaystyle f} is the
Image_(mathematics)
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)
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
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
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
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
Degree of differentiability of a function or map
functions defined on open subsets of Euclidean space. For functions on closed intervals, closures of open sets, or more general subsets, the same notation is
Smoothness
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
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
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
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)
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
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 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
On subsets of the integers in which no member of the set is a multiple of any other
Behrend's theorem states that the subsets of the integers from 1 to n {\displaystyle n} in which no member of the set is a multiple of any other must have a logarithmic
Behrend's_theorem
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
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
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
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
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
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
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
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
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
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
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)
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
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
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
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
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
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
Method in probability theory
2 , … , n } {\displaystyle A\subset \{1,2,\dots ,n\}} define now the sum X A := ∑ j ∈ A X j {\displaystyle X_{A}:=\sum _{j\in A}X_{j}} . Using Taylor
Stein's_method
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
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
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
Method in combinatorics
2^{\alpha (H)}\leq i(H)\leq \sum _{r=0}^{\alpha (H)}{|V(H)| \choose r},} where the lower bound follows by taking all subsets of a maximum independent set
Container_method
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)
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
repeated on each derived subset in a recursive manner called recursive partitioning. The recursion is completed when the subset at a node has all the same
Decision_tree_learning
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
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
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
Type of numeric sequence
arithmetic progression (or multiple arithmetic progression) is a generalization of an arithmetic progression equipped with multiple common differences – whereas
Generalized arithmetic progression
Generalized_arithmetic_progression
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
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)
Type of function in mathematics
the domain is understood. A function f {\displaystyle f} defined on some subset of the real line is said to be real analytic at a point x {\displaystyle
Analytic_function
Geometric arrangements of points, foundational to Lie theory
coordinates are equal, E7 is then the subset of E8 where the first two coordinates are equal, and similarly E6 is the subset of E8 where the first three coordinates
Root_system
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
In mathematics, vector subspace
algebra, a linear subspace or vector subspace is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called
Linear_subspace
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
Recurrence relations of binomial coefficients in Pascal's triangle
{n'+1}{r+1}}=\sum _{i=0}^{n}{\binom {n'-i}{r}}=\sum _{i=r}^{n'}{\binom {i}{r}}.} Count the ( k + 1 ) {\displaystyle (k+1)} -element subsets of the set {
Hockey-stick_identity
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
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
Statistical method for multiple testing
{R}}={\frac {\sum _{i\in {\mathcal {R}}}w_{i}}{\sum _{i\in {\mathcal {R}}}w_{i}/p_{i}}}.} Reject the null hypothesis that none of the p-values in subset R {\textstyle
Harmonic_mean_p-value
1171 = super-prime[citation needed] 1172 = number of subsets of first 14 integers that have a sum divisible by 14 1173 = number of simple triangulation
1000_(number)
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
Design method of discrete wavelet transforms
{\displaystyle \{0\}\subset \dots \subset V_{1}\subset V_{0}\subset V_{-1}\subset \dots \subset V_{-n}\subset V_{-(n+1)}\subset \dots \subset L^{2}(\mathbb {R}
Multiresolution_analysis
Type of function in database management
by computing the aggregate for subsets, and then aggregating these aggregates; examples include COUNT, MAX, MIN, and SUM. In other cases the aggregate
Aggregate_function
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
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
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
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
Boy/Male
Bengali, Christian, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Telugu
A Good Friend
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) : variant of Skelton.
Boy/Male
Muslim
Multiple lights. Luster.
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 (Sussex)
English (Sussex) : unexplained.
Surname or Lastname
English (Sussex)
English (Sussex) : probably a variant of Pullen.
Boy/Male
Australian, Vietnamese
Many; Multiple
Boy/Male
Hindu, Indian
Un Countable; Multiple; Countless
Boy/Male
Hebrew
God shall multiply.
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
Girl/Female
Hindu, Indian
Cotton
Boy/Male
Danish, Dutch, French, German, Latin
To Rise Again; Small and Mighty; Small but Strong
Boy/Male
Tamil
Utkrishta | உதà¯à®•à¯à®°à®¿à®·à¯à®Ÿà®¾
Best
Girl/Female
Irish
meaning pure.
Boy/Male
Muslim
Stream, Motion, Night, God of death
Girl/Female
Celtic American Gaelic Irish Scottish
Sorrowful.
Boy/Male
Hindu, Indian, Kannada, Mythological, Sanskrit
Name of an Ancient King in Indian Epic Called Mahabhatat; Son of Shantanu and Ganga
Female
English
French from of Latin Oriana, possibly ORIANE means "golden."
Boy/Male
Tamil
Plenty
Surname or Lastname
English (Sussex)
English (Sussex) : unexplained.
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
MULTIPLE SUBSET-SUM
v. t.
To submit; to make accountable.
n.
A quantity containing another quantity a number of times without a remainder.
v. t.
To subjoin; to subnect.
imp. & p. p.
of Multiply
a.
Tending to multiply; having the power to multiply, or incease numbers.
a.
Manifold; multiple.
n.
A russet color; a pigment of a russet color.
v. i.
To become upset.
a.
Exposed; liable; prone; disposed; as, a country subject to extreme heat; men subject to temptation.
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.
p. pr. & vb. n.
of Multiply
n.
Anything resembling a gusset in a garment
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 number by which another number is multiplied. See the Note under Multiplication.
imp. & p. p.
of Sublet
n.
Cloth or clothing of a russet color.
n.
The number which is to be multiplied by another number called the multiplier. See Note under Multiplication.
n.
One who, or that which, multiplies or increases number.
a.
Having many flues; as, a multiflue boiler. See Boiler.