Related papers: An extension of Boyd's $p$-adic algorithm for the …

Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorithm is guaranteed to obtain near-optimal solutions. In this…

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

In this paper we have discussed convergence of power series both in p-adic norm as well as real norm. We have investigated rational summability of power series with respect to both p-adic norm and real norm under certain conditions. Then we…

For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…

Let $m$ and $n>0$ be integers. Suppose that $p$ is a prime dividing $m-4$ but not dividing $m$. We show that $\nu_p(\sum_{k=0}^{n-1}\frac{\binom{2k}k}{m^k})$ and $\nu_p(\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^k\frac{\binom{2k}k}{m^k})$ are at…

By applying p-adic integral on the set of p-adic integers in [27] (Interpolation Functions for New Classes Special Numbers and Polynomials via Applications of p-adic Integrals and Derivative Operator, Montes Taurus J. Pure Appl. Math. 3…

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

We consider a class of random matching problems where the distance between two points has a probability law which, for a small distance l, goes like l^r. In the framework of the cavity method, in the limit of an infinite number of points,…

Given a squarefree positive integer $d$, we want to find integers (or rational numbers with denominators not divisible by large primes) $a_0,a_1,a_2,\ldots$ such that for sufficiently large primes $p$ we have $\sum_{k=0}^{p-1}a_k\equiv…

Given a prime $p$, an integer $H\in[1,p)$, and an arbitrary set $\cal M\subseteq \mathbb F_p^*$, where $\mathbb F_p$ is the finite field with $p$ elements, let $J(H,\cal M)$ denote the number of solutions to the congruence $$ xm\equiv…

We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples…

We study p-adic counterparts of stable distributions, that is limit distributions for sequences of normalized sums of independent identically distributed p-adic-valued random variables. In contrast to the classical case, non-degenerate…

We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…

We shall study three subjects of the Jacobi-Perron Algorithm of dimension 2. First, we study the "ideal convergence". About the approximations (p_n/r_n, q_n/r_n) to (A, B) (where A and B are positive real numbers, r_n, p_n and q_n are…

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Using an identity arising in the known Banach probability problem on matchboxes, we prove an unexpected congruence for odd prime $p:$ for $1\leq k\leq \frac{p-1}{2},\enskip \sum_{i=1}^{p-2k-1}2^{i-1}\binom{k-1+i}{k}\equiv 0\pmod p.$

Suppose that $y>0$, $0\leq\alpha<2\pi$, and $0<K<1$. Let $P^+$ be the set of primes $p$ such that $\cos(y\ln p+\alpha)>K$ and $P^-$ the set of primes $p$ such that $\cos(y\ln p+\alpha)<-K$. In this paper, we prove $\sum_{p\in…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

The decimal expansion of 1/7 is 0.142857142857..., the block 142857 repeating forever. We call 142857 the period and its length is 6 = 2x3. If the period is broken into 2 pieces each of length 3 which are then added, the result is 142 + 857…

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…