Related papers: Finding all squared integers expressible as the su…

We consider the negative polynomial Pell's equation $P^2(X)-D(X)Q^2(X)=-1$, where $D(X)\in \mathbb{Z}[X]$ be some fixed, monic, square-free, even degree polynomials. In this paper, we investigate the existence of polynomial solutions $P(X),…

For a positive integer $m>1$, if the generalized Markoff equation $a^2+b^2+c^2=3abc+m$ has a solution triple, then it has infinitely many solutions. We show that all positive solution triples are generated by a finite set of triples that we…

In any cubic polynomial, the average of the slopes at the $3$ roots is the negation of the slope at the average of the roots. In any quartic, the average of the slopes at the $4$ roots is twice the negation of the slope at the average of…

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

We consider the error term of the asymptotic formula for the number of pairs of $k$-free integers up to $x$. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to $r$-tuples of $k$-free…

Let $(P_n)_{n\ge 0}$ and $(Q_n )_{n\ge 0}$ be the Pell and Pell-Lucas sequences. Let $b$ be a positive integer such that $b\ge 2.$ In this paper, we prove that the following two Diophantine equations $P_{n}=b^{d}P_{m}+Q_{k}$ and…

We investigate the solvability of the Diophantine equation $x^2-my^2=\pm p$ in integers for certain integer $m$ and prime $p$. Then we apply these results to produce family of maximal real subfield of a cyclotomic field whose class number…

It is important in drawing techniques to find combinations of two straight lines and their angle bisectors whose slopes are all rational numbers. This problem is reduced to solving the Diophantine equation $(a-c)^2(b^2+1) = (b-c)^2(a^2+1).$…

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.

Any pair of consecutive B-smooth integers for a given smoothness bound B corresponds to a solution (x, y) of the equation x^2 - 2Dy^2 = 1 for a certain square-free, B-smooth integer D and a B-smooth integer y. This paper describes…

We study the distribution of squares in a Piatetski-Shapiro sequence $\left(\lfloor n^c\rfloor\right)_{n\in\mathbb N}$ with $c>1$ and $c\not\in\mathbb N$. We also study more general equations $\lfloor{n^c}\rfloor = sm^2$, $n,m\in \mathbb…

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Let $p$ be a prime number, $m$ be an even positive integer, and $\mathbb{F}_q$ be a finite field with $q = p^m$ elements. In this paper, we compute the number of solutions with all coordinates in $\mathbb{F}_q^*$ for diagonal equations of…