𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimal number with a given number of divisors

✍ Scribed by Ron Brown

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
136 KB
Volume
116
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimal trees of given search number
Minimal trees of given search number
✍ Jonathan D.H. Smith πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 717 KB

A recurrence relation and asymptotic estimate for the number of minimal trees of given search number are derived. In addition, a language for describing these trees and structures within them is developed. Their automorphisms groups are also discussed.

Unicyclic graphs with given number of pe
Unicyclic graphs with given number of pendent vertices and minimal energy
✍ Hongbo Hua; Maolin Wang πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 196 KB

The energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all eigenvalues of the adjacency matrix of G. Let G(n, l, p) denote the set of all unicyclic graphs on n vertices with girth and pendent vertices being l ( 3) and p ( 1), respectively. More recently, one of the

Sums of Numbers with Many Divisors
Sums of Numbers with Many Divisors
✍ Paul ErdΕ‘s; Hugh L Montgomery πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 87 KB

Let k be a fixed integer, k 2, and suppose that =>0. We show that every sufficiently large integer n can be expressed in the form n=m 1 +m 2 + } } } +m k where d(m i )>n (log 2&=)(1&1Γ‚k)Γ‚log log n for all i. This is best possible, since there are infinitely many exceptional n if the factor log 2&= i