Any individual has one of six possible genotypes ( AA, AO, BB, BO, AB, and OO ) that produce one of four possible phenotypes: " A " ( produced by AA homozygous and AO heterozygous genotypes ), " B " ( produced by BB homozygous and BO heterozygous genotypes ), " AB " heterozygotes, and " O " homozygotes.

The blitter's block copying mode takes zero to three data sources in memory, called A, B and C, performs a programmable boolean function on the data sources and writes the result to a destination area, D. Any of these four areas can overlap.

Any architectural project we do takes at least four or five years, so increasingly there is a discrepancy between the acceleration of culture and the continuing slowness of architecture.

Any combination of four things might happen with this light ray: absorption, reflection, refraction and fluorescence.

Any group of four students may run for office, but there must always be four students.

Any time a player has four of any suit in one's hand, one Tries.

Any conic that passes through the four orthocentric points can only be a rectangular hyperbola.

* Any three or four cards of equal rank, but of distinct suits.

Any of these four choices may be the open-loop amplifier used to construct the feedback amplifier.

Any Nv network greater than or equal to four, but specifically any multiple numeric prefixed cores ( such as a Quadcore, Quincore, Hexcore, Septcore, Octacore, etc.

Any rider taking a tactical substitute ride or double points ride is denoted by a black and white helmet colour as rather than one of the four usual coloured helmets.

Set Reconstruction Conjecture: Any two graphs on at least four vertices with the same sets of vertex-deleted subgraphs are isomorphic.

Edge Reconstruction Conjecture: ( Harary, 1964 ) Any two graphs with at least four edges and having the same edge-decks are isomorphic.

* Any of four kings of Urartu, an Iron Age kingdom in what is now Turkey and Armenia

Any chain represents an integer, according to the four rules below.

Any money loss of the first four issues would be borne by a well-known supermarket chain, but its name was undisclosed.

Any player winning all four hands in any round is said to have crashed, and automatically wins the entire game.

He also wrote four episodes for the Star Trek series: " Mirror, Mirror ", " Day of the Dove ", " Requiem for Methuselah ", and " By Any Other Name ".

* Any of the four Anglo-Dutch Wars:

Any student attending Pitzer can enroll in classes at the other four colleges, and can complete an off-campus major if the major is not offered by Pitzer.

* Any of four bands of overlapping eras:

Any single, double, four, or eight is eligible to enter.

* Any two vertices in G can be connected by a unique simple path.

Any directed graph generates a small category: the objects are the vertices of the graph, and the morphisms are the paths in the graph ( augmented with loops as needed ) where composition of morphisms is concatenation of paths.

Any undirected graph may be made into a DAG by choosing a total order for its vertices and orienting every edge from the earlier endpoint in the order to the later endpoint.

Reconstruction Conjecture: Any two hypomorphic graphs on at least three vertices are isomorphic.

A graph coloring is an assignment of one of k colors to a graph G so that the endpoints of each edge have different colors, for some number k. Any coloring corresponds to a homomorphism from G to a complete graph K < sub > k </ sub >: the vertices of K < sub > k </ sub > correspond to the colors of G, and f maps each vertex of G with color c to the vertex of K < sub > k </ sub > that corresponds to c. This is a valid homomorphism because the endpoints of each edge of G are mapped to distinct vertices of K < sub > k </ sub >, and every two distinct vertices of K < sub > k </ sub > are connected by an edge, so every edge in G is mapped to an adjacent pair of vertices in K < sub > k </ sub >.

Any point located on this triangle may then be written as a weighted sum of these three vertices, i. e.

Any finite set of lines in the Euclidean plane has a combinatorially equivalent arrangement in the hyperbolic plane ( e. g. by enclosing the vertices of the arrangement by a large circle and interpreting the interior of the circle as a Klein model of the hyperbolic plane ).

Let now v and w be two vertices in G. Any spanning tree contains precisely one simple path between v and w. Taking this path in the uniform spanning tree gives a random simple path.

Any tournament on a finite number of vertices contains a Hamiltonian path, i. e., directed path on all vertices ( Rédei 1934 ).

Any pair of adjacent vertices can be mapped to another by an Graph automorphism | automorphism, since any five-vertex ring can be mapped to any other.

Any vertices affected by the merge are added or removed from the stacks as appropriate.

Any planar graph with vertices has at most edges, from which it follows by Nash-Williams ' formula that planar graphs have arboricity at most three.

Any spanning tree T of a graph G has at least two leaves, vertices that have only one edge of T incident to them.

Any set of five points in the plane in general position has a subset of four points that form the vertices of a convex quadrilateral.

Any irregularity on the piston heads will make it impossible, with normal means, to determine the final combustion chamber volume because the volume displaced by the piston heads cannot be readily computed.

Any aircraft rudder is subject to considerable forces that determine its position via a force or torque balance equation.

Any possible course of experience resulting from a possible course of action will apparently underdetermine our surroundings: it would determine, for example, that there is either white wallpaper under red light or red wallpaper under white light, and so on.

# Any two distinct points of a straight line completely determine that line ; that is, if AB

# Any three points A, B, C of a plane α, which do not lie in the same straight line, completely determine that plane.

Any player participating in a game with non-standard hands should be sure to determine the exact rules of the game before play begins.

Any operation by any subject on any object will be tested against the set of authorization rules ( aka policy ) to determine if the operation is allowed.

Any fabrics that line or decorate the case ( e. g. polyester blend fabric ), and any adhesives used in the process, should also be tested to determine any risk.

Any institution wishing to consolidate itself and stand out in its field must determine its mission and goals, clearly stating and distinguishing between that which is primary and that which is secondary.

Any 615n series card can fail, but it is up to HP to determine if the failure is due to the chipset or some other factor.

Any one mineral may be dominant, and this, together with the two or three other major minerals present, suffices to determine the petrographic name.

Any discrepencies in time, Luther dismisses with, " We cannot find and determine all days and hours so precisely, when we write history it is enough for us that we come pretty close, ...".