English
Related papers

Related papers: Solvability of $\binom{2k}{k} = \binom{2a}{a} \bin…

200 papers

We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c <…

Number Theory · Mathematics 2009-04-14 Constantin M. Petridi

Given $k$ sets $\mathcal{A}_i \subseteq \mathbb{F}_q^d$ and a non-degenerate bilinear form $B$ in $\mathbb{F}_q^d$. We consider the system of $l \leq \binom{k}{2}$ bilinear equations \[ B (\tmmathbf{a}_i, \tmmathbf{a}_j) = \lambda_{i j},…

Combinatorics · Mathematics 2009-03-09 Le Anh Vinh

The non-zero integer solution set is derived for C^n = A^n + B^n. The non-zero integer solution set for n = 2 is [C - (a + b)]^2 = 2ab. The variables a and b equal (C - A) and (C - B) respectively and are nonzero integer factors of 2M^2…

General Mathematics · Mathematics 2012-02-27 Ernest R. Lucier

Inspired by the definition of balanced neighborly spheres, we define balanced neighborly polynomials and study the existence of these polynomials. The goal of this article is to construct balanced neighborly polynomials of type $(k,k,k,k)$…

Commutative Algebra · Mathematics 2022-05-03 Nguyen Thi Thanh Tam

Using the theory of Stienstra and Beukers, we prove various elementary congruences for the numbers \sum \binom{2i_1}{i_1}^2\binom{2i_2}{i_2}^2...\binom{2i_k}{i_k}^2, where k,n \in N, and the summation is over the integers i_1, i_2, ...i_k…

Number Theory · Mathematics 2013-01-16 Matija Kazalicki

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

Number Theory · Mathematics 2007-05-23 T. Narayaninsamy , D. -J. Mercier , J. -P. Cherdieu

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…

Number Theory · Mathematics 2018-09-25 Guo-Shuai Mao , Zhi-Wei Sun

In 2022, Z.-W. Sun defined \begin{equation*} w_k^{(\alpha)}{(x)}=\sum_{j=1}^{k}w(k,j)^{\alpha}x^{j-1}, \end{equation*} where $k,\alpha$ are positive integers and $w(k,j)=\frac{1}{j}\binom{k-1}{j-1}\binom{k+j}{j-1}$. Let $(x)_{0}=1$ and…

Number Theory · Mathematics 2025-07-08 Lin-Yue Li , Rong-Hua Wang

Take any $d + 3$ points in $\mathbb{R}^d$. It is known that (a) if $d = 2k + 1$, then there are two linked $(k + 1)$-simplices with the vertices at these points; (b) if $d = 2k$, then there are two disjoint $(k + 1)$-tuples of these points…

Combinatorics · Mathematics 2024-02-15 M. Starkov

If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of…

Number Theory · Mathematics 2011-06-29 Sophie Frisch

In this paper, we investigate the existence of Sierpi\'{n}ski numbers and Riesel numbers as binomial coefficients. We show that for any odd positive integer $r$, there exist infinitely many Sierpi\'{n}ski numbers and Riesel numbers of the…

An open conjecture of Erdos and Moser is that the only solution of the Diophantine equation in the title is the trivial solution 1+2=3. Reducing the equation modulo k and k^2, we give necessary and sufficient conditions on solutions to the…

Number Theory · Mathematics 2011-07-13 Jonathan Sondow , Kieren MacMillan

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Mei-Chu Chang

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

General Mathematics · Mathematics 2019-07-25 K. K. Kataria

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

Number Theory · Mathematics 2007-05-23 T. D. Browning

Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers…

Number Theory · Mathematics 2022-10-17 Noah Lebowitz-Lockard , Victor Souza

Let $p>3$ be a prime. For any $p$-adic integer $a$, we determine $$\sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k,\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k^{(2)},\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}k\frac{H_k^{(2)}}{2k+1}$$ modulo…

Number Theory · Mathematics 2024-01-11 Zhi-Wei Sun

We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.

Number Theory · Mathematics 2016-04-21 Lior Bary-Soroker , Gady Kozma

Let $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab-a-b$ there exist $x,y\in\mathbb{Z}_{\geq 0}$, such that $d=ax+by$. As a byproduct, we obtain a constructive recursive algorithm for…

Number Theory · Mathematics 2025-06-26 Giorgos Kapetanakis , Ioannis Rizos

Let $S(X,B)$ be a symmetric (``palindromic'') word in two letters $X$ and $B$. A theorem due to Hillar and Johnson states that for each pair of positive definite matrices $B$ and $P$, there is a positive definite solution $X$ to the word…

Operator Algebras · Mathematics 2007-05-23 Scott N. Armstrong , Christopher J. Hillar