Related papers: Simultaneous insolvability of exponential congruen…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

In 2002, M.Ram Murty showed that if p is a prime with k-adic expansion :$p = \sum_{i = 0}^n a_i k^i$ , then the polynomial $f(x) = \sum_{i = 0}^n a_ix^i$ is irreducible in $\mathbb{Z}[x]$.When $k = 10$ , it's a result of A.Cohn. I think…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

Motivated by tug-of-war games and asymptotic analysis of certain variational problems, we consider a gradient constraint problem involving the infinity Laplace operator. We prove that this problem always has a solution that is unique if a…

Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

The p-parity conjecture for twists of elliptic curves relates multiplicities of Artin representations in p-infinity Selmer groups to root numbers. In this paper we prove this conjecture for a class of such twists. For example, if E/Q is…

It is well known that the Bernoulli polynomials $\mathbf{B}_n(x)$ have nonintegral coefficients for $n \geq 1$. However, ten cases are known so far in which the derivative $\mathbf{B}'_n(x)$ has only integral coefficients. One may assume…

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

It is established that for every pair of additive forms $f=\sum_{i=1}^s a_i x_i^k, g=\sum_{i=1}^s b_i x_i^k$ of degree $k$ in $s>2k^2$ variables the equations $f=g=0$ have a non-trivial $p$-adic solution for all odd primes $p$.

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.

In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

We derive fundamentally new equations that are satisfied by first-order flexes of a flexible polyhedron. Moreover, we indicate two sources of such new equations. These sources are the Dehn invariants and rigidity matrix. The equations…

It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.

There studed correspondence between symplectic leaves, irreducible representations and prime ideals, which is invariant with respect to quantum adjoint action. The Conjecture of De Concini-Kac-Procesi on dimensions of irreducible…

Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…