We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 138 results
  1. On the arguments of the roots of the generalized Fibonacci polynomial

    We revisit the classical subject of equidistribution of the roots of Littlewood-type polynomials. More precisely, we show that the roots of the...

    Adel Alahmadi, Oleksiy Klurman, ... Hatoon Shoaib in Lithuanian Mathematical Journal
    Article Open access 01 July 2023
  2. Root location for the characteristic polynomial of a Fibonacci type sequence

    We analyse the roots of the polynomial x n px n −1 qx − 1 for p q ≽ 1. This is the characteristic polynomial of the recurrence relation F k,p,q ( n ) = pF...

    Zhibin Du, Carlos M. da Fonseca in Czechoslovak Mathematical Journal
    Article 04 November 2022
  3. The Tribonacci Dirichlet series

    We study some of the analytic properties of a Dirichlet series defined by the sequence of the Tribonacci numbers, such as its analytic continuation...

    Á Serrano Holgado in Acta Mathematica Hungarica
    Article 22 May 2023
  4. On some combinatorial properties of generalized commutative Jacobsthal quaternions and generalized commutative Jacobsthal-Lucas quaternions

    We study generalized commutative Jacobsthal quaternions and generalized commutative Jacobsthal-Lucas quaternions. We present some properties of these...

    Dorota Bród, Anetta Szynal-Liana, Iwona Włoch in Czechoslovak Mathematical Journal
    Article 12 September 2022
  5. Sign changes of certain arithmetical function at prime powers

    We examine an arithmetical function defined by recursion relations on the sequence { f ( p k )} k ∈ℕ and obtain sufficient condition(s) for the sequence to...

    Rishabh Agnihotri, Kalyan Chakraborty in Czechoslovak Mathematical Journal
    Article 23 April 2021
  6. On the Diophantine equation (2x − 1)(py − 1) = 2z2

    Let p be an odd prime. By using the elementary methods we prove that: (1) if 2 ∤ x, p = ±3 (mod 8), the Diophantine equation (2 x − 1)( p y − 1) = 2 z 2 ...

    Article 06 March 2021
  7. On the Third-Order Horadam and Geometric Mean Sequences

    In this paper, in considering aspects of the geometric mean sequence, offers new results connecting generalized Tribonacci and third-order Horadam...

    Article 01 September 2020
  8. Even perfect numbers in generalized Pell sequences

    In this paper, by using linear forms in logarithms and the Baker–Davenport reduction procedure we prove that there are no even perfect numbers...

    Jhon J. Bravo, Jose L. Herrera in Lithuanian Mathematical Journal
    Article 02 December 2020
  9. Pell and Pell-Lucas Numbers of the Form −2a − 3b + 5c

    In this paper, we find all Pell and Pell-Lucas numbers written in the form −2 a − 3 b + 5 c , in nonnegative integers a , b , c , with 0 ⩽ max{ a , b } ⩽ c .

    Yunyun Qu, Jiwen Zeng in Czechoslovak Mathematical Journal
    Article 02 December 2019
  10. Lucas numbers as sums of two repdigits

    In this paper, we determine all Lucas numbers that are sums of two repdigits. The largest one is L 14 = 843 = 66 + 777.

    Chèfiath Adegbindin, Florian Luca, Alain Togbé in Lithuanian Mathematical Journal
    Article 01 July 2019
  11. Further results on Hilbert’s Tenth Problem

    Hilbert’s Tenth Problem (HTP) asked for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has...

    Zhi-Wei Sun in Science China Mathematics
    Article 28 December 2020
  12. Zeckendorf representations with at most two terms to x-coordinates of Pell equations

    In this paper, we find all positive squarefree integers d satisfying that the Pell equation X 2 dY 2 = ±1 has at least two positive integer solutions ( X ...

    Carlos A. Gómez, Florian Luca in Science China Mathematics
    Article 22 January 2019
  13. Enumerating Some Stable Partitions Involving Stirling and r-Stirling Numbers of the Second Kind

    The coefficient of the chromatic polynomial counts the number of partitions of the vertex set of a simple and finite graph G into k independent...

    H. Belbachir, M. A. Boutiche, A. Medjerredine in Mediterranean Journal of Mathematics
    Article 17 April 2018
  14. Leavitt Path Algebras of Cayley Graphs \(C_n^j\)

    Gene Abrams, Stefan Erickson, Cristóbal Gil Canto in Mediterranean Journal of Mathematics
    Article 15 September 2018
  15. Optimal codes from Fibonacci polynomials and secret sharing schemes

    In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases...

    Mehmet E. Koroglu, Ibrahim Ozbek, Irfan Siap in Arabian Journal of Mathematics
    Article Open access 25 May 2017
Did you find what you were looking for? Share feedback.