7796 search results - page 6 / 1560 » On Generalized Schur Numbers |
MOC
2002
14 years 9 months ago
2002
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
DM
2002
14 years 9 months ago
2002
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
ENDM
2008
14 years 9 months ago
2008
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
EJC
2011
14 years 4 months ago
2011
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...
DCG
2010
14 years 9 months ago
2010
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...