If the first allele is dominant to the second, then the fraction of the population that will show the dominant phenotype is p < sup > 2 </ sup > + 2pq, and the fraction with the recessive phenotype is q < sup > 2 </ sup >.

If T is a ( p, q )- tensor ( p for the contravariant vector and q for the covariant one ), then we define the divergence of T to be the ( p, q − 1 )- tensor

*( EF1 ) If a and b are in R and b is nonzero, then there are q and r in R such that and either r = 0 or.

This can be done for all m of the p < sub > i </ sub >, showing that m ≤ n. If there were any q < sub > j </ sub > left over we would have

* If q is a prime power, and if F

If X is a positive random variable and q > 0 then for all ε > 0

If we compress data in a manner that assumes q ( X ) is the distribution underlying some data, when, in reality, p ( X ) is the correct distribution, the Kullback – Leibler divergence is the number of average additional bits per datum necessary for compression.

If Alice knows the true distribution p ( x ), while Bob believes ( has a prior ) that the distribution is q ( x ), then Bob will be more surprised than Alice, on average, upon seeing the value of X.

If a particle of charge q moves with velocity v in the presence of an electric field E and a magnetic field B, then it will experience a force

# If p is an odd prime, then any prime q that divides 2 < sup > p </ sup > − 1 must be 1 plus a multiple of 2p.

#* Proof: If q divides 2 < sup > p </ sup > − 1 then 2 < sup > p </ sup > ≡ 1 ( mod q ).

# If p is an odd prime, then any prime q that divides must be congruent to ± 1 ( mod 8 ).

If R is an integral domain and f and g are polynomials in R, it is said that f divides g or f is a divisor of g if there exists a polynomial q in R such that f q = g. One can show that every zero gives rise to a linear divisor, or more formally, if f is a polynomial in R and r is an element of R such that f ( r ) = 0, then the polynomial ( X − r ) divides f. The converse is also true.

If F is a field and f and g are polynomials in F with g ≠ 0, then there exist unique polynomials q and r in F with

If we shift the constant term to the right hand side, factor a p and multiply by q < sup > n </ sup >, we get

If we instead shift the leading term to the right hand side and multiply by q < sup > n </ sup >, we get

Sherlock Holmes's straightforward practical principles are generally of the form, " If p, then q ," where " p " stands for some observed evidence and " q " stands for what the evidence indicates.

A proposition such as " If p and q, then p ." is considered to be logical truth because it is true because of the meaning of the symbols and words in it and not because of any facts of any particular world.

If q is the product of that curvature with the circle's radius, signed positive for epi-and negative for hypo -, then the curve: evolute similitude ratio is 1 + 2q.

If H is a subgroup of G, the set of left or right cosets G / H is a topological space when given the quotient topology ( the finest topology on G / H which makes the natural projection q: G → G / H continuous ).

* If S and T are in M with S ⊆ T then T − S is in M and a ( T − S ) =

* Every rectangle R is in M. If the rectangle has length h and breadth k then a ( R ) =

If a is algebraic over K, then K, the set of all polynomials in a with coefficients in K, is not only a ring but a field: an algebraic extension of K which has finite degree over K. In the special case where K = Q is the field of rational numbers, Q is an example of an algebraic number field.

If the object point O is infinitely distant, u1 and u2 are to be replaced by h1 and h2, the perpendicular heights of incidence ; the sine condition then becomes sin u ' 1 / h1 = sin u ' 2 / h2.

If the ratio a '/ a be sufficiently constant, as is often the case, the above relation reduces to the condition of Airy, i. e. tan w '/ tan w = a constant.

If F is an antiderivative of f, and the function f is defined on some interval, then every other antiderivative G of f differs from F by a constant: there exists a number C such that G ( x ) = F ( x ) + C for all x.

If we define the function f ( n ) = A ( n, n ), which increases both m and n at the same time, we have a function of one variable that dwarfs every primitive recursive function, including very fast-growing functions such as the exponential function, the factorial function, multi-and superfactorial functions, and even functions defined using Knuth's up-arrow notation ( except when the indexed up-arrow is used ).

Let ( m, n ) be a pair of amicable numbers with m < n, and write m = gM and n = gN where g is the greatest common divisor of m and n. If M and N are both coprime to g and square free then the pair ( m, n ) is said to be regular, otherwise it is called irregular or exotic.

* If the operation is associative, ( ab ) c = a ( bc ), then the value depends only on the tuple ( a, b, c ).

* If the operation is commutative, ab = ba, then the value depends only on

If X is a Banach space and K is the underlying field ( either the real or the complex numbers ), then K is itself a Banach space ( using the absolute value as norm ) and we can define the continuous dual space as X ′ = B ( X, K ), the space of continuous linear maps into K.

* If G is a locally compact Hausdorff topological group and μ its Haar measure, then the Banach space L < sup > 1 </ sup >( G ) of all μ-integrable functions on G becomes a Banach algebra under the convolution xy ( g ) = ∫ x ( h ) y ( h < sup >− 1 </ sup > g ) dμ ( h ) for x, y in L < sup > 1 </ sup >( G ).

If the sets A and B are equal, this is denoted symbolically as A = B ( as usual ).

If a problem can be shown to be in both NP and co-NP, that is generally accepted as strong evidence that the problem is probably not NP-complete ( since otherwise NP = co-NP ).

If the user pressed keys 1 + 2 = 3 simultaneously the letter " c " appeared.

If the ideals A and B of R are coprime, then AB = A ∩ B ; furthermore, if C is a third ideal such that A contains BC, then A contains C. The Chinese remainder theorem is an important statement about coprime ideals.

If κ is an infinite cardinal number, then cf ( κ ) is the least cardinal such that there is an unbounded function from it to κ ; and cf ( κ ) = the cardinality of the smallest collection of sets of strictly smaller cardinals such that their sum is κ ; more precisely

If the disk was not otherwise prepared with a custom format, ( e. g. for data disks ), 664 blocks would be free after formatting, giving 664 × 254 = 168, 656 bytes ( or almost 165 kB ) for user data.

This is a Cauchy sequence of rational numbers, but it does not converge towards any rational limit: If the sequence did have a limit x, then necessarily x < sup > 2 </ sup > = 2, yet no rational number has this property.

If y = f ( x ) is differentiable at a, then f must also be continuous at a.

If a vector field F with zero divergence is defined on a ball in R < sup > 3 </ sup >, then there exists some vector field G on the ball with F = curl ( G ).

If in the third identity we take H = G, we get that the set of commutators is stable under any endomorphism of G. This is in fact a generalization of the second identity, since we can take f to be the conjugation automorphism.

Linear Diophantine equations take the form ax + by = c. If c is the greatest common divisor of a and b then this is Bézout's identity, and the equation has an infinite number of solutions.

It follows that there are also infinitely many solutions if c is a multiple of the greatest common divisor of a and b. If c is not a multiple of the greatest common divisor of a and b, then the Diophantine equation ax + by = c has no solutions.