Related papers: Completely $p$-primitive binary quadratic forms

The sufficient conditions for insolvability of the Diophantine equation $\sum_{i=1}^{m}x_i^{n}=bc^{n}$ ($n, m \geq 2$, $b, c\in \mathbb{N}$) in nonnegative integers are obtained for the case where the canonical decomposition of the number…

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…

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

We prove that any prime $p$ satisfying $\phi(p-1)\leq (p-1)/4$ contains two consecutive quadratic non-residues modulo $p$ neither of which is a primitive root modulo $p$.

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…

Let $q$ be an even prime power and $m\geq2$ an integer. By $\mathbb{F}_q$, we denote the finite field of order $q$ and by $\mathbb{F}_{q^m}$ its extension degree $m$. In this paper we investigate the existence of a primitive normal pair…

We study the ``imaginary" binary quadratic form equations ax^2+bxy+cy^2+g=0 over k[t] in rational function fields, showing that a condition with respect to the Artin reciprocity map, is the only obstruction to the local-global principle for…

For two relatively prime positive integers $a, b\in \mathbb{N}$, it is known that exactly one of the two Diophantine equations $$ax + by \ =\ \frac{(a-1)(b-1)}{2}\ \mbox{ and }\ 1 + ax + by \ =\ \frac{(a-1)(b-1)}{2}$$ has a nonnegative…

For $p$ and $q$ any two distinct Fermat or Mersenne primes, $m,n,r$ as positive integers and $\mu = \pm 1$ satisfying any diophantine relation, $\mbox{(i)}\; 2^m + \mu = p^nq^r, \mbox{(ii)} \; 2^mp^n + \mu = q^r \mbox{ or } \mbox{(iii)} \;…

Let $\mathcal{A}$ be an alphabet of size $n\ge 2$. In this paper, we give a complete description of primitive words $p\neq q$ over an alphabet $\mathcal{A}$ of size $n\geq2$ such that $pq$ is non-primitive and $|p|=2|q|$. In particular, if…

A solution $(x,y,z) \in \mathbb{Z}^3-\{(0,0,0)\}$ to a generalized Fermat equation \[ Ax^a + By^b + Cz^c = 0, \] is called \emph{primitive} if $\gcd(x,y,z) = 1$. By work of Beukers, we know that in the \emph{spherical} regime (that is, when…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

For two relatively prime square-free positive integers $a$ and $b$, we study integers of the form $a p+b P_{2}$ and give a new lower bound for the number of such representations, where $a p$ and $b P_{2}$ are both square-free, $p$ denote a…

Let f(n)= Sum binomial(n,k)^(-1). First, we show that f:N to Q_p is nowhere continuous in the p-adic topology. If x is a p-adic integer, we say that f(x) is p-definable if lim f(x_j) exists in Q_p, where x_j denotes the jth partial sum for…

Even though four theorems are actually proved in this paper, two are the main ones,Teorems 1 and 3. In Theorem 1 we show that if a and be are odd squarefree positive integers satisfying certain quadratic residue conditions; then there…

Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions

In this paper, using a basic algebraic approach, we demonstrate that, if the integers $x,y$ and $z$ are pairwise relatively prime, and $x^p-my^p=zw$ where $m$ is an integer and $p$ is a prime, then we can write $x,y,m,z$ and $w$ as explicit…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…