English
Related papers

Related papers: Three term recurrence and residue completeness

200 papers

We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…

Number Theory · Mathematics 2022-05-16 Pieter Moree , Armand Noubissie

We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…

Number Theory · Mathematics 2023-02-06 Manjil P. Saikia , Abhishek Sarma , Pranjal Talukdar

In this note, we give short proofs of the well-known results that the exponent of the Schur multiplier $\M$ divides the exponent of $\G$ for finite $\p$-groups of maximal class and potent $\p$-groups. Moreover, we prove the same for a…

Group Theory · Mathematics 2020-12-15 A. E Antony , P. Komma , V. Z. Thomas

In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…

Number Theory · Mathematics 2025-11-04 Armin Straub

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

Mathematical Physics · Physics 2015-06-15 Satoru Odake

We introduce the completeness problem for Modal Logic and examine its complexity. For a definition of completeness for formulas, given a formula of a modal logic, the completeness problem asks whether the formula is complete for that logic.…

Logic in Computer Science · Computer Science 2017-09-20 Antonis Achilleos

Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal number of previous terms…

Number Theory · Mathematics 2025-01-27 Eric Rowland , Jesus Sistos Barron

For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…

Number Theory · Mathematics 2019-01-01 Douglas Bowman , James Mc Laughlin

We characterize which residue classes contain infinitely many totients (values of Euler's function) and which do not. We show that the union of all residue classes that are totient-free has asymptotic density 3/4, that is, almost all…

Number Theory · Mathematics 2020-05-06 Kevin Ford , Sergei Konyagin , Carl Pomerance

There is a probability charge on the power set of the integers that gives probability $1/p$ to every residue class modulo a prime $p$. There exists such a charge that gives probability $w$ to the set of prime numbers iff $w \in [0,1/2]$.…

Probability · Mathematics 2018-09-20 Michael Spece , Joseph B. Kadane

Let $p$ be a prime number and $E_{p}$ denote the elliptic curve $y^2=x^3+px$. It is known that for $p$ which is congruent to $1, 9$ modulo $16$, the rank of $E_{p}$ over $\mathbb{Q}$ is equal to $0, 2$. Under the condition that the Birch…

Number Theory · Mathematics 2021-03-23 Keiichiro Nomoto

A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…

Group Theory · Mathematics 2007-05-23 Arturo Magidin

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Number Theory · Mathematics 2013-10-09 Sandro Mattarei , Roberto Tauraso

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Combinatorics · Mathematics 2025-07-29 Christian Krattenthaler , Thomas W. Müller

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

Number Theory · Mathematics 2013-02-07 Zhi-Hong Sun

For odd primes $p$ we consider the factors \[ A(p)=\frac{p-\chi_4(p)}{p+\chi_4(p)}, \qquad \chi_4(p)= \begin{cases} 1,&p\equiv 1\pmod 4, \\ -1,&p\equiv 3\pmod 4, \end{cases} \] and study products of $A(p)$ restricted to unions of residue…

General Mathematics · Mathematics 2026-05-12 Mike Winkler

The distribution of values of the full ranks of marked Durfee symbols is examined in prime and nonprime arithmetic progressions. The relative populations of different residues for the same modulus are determined: the primary result is that…

Combinatorics · Mathematics 2009-05-26 William J. Keith

This paper gives the additivity and reduction formulas for mixed multiplicities of multi-graded modules $M$ and mixed multiplicities of arbitrary ideals, and establishes the recursion formulas for the sum of all the mixed multiplicities of…

Commutative Algebra · Mathematics 2014-03-07 Duong Quoc Viet , Truong Thi Hong Thanh

We prove that if $A$ is a subset of those primes which are congruent to $1 \pmod{3}$ such that the relative density of $A$ in this residue class is larger than $\frac{1}{2},$ then every sufficiently large odd integer $n$ which satisfies $n…

Number Theory · Mathematics 2025-09-30 Ali Alsetri

Let $p_{\{3, 3\}}(n)$ denote the number of $3$-regular partitions in three colours. In a very recent paper, da Silva and Sellers studied certain arithmetic properties of $p_{\{3, 3\}}(n)$. They further conjectured four Ramanujan-like…

Number Theory · Mathematics 2021-10-28 Ajit Singh , Rupam Barman