Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Congruences for Fishburn numbers modulo prime powers
View through CrossRef
The Fishburn numbers ξ(n) are defined by the formal power series [Formula: see text] Recently, Andrews and Sellers discovered congruences of the form ξ(pm + j) ≡ 0 modulo p, valid for all m ≥ 0. These congruences have then been complemented and generalized to the case of r-Fishburn numbers by Garvan. In this note, we answer a question of Andrews and Sellers regarding an extension of these congruences to the case of prime powers. We show that, under a certain condition, all these congruences indeed extend to hold modulo prime powers.
Title: Congruences for Fishburn numbers modulo prime powers
Description:
The Fishburn numbers ξ(n) are defined by the formal power series [Formula: see text] Recently, Andrews and Sellers discovered congruences of the form ξ(pm + j) ≡ 0 modulo p, valid for all m ≥ 0.
These congruences have then been complemented and generalized to the case of r-Fishburn numbers by Garvan.
In this note, we answer a question of Andrews and Sellers regarding an extension of these congruences to the case of prime powers.
We show that, under a certain condition, all these congruences indeed extend to hold modulo prime powers.
Related Results
Teaching Congruences in Connection with Diophantine Equations
Teaching Congruences in Connection with Diophantine Equations
The presented paper is devoted to the new teaching model of congruences of computer science students within the subject of discrete mathematics at universities. The main goal was t...
Prime Numbers Calculation Formulas
Prime Numbers Calculation Formulas
The application of prime numbers in modern science, especially in computer
science, is very wide. Since prime numbers can only divisible by 1 and themselves,
they are not factored ...
Structures and applications of graphs arising from congruences over moduli
Structures and applications of graphs arising from congruences over moduli
<p>For any positive integer $ \mathrm{n} $, let $ \mathrm{M_{p}} $ contain the prime numbers less than $ \mathrm{n} $. Assuming $ \mathrm{M_{p}} $ as the set of moduli, we dr...
Structural Patterns of Goldbach Partition Numbers: A High-Precision Estimation Model Based on Prime Density
Structural Patterns of Goldbach Partition Numbers: A High-Precision Estimation Model Based on Prime Density
Abstract
This research proposes a new approach to the Goldbach Conjecture based on the relationship between the partition numbers of even integers and interval prime densit...
THE UNIVERSAL KUMMER CONGRUENCES
THE UNIVERSAL KUMMER CONGRUENCES
AbstractLet $p$ be a prime. In this paper, we present a detailed $p$-adic analysis on factorials and double factorials and their congruences. We give good bounds for the $p$-adic s...
Unusual patterns found in prime numbers that hints primes are not arbitrary distributed.
Unusual patterns found in prime numbers that hints primes are not arbitrary distributed.
Prime numbers are very special numbers, and a lot of research has been made to find patterns in primes. In this paper, the author tries to find a hidden pattern never discovered be...
Generalized Mersenne Numbers and Prime Number Generation
Generalized Mersenne Numbers and Prime Number Generation
In this study, Mersenne numbers are generalized to include an infinite set defined by the sequence of odd primes. To implement a straightforward algorithm for generating prime numb...
Development of a Simple Prime Number Determination Method by excluding Composite Numbers on 6n±1
Development of a Simple Prime Number Determination Method by excluding Composite Numbers on 6n±1
A prime number is a natural number with no divisors other than itself and the number 1. There are many unsolved problems related to prime numbers. One such problem is finding a gen...