Related papers: Is it possible to compute the Moebius function wit…
We first show a deterministic algorithm for taking $r$-th roots over $\F_q$ without being given any $r$-th nonresidue, where $\F_q$ is a finite field with $q$ elements and $r$ is a small prime such that $r^2$ divides of $q-1$. As…
We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.
The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…
The Frobenius number for a set of relatively prime positive integers, where the smallest integer in the set is at least 2, is the largest integer that cannot be expressed as a nonnegative linear combination of those integers. We analyze the…
Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
We show that the universal theory of the hyperfinite II$_1$ factor is not computable. The proof uses the recent result that MIP*=RE. Combined with an earlier observation of the authors, this yields a proof that the Connes Embedding Problem…
In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also…
In this article, we factor the composite $4n^2 +1$ using Fermat's factorization method. Consequently, we characterized all proper factors of composite $4n^2 +1$ in terms of its form. Furthermore, the composite Fermat's number is considered…
We make an analytical proof for Lehmer's totient conjecture. Lehmer conjectured that there is no solution for the congruence equation $n-1\equiv 0~(mod~\phi(n))$ with composite integers,$n$, where $\phi(n)$ denotes Euler's totient function.…
This short note gives a positive answer to an old question in elementary probability theory that arose in Furstenberg's seminal article "Disjointness in Ergodic Theory." As a consequence, Furstenberg's filtering theorem holds without any…
We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…
Two elementary formulae for Mertens function $M(n)$ are obtained. With these formulae, $M(n)$ can be calculated directly and simply, which can be easily implemented by computer. $M (1) \sim M (2 \times 10^7) $ are calculated one by one.…
In this paper, we firstly give the definition of meromorphic function element and algebroid mapping. We also construct the algebroid function family in which the arithmetic, differential operations is closed. On basis of these works, we…
Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients…
Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…
The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…