Results 91 to 100 of about 1,822,465 (296)

Mulatu Numbers That Are Concatenations of Two Lucas Numbers

open access: yesAfyon Kocatepe University Journal of Sciences and Engineering, 2023
In this paper, we find that all Mulatu numbers, which are concatenations of two Lucas numbers are 11,17,73,118. Let 〖(M_k)〗_(k≥0) and 〖(L_k)〗_(k≥0) be the Mulatu and Lucas sequences. That is, we solve the Diophantine equation M_k=L_m L_n=10^d L_m+L_n in non-negative integers (k,m,n,d), where d denotes the number of digits of L_n.
openaire   +3 more sources

On certain bihypernomials related to Pell and Pell-Lucas numbers

open access: yes, 2022
The bihyperbolic numbers are extension of hyperbolic numbers to four dimensions. In this paper we introduce the concept of Pell and Pell-Lucas bihypernomials as a generalization of bihyperbolic Pell and Pell-Lucas numbers, respectively ...
LIANA, Anetta SZYNAL
core   +1 more source

Modular, Textile‐Based Soft Robotic Grippers for Agricultural Produce Handling

open access: yesAdvanced Robotics Research, EarlyView.
This article introduces textile‐based pneumatic grippers that transform simple textiles into robust bending actuators. Detailed experiments uncover how cut geometry and fabric selection shape performance. Successful handling of fragile agricultural items showcases the potential of textile robotics for safe, scalable automation in food processing and ...
Zeyu Hou   +4 more
wiley   +1 more source

On the Products of k-Fibonacci Numbers and k-Lucas Numbers

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2014
In this paper we investigate some products of k-Fibonacci and k-Lucas numbers. We also present some generalized identities on the products of k-Fibonacci and k-Lucas numbers to establish connection formulas between them with the help of Binet's formula.
Bijendra Singh   +2 more
doaj   +1 more source

Incomplete fibonaccı ve lucas p - numbers

open access: yes, 2011
Bu çalışmada tamamlanmamış genelleştirilmiş Fibonacci sayılarına benzer olarak tamamlanmamış Fibonacci p - sayıları tanımlandı. Ayrıca Lucas p- sayılarından yararlanarak tamamlanmamış Lucas p - sayıları tanımlandı.
Firengiz, Miraç Çetin
core  

On Jacobsthal and Jacobsthal-Lucas hybrid numbers [PDF]

open access: yes, 2018
The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper we consider special kinds of hybrid numbers, namely the Jacobsthal and the Jacobsthal-Lucas hybrid numbers and we give some their ...
Szynal-Liana, Anetta, Włoch, Iwona
core  

A new generalization of Fibonacci hybrid and Lucas hybrid numbers

open access: yes, 2020
In the paper, we define the q − Fibonacci hybrid numbers and the q − Lucas hybrid numbers, respectively. Then, we give some algebraic properties of q − Fibonacci hybrid numbers and the q − Lucas hybrid ...
Can Kızılateş
core   +1 more source

Bistable Networks Enable Complex Shape Changes

open access: yesAdvanced Science, EarlyView.
Transition‐controlled metamaterials are networks of bistable mechanical memory that store local binary states and express them as global shape change. By decoupling low‐force programming from high‐force holding, a single lattice is reconfigured into distinct 2D profiles and 3D surfaces without continuous actuation, enabling reusable morphing materials ...
Sawyer Thomas, Jeffrey Lipton
wiley   +1 more source

Determinants, Norms, and the Spread of Circulant Matrices with Tribonacci and Generalized Lucas Numbers

open access: yesAbstract and Applied Analysis, 2014
Circulant matrices play an important role in solving ordinary and partial differential equations. In this paper, by using the inverse factorization of polynomial of degree n, the explicit determinants of circulant and left circulant matrix involving ...
Juan Li, Zhaolin Jiang, Fuliang Lu
doaj   +1 more source

A fast recurrence for Fibonacci and Lucas numbers

open access: yesCoRR, 2021
We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is probably not new, we have not been able to find a reference for it.
openaire   +2 more sources

Home - About - Disclaimer - Privacy