Related papers: Simultaneous insolvability of exponential congruen…
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for $\SI 1$, the…
We find a criterion for correct solvability in L_p(R) of a linear differential equation of a first order with non-negative locally integrated coefficient and study the asymptotic properties of its solutions.
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
We prove the a priori bounds for infinitely renormalizable quadratic polynomials for which we can find an infinite sequence of primitive renormalizations such that the ratios of the periods of successive renormalizations is bounded. This…
Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac p{k+b}\pmod {p^2}$. For $n=0,1,2,\ldots$ let $D_n$ and $b_n$ be Domb…
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
Let $B$ be a bounded self-adjoint operator and let $A$ be a nonnegative self-adjoint unbounded operator. It is shown that if $BA$ is normal, it must be self-adjoint and so must be $AB$. Commutativity is necessary and sufficient for this…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…
It has been a well-known fact since Euclid's time that there exist infinitely many rational primes. Two natural questions arise: In which other rings, sufficiently similar to the integers, are there infinitely many irreducible elements? Is…
We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…
We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig…
Let $D$ be a Dedekind domain. Roughly speaking, a simultaneous $\mathfrak{p}$-ordering is a sequence of elements from $D$ which is equidistributed modulo every power of every prime ideal in $D$ as well as possible. Bhargava asked which…
Artin's Conjecture on Primitive Roots states that a non-square nonunit integer $a$ is a primitive root modulo $p$ for the positive proportion of $p$. This conjecture remains open, but on average, there are many results due to P. J.…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…