Related papers: Primality Test for Numbers of the Form Ap^n+w
In this research paper, relationship between every Mersenne prime and certain Natural numbers is explored. We begin by proving that every Mersenne prime is of the form {4n + 3,for some integer 'n'} and generalize the result to all powers of…
Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…
Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…
A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…
The Ap\'ery numbers $A_n$ and central Delannoy numbers $D_n$ are defined by $$A_n=\sum_{k=0}^{n}{n+k\choose 2k}^2{2k\choose k}^2, \quad D_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}. $$ Motivated by some recent work of Z.-W. Sun, we prove…
Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…
Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…
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$;…
Recently, Andrews and Paule introduced a partition function $PDN1(N)$ which denotes the number of partition diamonds with $(n+1)$ copies of $n$ where summing the parts at the links gives $N$. They also presented the generating function for…
We study the PBW-filtration on the highest weight representations $V(\la)$ of the Lie algebras of type ${\tt A}_{n}$ and ${\tt C}_{n}$. This filtration is induced by the standard degree filtration on $\U(\fn^-)$. In previous papers, the…
The unconditional, i.e. without assuming validity of RH, sharp limit relationship (as p tends to infinity) is found between the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals and maximal values of…
We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} \chi (x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} \chi_1 (x)\chi_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for…
We obtain a first non-trivial estimate for the sum of dilates problem in the case of groups of prime order, by showing that if $t$ is an integer different from $0, 1$ or -1 and if $\A \subset \Zp$ is not too large (with respect to $p$),…
In this article we will show $2$ different proofs for the fact that there exist relatively prime positive integers $a,b$ such that: $a^2+ab+b^2=7^n$.
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some generalizations are considered.
A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to…
In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as…