Search Results for ""

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

An algorithm for determining the order of an elliptic curve E/F_p over the finite field F_p.

11 21 8 61 22 58 241 52 328 444 1201 114 1452 4400 3708 7201 240 5610 32120 58140 33984 5040 (1) The second-order Eulerian triangle (OEIS A008517) is the number triangle ...

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...

A commutative Noetherian unit ring having only finitely many maximal ideals. A ring having the same properties except Noetherianity is called quasilocal. If K is a field, the ...

A proper ideal I of a ring R is called semiprime if, whenever J^n subset I for an ideal J of R and some positive integer, then J subset I. In other words, the quotient ring ...

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...

Let p(n) be the first prime which follows a prime gap of n between consecutive primes. Shanks' conjecture holds that p(n)∼exp(sqrt(n)). Wolf conjectures a slightly different ...