Search Results for ""
461 - 470 of 702 for Goldbach ConjectureSearch Results

A map defined by one or more polynomials. Given a field K, a polynomial map is a map f:K^n->K^m such that for all points (x_1,...,x_n) in K^n, ...
Consider solutions to the equation x^y=y^x. (1) Real solutions are given by x=y for x,y>0, together with the solution of (lny)/y=(lnx)/x, (2) which is given by ...
An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...
A prime constellation, also called a prime k-tuple, prime k-tuplet, or prime cluster, is a sequence of k consecutive numbers such that the difference between the first and ...
The projective special orthogonal group PSO_n(q) is the group obtained from the special orthogonal group SO_n(q) on factoring by the scalar matrices contained in that group. ...
The projective special unitary group PSU_n(q) is the group obtained from the special unitary group SU_n(q) on factoring by the scalar matrices contained in that group. ...
For a group G and a normal subgroup N of G, the quotient group of N in G, written G/N and read "G modulo N", is the set of cosets of N in G. Quotient groups are also called ...
A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...
Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.
For a set partition of n elements, the n-character string a_1a_2...a_n in which each character gives the set block (B_0, B_1, ...) in which the corresponding element belongs ...

...