Related papers: A binary additive equation involving fractional po…

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.

The binary sum-of-digits function $s$ counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer $t$, T.~W.~Cusick defined the asymptotic density $c_t$ of integers $n\geq 0$ such that…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

Heath-Brown proved that for a positive proportion of integers $n$, $n^3+2$ has a prime factor larger than $n^{1+c}$ with $c=10^{-303}$. We generalize this result to arbitrary monic irreducible cubic polynomial of $\mathbb{Z}[x]$ with $c$…

Quadratic functions have applications in cryptography. In this paper, we investigate the modular quadratic equation $$ ax^2+bx+c=0 \quad (mod \,\, 2^n), $$ and provide a complete analysis of it. More precisely, we determine when this…

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

Let $a$, $b$, $c$ be distinct primes with $a<b$. Let $S(a,b,c)$ denote the number of positive integer solutions $(x,y,z)$ of the equation $a^x + b^y = c^z$. In a previous paper \cite{LeSt} it was shown that if $(a,b,c)$ is a triple of…

Consider the interval of integers $I_{m,n} = \{m, m+1, m+2,\ldots, m+n-1 \}$. For fixed integers $h,k,m$, and $c$, let $\Phi_{h,k,m}^{(c)}(n)$ denote the number of solutions of the equation $(a_1+\cdots + a_h)- (a_{h+1} + \cdots +…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

In this short note we prove a result that is an extension of an old Olympiad problem and is a very simple variant of the question of finding an approximation for $k$, where it is a nonzero constant and it satisfies the equation $a^k+b^k=c$,…

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

In this paper we consider estimating the number of solutions to multiplicative equations in finite fields when the variables run through certain sets with high additive structure. In particular, we consider estimating the multiplicative…

Let $p>3$ be a prime, $a_1,a_2,a_3\in\Bbb Z$ and let $N_p(x^3+a_1x^2+a_2x+a_3)$ denote the number of solutions to the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$. In this paper, we give an explicit criterion for…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

We consider cubic forms $\phi_{a,b}(x,y,z) = ax^3 + by^3 - z^3$ with coefficients $a,b \in \mathbb{Z}$. We give an asymptotic formula for how many of these forms are locally soluble everywhere, i.e. we give an asymptotic formula for the…

We classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…

A unified approach to the construction of weighing matrices and certain symmetric designs is presented. Assuming the weight $p$ in a weighing matrix $W(n,p)$ is a prime power, it is shown that there is a…