Related papers: An $\tilde{O}(\log^2(N))$ time primality test for …

In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…

Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…

We modify Cheraghchi-Nakos [CN20] and Price-Scarlett's [PS20] fast binary splitting approach to nonadaptive group testing. We show that, to identify a uniformly random subset of $k$ infected persons among a population of $n$, it takes only…

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying…

Given a multiset $S$ of $n$ positive integers and a target integer $t$, the Subset Sum problem asks to determine whether there exists a subset of $S$ that sums up to $t$. The current best deterministic algorithm, by Koiliaris and Xu…

We prove that the sumset {p^2+b^2+2^n: p is prime and b,n\in N} has positive lower density. We also construct a residue class with odd modulo, which contains no integer of the form p^2+b^2+2^n. And similar results are established for the…

A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…

Let $\ell$ be any fixed prime number. We define the $\ell$-Genocchi numbers by $G_n:=\ell(1-\ell^n)B_n$, with $B_n$ the $n$-th Bernoulli number. They are integers. We introduce and study a variant of Kummer's notion of regularity of primes.…

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in the quantum and for their testing problem in the classical…

For a number field $k$ and an odd prime $p$, let $\tilde{k}$ be the compositum of all the ${\mathbb Z}_p$-extensions of $k$, $\tilde{\Lambda }$ the associated Iwasawa algebra, and $X(\tilde{k})$ the Galois group over $\tilde{k}$ of the…

Given an integer n>1, it is a classical Diophantine problem that whether n can be written as a sum of two rational cubes. The study of this problem, considering several special cases of n, has a copious history that can be traced back to…

We generalize results on the $p$-adic valuations of $S(n,k)$, the Stirling number of the second kind and $s(n,k)$ the Stirling number of the first kind. We have several new estimates for these valuations, along with criteria for when the…

We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…