• Publications
  • Influence
Physical and mechanical properties of cement-based products containing incineration bottom ash.
This paper presents the results of a wider experimental programme conducted in the framework of the NNAPICS ("Neural Network Analysis for Prediction of Interactions in Cement/Waste Systems") projectExpand
  • 112
  • 8
Derivative Sequences of Fibonacci and Lucas Polynomials
Let us consider the Fibonacci polynomials U n(x) and the Lucas polynomials V n (x) (or simply U n and Vn, if there is no danger of confusion) defined as $$ {U_n} = x{U_{n - 1}} + {U_{n - 2}}({U_0}Expand
  • 49
  • 2
  • PDF
Incomplete Fibonacci and Lucas numbers
A particular use of well-known combinatorial expressions for Fibonacci and Lucas numbers gives rise to two interesting classes of integers (namely, the numbersFn(k) andLn(k)) governed by the integralExpand
  • 28
  • 2
DERIVATIVE SEQUENCES OF JACOBSTHAL AND JACOBSTHAL-LUCAS POLYNOMIALS
where the symbol ["J denotes the greatest integer function, and the bracketed superscript symbolizes the first derivative with respect to x. The aim of this paper is to study some properties of theExpand
  • 10
  • 1
  • PDF
On certain Fibonacci‐type sums
The infinite sum of consecutive generalized Fibonacci numbers Ui (i = 1, 2, 3...) divided by ri (r an arbitrary non‐vanishing quantity) is investigated. After establishing the values of r for whichExpand
  • 7
  • 1
Partial Derivative Sequences of Second-Order Recurrence Polynomials
The derivative sequences of Fibonacci and Lucas polynomials studied in [1] can be seen from a more general point of view and the results established in that paper can be extended considerably by theExpand
  • 3
  • 1
Functions of the Kronecker Square of the Matrix Q
As for the well-known matrix Q, [1], a number of matrices can be defined so that their successive powers contain entries related to certain Fibonacci numbers
  • 2
  • 1
A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers
TLDR
In virtue of the apparent paucity of the composite numbers which are Fibonacci pseudoprimes of the mth kind for distinct values of m, a method, which we believe to be new, for finding large probable primes is proposed. Expand
  • 22
  • PDF
Representation of Natural Numbers as Sums of Fibonacci Numbers: An Application to Modern Cryptography
After giving some basic concepts of a cryptographic technique referred to as Stream Ciphering [7] (Sec. 2) we have a look at the translation of natural numbers into Fibonacci binary sequences (Sec.Expand
  • 8
...
1
2
3
4
...