Search arXivSearch

arXiv · 2407.19230

Distribution and congruences of $(u,v)$-regular bipartitions

Abstract

Let $B_{u,v}(n)$ denote the number of $(u,v)$-regular bipartitions of $n$. In this article, we prove that $B_{p,m}(n)$ is always almost divisible by $p,$ where $p\geq 5$ is a prime number and $m=p_1^{α_1} p_2^{α_2}\cdots p_r^{α_r}, $ where $α_i \geq 0$ and $p_i \geq 5$ be distinct primes with $\gcd(p,m)=1$ . Further, we obtain an infinities families of congruences modulo $3$ for $B_{3,7}(n),$ $B_{3,5}(n)$ and $B_{3,2}(n)$ by using Hecke eigenform theory and a result of Newman \cite{Newmann1959}. Furthermore, we get many infinite families of congruences modulo $7$, $11$ and $13$ respectively for $B_{2,7}(n)$, $B_{2,11}(n)$ and $B_{2,13}(n),$ by employing an identity of Newman \cite{Newmann1959}. In addition, we prove infinite families of congruences modulo $2$ for $B_{4,3}(n)$, $B_{8,3}(n)$ and $B_{4,5}(n)$ by applying another result of Newman \cite{Newmann1962}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nabin Kumar Meher. 2024-07-27. Distribution and congruences of $(u,v)$-regular bipartitions. https://arxiv.org/abs/2407.19230

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT