Adjective:

સમાન, સમાવેશ થાય છે, સાથે, સમકક્ષ, સમકક્ષ શક્તિ, એ જ,

equivalently's Usage Examples:

a channel or frequency channel is a designated radio frequency (or, equivalently, wavelength), assigned by a competent frequency assignment authority.

Neglecting to do so would enrage the insect, if the owner does not equivalently repay the insect by placing all his or her riches beside a road, plus interest.

to which the matrix has the required form exists if and only if all eigenvalues of the matrix lie in K, or equivalently if the characteristic polynomial.

more standard deviations away from the mean (or equivalently, over 1 − 1/k2 of the distribution"s values are less than k standard deviations away from the.

element a of a ring R is called a left zero divisor if there exists a nonzero x in R such that ax 0, or equivalently if the map from R to R that sends.

Fractional linear transformationsThe P-function possesses a simple symmetry under the action of fractional linear transformations known as Möbius transformations (that are the conformal remappings of the Riemann sphere), or equivalently, under the action of the group .

The microcosm-macrocosm analogy (or, equivalently, macrocosm-microcosm analogy) refers to a historical view which posited a structural similarity between.

radiant energy received by a surface per unit area, or equivalently the irradiance of a surface, integrated over time of irradiation, and spectral exposure.

A googolplex is the number 10googol, or equivalently, 10(10100).

Definitions Regular open and regular closed sets A subset S of a topological space X is called a if \operatorname{Int} \left( \overline{S} \right) S or equivalently, if \operatorname{Bd} \left( \overline{S} \right) \operatorname{Bd} S, where \operatorname{Bd} S (resp.

and thus, equivalently, is inversely proportional to the wavelength.

So far, over the index set I, we have:- \sum_{i \in I} p_i \ln \frac{q_i}{p_i} \geq 0 ,or equivalently- \sum_{i \in I} p_i \ln q_i \geq - \sum_{i \in I} p_i \ln p_i .

forest is an undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or equivalently.