Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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 ...
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...
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...
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...
Perbandingan Penggunaan Bilangan Prima Aman Dan Tidak Aman Pada Proses Pembentukan Kunci
Perbandingan Penggunaan Bilangan Prima Aman Dan Tidak Aman Pada Proses Pembentukan Kunci
Algoritma ElGamal merupakan algoritma dalam kriptografi yang termasuk dalam kategori algoritma asimetris. Keamanan algoritma ElGamal terletak pada kesulitan penghitungan logaritma ...
#101 Propriedades mecânicas de resinas impressas para prótese fixa após envelhecimento
#101 Propriedades mecânicas de resinas impressas para prótese fixa após envelhecimento
Objetivos: Avaliar a influência do tipo de material e do modo de envelhecimento na resistência à flexão e módulo de flexão de resinas à base de metacrilato, convencionais e impress...
UMA PROPOSTA DE WORKFLOW PARA CONSTRUÇÃO DE CORPUS DIGITAL EM LÍNGUA DE SINAIS
UMA PROPOSTA DE WORKFLOW PARA CONSTRUÇÃO DE CORPUS DIGITAL EM LÍNGUA DE SINAIS
Os corpora de línguas de sinais disponíveis atualmente em pesquisas linguísticas e em sites para acesso livre são constituídos por um módulo de gravação feita em vídeo, pois os dad...

Back to Top