Loading [MathJax]/jax/output/CommonHTML/jax.js
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    On a variant of Pillai’s problem

    In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a Tribonacci number.

  • articleNo Access

    Representation of integers by k-generalized Fibonacci sequences and applications in cryptography

    The aim of this paper is to construct a relation between tribonacci numbers and generalized tribonacci numbers. Besides, certain conditions are obtained to generalize the representation of a positive integer N which is determined in [S. Badidja and A. Boudaoud, Representation of positive integers as a sum of distinct tribonacci numbers, J. Math. Statistic. 13 (2017) 57–61] for a k-generalized Fibonacci numbers (F(k)n)n. Lastly, some applications to cryptography are given by using (F(k)n)n.