On Fibonacci numbers which are elliptic Carmichael (Q1677544): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: There are infinitely many Carmichael numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci numbers at most one away from a perfect power / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: INFINITUDE OF ELLIPTIC CARMICHAEL NUMBERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution of Lucas and Elliptic Pseudoprimes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4689684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Counting Function of Elliptic Carmichael Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of Pseudoprimes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Carmichael numbers and elliptic Korselt criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On divisors of Lucas and Lehmer numbers / rank
 
Normal rank

Latest revision as of 17:47, 14 July 2024

scientific article
Language Label Description Also known as
English
On Fibonacci numbers which are elliptic Carmichael
scientific article

    Statements

    On Fibonacci numbers which are elliptic Carmichael (English)
    0 references
    0 references
    0 references
    10 November 2017
    0 references
    The concept of an E-Carmichael numbers is introduced in \textit{F. Luca} and \textit{I. E. Shparlinski} [Can. Math. Bull. 57, No. 1, 105--112 (2014; Zbl 1331.11115)]. \smallskip Let \(D = { 2, 3, 7, 11, 19, 43, 67, 163}\), \[ N_d = { n : F_n \text{ is E-Carmichael number related to \(d\)}}, \] and \({F_n}_{n \geq 0}\) be the Finonacci sequence. It is proved the following \textbf{Theorem.} For \(d \in D\): \[ N_d (x) \leq \frac{x}{(log x)^{\frac{1}{2}+o(1)}} (x \rightarrow \infty). \]
    0 references
    0 references
    Fibonacci numbers
    0 references
    Elliptic Carmichael numbers
    0 references
    primitive divisors
    0 references
    0 references