English
Related papers

Related papers: For which p-adic integers x can Sum_k binomial(x,k…

200 papers

Let $p>5$ be a prime. We prove congruences modulo $p^{3-d}$ for sums of the general form $\sum_{k=0}^{(p-3)/2}\binom{2k}{k}t^k/(2k+1)^{d+1}$ and $\sum_{k=1}^{(p-1)/2}\binom{2k}{k}t^k/k^d$ with $d=0,1$. We also consider the special case…

Number Theory · Mathematics 2012-10-09 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood , Roberto Tauraso

The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n^{-1} or for some positive integer k, n^{-1/k}<< p(n)<< n^{-1/(k+1)} or for all epsilon >0, n^{- epsilon}<< p(n) and n^{-…

Logic · Mathematics 2009-09-25 Saharon Shelah , Joel Spencer

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let $p>3$ be a prime. We prove that…

Number Theory · Mathematics 2014-04-29 Zhi-Wei Sun

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

Let $p\geq 3$ be a prime number and $K$ be a quadratic imaginary field in which $p$ splits as $\mathfrak{p}\overline{\mathfrak{p}}$. Let $\mathcal{F}$ be a cuspidal Bianchi eigenform over $K$ of weight $(k,k)$, where $k\geq 0$ is an…

Number Theory · Mathematics 2025-12-11 Mihir Deo

Let $p$ be a prime number with $p\equiv 2\pmod{3}$ and let $n\ge 1$ be a dimension. It is known that a sum-free subset of ${\mathbb F}_p^n$ can have at most the size $\frac13(p+1)p^{n-1}$ and that, up to automorphisms of ${\mathbb F}_p^n$,…

Combinatorics · Mathematics 2024-08-29 Christian Reiher , Sofia Zotova

In the present paper, the fundamental aim is to consider a p-adic continuous function for an odd prime to inside a p-adic q-analogue of the higher order modified Dedekind-type sums related to q-Genocchi polynomials with weight alpha by…

General Mathematics · Mathematics 2013-10-03 Serkan Araci , Erdoğan Şen , Mehmet Acikgoz

A study of the set N_p of positive integers which occur as orders of nonsingular derivations of finite-dimensional non-nilpotent Lie algebras of characteristic p>0 was initiated by Shalev and continued by the present author. The main goal…

Rings and Algebras · Mathematics 2010-06-28 Sandro Mattarei

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

Number Theory · Mathematics 2016-09-06 Seth Dutter , Cole Love

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

Computational Complexity · Computer Science 2022-10-14 Alberto Dennunzio , Enrico Formenti , Luciano Margara

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

General Mathematics · Mathematics 2015-04-03 N. A. Carella

Let $f(x,y)=ax^2+bxy+cy^2$ be a binary quadratic form with integer coefficients. For a prime $p$ not dividing the discriminant of $f$, we say $f$ is completely $p$-primitive if for any non-zero integer $N$, the diophantine equation…

Number Theory · Mathematics 2017-09-08 Byeong-Kweon Oh , Hoseog Yu

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Ap\'ery numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For…

Number Theory · Mathematics 2016-07-20 Zhi-Wei Sun

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

Combinatorics · Mathematics 2010-01-13 Sandro Mattarei

In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…

Combinatorics · Mathematics 2016-07-05 Farid Bencherif , Rachid Boumahdi

In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we…

Number Theory · Mathematics 2014-10-21 Arturas Dubickas , Min Sha , Igor E. Shparlinski

Suppose that G is a finite group and x in G has prime order p > 3. Then x is contained in the solvable radical of G if (and only if) <x,x^g> is solvable for all g in G. If G is an almost simple group and x in G has prime order p > 3 then…

Group Theory · Mathematics 2009-02-11 Simon Guest

Let F be a finite extension of Q_p. We show that every Schwartz function on F, with values in an algebraic closure of Q_p, is the uniform limit of a sequence of Schwartz functions, whose Fourier transforms tend uniformly to 0. The proof…

Number Theory · Mathematics 2016-07-14 Amit Ophir , Ehud de Shalit