Search Results for ""

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...

A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

Let K be a number field of extension degree d over Q. Then an order O of K is a subring of the ring of integers of K with d generators over Z, including 1. The ring of ...

An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...

A number which is simultaneously a pentagonal number P_n and a square number S_m. Such numbers exist when 1/2n(3n-1)=m^2. (1) Completing the square gives ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Let H_n denote the nth hexagonal number and S_m the mth square number, then a number which is both hexagonal and square satisfies the equation H_n=S_m, or n(2n-1)=m^2. (1) ...

Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...