Related papers: A primitive normal pair with prescribed prenorm
Normal bases and self-dual normal bases over finite fields have been found to be very useful in many fast arithmetic computations. It is well-known that there exists a self-dual normal basis of $\mathbb{F}_{2^n}$ over $\mathbb{F}_2$ if and…
We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
Let $q$ be a power of $2$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. For a positive integer $n$, the polynomial $X^n-1\in\mathbb{F}_q[X]$ is called $3$-sparse over $\mathbb{F}_q$ if every monic irreducible factor of…
Given an odd prime $q$, a natural number $l$ and non-zero $q$-free integers $a_{1}, a_{2}, \ldots, a_{l}$, none of which are equal to $1$ or $-1$, we give necessary and sufficient conditions for the polynomial $\prod_{j=1}^{l} (x^{q} -…
Let $d>m>1$ be integers, let $c_1,\dots, c_{m+1}$ be distinct complex numbers, and let $\mathbf{f}(z):=z^d+t_1z^{m-1}+t_2z^{m-2}+\cdots + t_{m-1}z+t_m$ be an $m$-parameter family of polynomials. We prove that the set of $m$-tuples of…
We show that if the congruence above holds and $n\mid m$, then the quotient $Q:=m/n$ satisfies $\sum_{p\mid Q} \frac{Q}{p}+1 \equiv 0\pmod{Q}$, where $p$ is prime. The only known solutions of the latter congruence are $Q=1$ and the eight…
In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…
In this article we present a class of formulas Fn, n in Nat, that need at least 2^n assumptions to be proved in a normal proof in Natural Deduction for purely implicational minimal propositional logic. In purely implicational classical…
Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…
A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…
We give a necessary condition for the existence of solutions of the Diophantine equation $p=x^{q}+ry^{q},$ with $p$, $q$, $r$ distinct odd prime natural numbers.
We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…
Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such that every continuous map $f\colon \Sigma \to \mathbb{R}^d$ maps $q$ points from pairwise disjoint faces to the same point in…
We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…
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…
Let $\pi_{q,a}(x)$ denote the number of primes $\le x$ in the progression $a$ modulo $q$. We study subtle inequities in these functions, with $q$ fixed and variable $a$ (sometimes called 'prime race problems'). It is known unconditionally…
In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…
With $\Fq$ the finite field of $q$ elements, we investigate the following question. If $\gamma$ generates $\Fqn$ over $\Fq$ and $\beta$ is a non-zero element of $\Fqn$, is there always an $a \in \Fq$ such that $\beta(\gamma + a)$ is a…
Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…