Results 31 to 40 of about 10,580,440 (338)

Designing a European-Wide Crop Type Mapping Approach Based on Machine Learning Algorithms Using LUCAS Field Survey and Sentinel-2 Data

open access: yesRemote Sensing, 2022
One of the most challenging aspects of obtaining detailed and accurate land-use and land-cover (LULC) maps is the availability of representative field data for training and validation.
Babak Ghassemi   +5 more
semanticscholar   +1 more source

Hybrid hyper-Fibonacci and hyper-Lucas numbers

open access: yesNotes on Number Theory and Discrete Mathematics, 2023
Different number systems have been studied lately. Recently, many researchers have considered the hybrid numbers which are generalization of the complex, hyperbolic and dual number systems.
Yasemin Alp
semanticscholar   +1 more source

On the reciprocal sum of the fourth power of Fibonacci numbers

open access: yesOpen Mathematics, 2022
Let fn{f}_{n} be the nnth Fibonacci number with f1=f2=1{f}_{1}={f}_{2}=1. Recently, the exact values of ∑k=n∞1fks−1⌊{\left({\sum }_{k=n}^{\infty }\frac{1}{{f}_{k}^{s}}\right)}^{-1}⌋ have been obtained only for s=1,2s=1,2, where ⌊x⌋\lfloor x\
Hwang WonTae   +2 more
doaj   +1 more source

On divisors of Lucas and Lehmer numbers [PDF]

open access: yesActa Mathematica, 2013
Let u(n) be the n-th term of a Lucas sequence or a Lehmer sequence.In this article we shall establish an estimate from below for the greatest prime factor of u(n) which is of the form nexp(logn/104loglogn). In so doing we are able to resolve a question of Schinzel from 1962 and a conjecture of Erdos from 1965.In addition we are able to give the first ...
openaire   +3 more sources

Fibonacci and Lucas Polynomials in n-gon

open access: yesAnalele Universitatii "Ovidius" Constanta - Seria Matematica, 2023
In this paper, we bring into light, study the polygonal structure of Fibonacci polynomials that are placed clockwise on these by a number corresponding to each vertex. Also, we find the relation between the numbers with such vertices.
B. Kuloğlu, E. Özkan, M. Marin
semanticscholar   +1 more source

p-Analogue of biperiodic Pell and Pell–Lucas polynomials

open access: yesNotes on Number Theory and Discrete Mathematics, 2023
In this study, a binomial sum, unlike but analogous to the usual binomial sums, is expressed with a different definition and termed the p-integer sum. Based on this definition, p-analogue Pell and Pell–Lucas polynomials are established and the generating
B. Kuloğlu, E. Özkan, A. Shannon
semanticscholar   +1 more source

Bernoulli Numbers, Wolstenholme's Theorem, and p^5 Variations of Lucas' Theorem [PDF]

open access: yes, 2006
In this note we shall improve some congruences of D.F. Bailey [Two p^3 variations of Lucas' Theorem, JNT 35(1990), pp. 208-215] to higher prime power moduli, by studying the relation between irregular pairs of the form (p,p-3) and refined version of ...
Bailey   +10 more
core   +3 more sources

Three new classes of binomial Fibonacci sums [PDF]

open access: yesTransactions on Combinatorics
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients. One particular result is linked to a problem proposal recently published in the journal The Fibonacci Quarterly.
Robert Frontczak
doaj   +1 more source

Practical numbers in Lucas sequences [PDF]

open access: yesQuaestiones Mathematicae, 2018
A practical number is a positive integer n such that all the positive integers m ≤ n can be written as a sum of distinct divisors of n. Let (un)n≥0 be the Lucas sequence satisfying u0 = 0, u1 = 1, and un+2 = aun+1 + bun for all integers n ≥ 0, where a and b are fixed nonzero integers. Assume a(b + 1) even and a 2 + 4b > 0.
openaire   +3 more sources

On the k-Mersenne–Lucas numbers [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics, 2021
In this paper, we will introduce a new definition of k-Mersenne–Lucas numbers and investigate some properties. Then, we obtain some identities and established connection formulas between k-Mersenne–Lucas numbers and k-Mersenne numbers through the use of Binet’s formula.
Ali Boussayoud, Mourad Chelgham
openaire   +1 more source

Home - About - Disclaimer - Privacy