Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUsing Fibonacci factors to create Fibonacci pseudoprimes
71
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Carmichael showed for sufficiently large $L$, that $F_L$ has at least one prime divisor that is $pm 1({rm mod}, L)$. For a given $F_L$, we will show that a product of distinct odd prime divisors with that congruence condition is a Fibonacci pseudoprime. Such pseudoprimes can be used in an attempt, here unsuccessful, to find an example of a Baillie-PSW pseudoprime, i.e. an odd Fibonacci pseudoprime that is congruent to $pm 2({rm mod}, 5)$ and is also a base-2 pseudoprime.
rate research
Read More
The generalized Fibonacci sequences are sequences ${f_n}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t in mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent paper, Amdeberhan, Chen, Moll, and Sagan considered some arithmetic properites of the generalized Fibonacci sequence. Specifically, they considered the behavior of analogues of the $p$-adic valuation and the Riemann zeta function. In this paper, we resolve some conjectures which they raised relating to these topics. We also consider the rank modulo $n$ in more depth and find an interpretation of the rank in terms of the order of an element in the multiplicative group of a finite field when $n$ is an odd prime. Finally, we study the distribution of the rank over different values of $s$ when $t = -1$ and suggest directions for further study involving the rank modulo prime powers of generalized Fibonacci sequences.
In recent work, M. Just and the second author defined a class of semi-modular forms on $mathbb C$, in analogy with classical modular forms, that are half modular in a particular sense; and constructed families of such functions as Eisenstein-like series using symmetries related to integer partitions. Looking for further natural examples of semi-modular behavior, here we construct a family of Eisenstein-like series to produce semi-modular forms, using symmetries related to Fibonacci numbers instead of partitions. We then consider other Lucas sequences that yield semi-modular forms.
This note argues that when dot-plotting distributions typically found in papers about web and social networks (degree distributions, component-size distributions, etc.), and more generally distributions that have high variability in their tail, an exponentially binned version should always be plotted, too, and suggests Fibonacci binning as a visually appealing, easy-to-use and practical choice.
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly found by the recurrence relations.
We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when $ n otequiv 0 Mod 4$ and $(n,j) eq (3,3),$ the Fibonacci knot $ cF_j^{(n)} $ is not a Lissajous knot.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
