Related papers: Simultaneous insolvability of exponential congruen…

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

The purpose of this paper is to establish the first and second order necessary conditions for stochastic optimal controls in infinite dimensions. The control system is governed by a stochastic evolution equation, in which both drift and…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

We produce new examples of totally imaginary infinite extensions of $\mathbb{Q}$ which have undecidable first-order theory by generalizing the methods used by Martinez-Ranero, Utreras and Videla for $\mathbb{Q}^{(2)}$. In particular, we use…

This work concerns Artin's Conjecture on primitive roots and related problems for number fields. Let $K$ be a number field and let $W_1$ to $W_n$ be finitely generated subgroups of $K^\times$ of positive rank. We consider the index map,…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

This paper presents four theorems that connect continuity postulates in mathematical economics to solvability axioms in mathematical psychology, and ranks them under alternative supplementary assumptions. Theorem 1 connects notions of…

The paper deals with controllability problem for a distributed system governed by the two-dimensional Gurtin-Pipkin equation. We consider a system with compactly supported distributed control and show that if the memory kernel is a twice…

We call a finite group irrational if none of its elements is conjugate to a distinct power of itself. We prove that those groups are solvable and describe certain classes of these groups, where the above property is only required for…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

In 1927, E. Artin conjectured that all non-square integers $a\neq -1$ are a primitive root of $\mathbb{F}_p$ for infinitely many primes $p$. In 1967, Hooley showed that this conjecture follows from the Generalized Riemann Hypothesis (GRH).…

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group $S_n$ which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same…

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…