Results 41 to 50 of about 50 (50)
Some of the next articles are maybe not open access.
On the Fibonacci numbers of the composition of graphs
Discrete Applied Mathematics, 2019Abstract Let G = ( V , E ) be a graph. A subset S of V is said to be independent if for every two vertices u , v ∈ S there is no edge between them. The Fibonacci number of a graph G is the total number of independent vertex sets of G .
Hortensia Galeana-Sánchez +1 more
openaire +1 more source
Complete compositions of a natural number
Quaestiones Mathematicae, 2006An alternative proof is given for the recently established fact that approximately one half of all compositions of a natural number are complete.Keywords: composition, generating functionQuaestiones Mathematicae 29(2006), 229 ...
openaire +3 more sources
Compositions with a fixed number of inversions
Aequationes mathematicae, 2018A composition of the positive integer n is a representation of n as an ordered sum of positive integers $$n=a_1+a_2+\dots +a_m.$$ There are
A. Knopfmacher, M. E. Mays, S. Wagner
openaire +2 more sources
The least witness of a composite number
1998We consider the problem of finding the least witness of a composite number. If n is a composite number then a number w for which n is not a strong pseudo-prime to the base w is called a witness for n. Let w(n) be the least witness for a composite n. Bach [7] assuming the Generalized Riemann Hypothesis (GRH) showed that w(n) < 2log2 n.
R. Balasubramanian, S. V. Nagaraj
openaire +2 more sources
A Sequence of Composite Numbers: 10947
The American Mathematical Monthly, 2004LSU Problem Solving Group +1 more
openaire +2 more sources
A Conjecture on Consecutive Composite Numbers [PDF]
The American Mathematical Monthly, 1969 openaire +1 more source
A Note on Consecutive Composite Numbers
The American Mathematical Monthly, 1961openaire +2 more sources