Related papers: Azar y Aritmetica
This paper analyzes the emergence and distribution of potential twin primes, pairs of integers that are both relatively prime to the first n primes or to a given set M of primes, and which are the breeding grounds of true twin primes. It…
Until now, distributed algorithms for rational agents have assumed a-priori knowledge of $n$, the size of the network. This assumption is challenged here by proving how much a-priori knowledge is necessary for equilibrium in different…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
Within the Kolmogorov theory of probability, Bayes' rule allows one to perform statistical inference by relating conditional probabilities to unconditional probabilities. As we show here, however, there is a continuous set of alternative…
We introduce a framework uniting algorithmic randomness with exchangeable credences to address foundational questions in philosophy of probability and philosophy of science. To demonstrate its power, we show how one might use the framework…
In this paper, we will give some estimation for the average error of the prime number theorem.
We investigate the distribution of the function $\omega(n)$, the number of distinct prime divisors of $n$, in residue classes modulo $q$ for natural numbers $q$ greater than 2. In particular we ask `prime number races' style questions, as…
Ova-angular rotations of a prime number are characterized, constructed using the Dirichlet theorem. The geometric properties arising from this theory are analyzed and some applications are presented, including Goldbach's conjecture, the…
We consider a conception of reality that is the following: An object is 'real' if we know that if we would try to test whether this object is present, this test would give us the answer 'yes' with certainty. If we consider a conception of…
Combining distributions is an important issue in decision theory and Bayesian inference. Logarithmic pooling is a popular method to aggregate expert opinions by using a set of weights that reflect the reliability of each information source.…
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…
There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…
These are lecture notes written at the University of Zurich during spring 2014 and spring 2015. The first part of the notes gives an introduction to probability theory. It explains the notion of random events and random variables,…
Roots of random polynomials have been studied exclusively in both analysis and probability for a long time. A famous result by Ibragimov and Maslova, generalizing earlier fundamental works of Kac and Erdos-Offord, showed that the…
The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.
After making some general remarks, I consider two examples that illustrate the use of Bayesian Probability Theory. The first is a simple one, the physicist's favorite "toy," that provides a forum for a discussion of the key conceptual issue…
A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…
Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…
Teaching how to derive minimax decision rules can be challenging because of the lack of examples that are simple enough to be used in the classroom. Motivated by this challenge, we provide a new example that illustrates the use of standard…
Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…