Related papers: Azar y Aritmetica
For a region $\Omega \subset\mathbb{C}$ denote by $\Psi(Q;\Omega)$ the number of complex algebraic numbers in $\Omega$ of degree $\leq n$ and naive height $\leq Q$. We show that $$…
The {\em Liouville function} is defined by $\gl(n):=(-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime divisors of $n$ counting multiplicity. Let $\z_m:=e^{2\pi i/m}$ be a primitive $m$--th root of unity. As a generalization of…
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
Bayesian probability theory is used to analyze the oft-made assumption that humans are typical observers in the universe. Some theoretical calculations make the {\it selection fallacy} that we are randomly chosen from a class of objects by…
Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…
We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…
In this article we study the arithmetic mean value $\Sigma(n)$ of the square roots of the first $n$ integers. For this quantity, we develop an asymptotic expression, and derive a formula for its integer part which has been conjectured…
We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…
Signal processing makes extensive use of point estimators and accompanying error bounds. These work well up until the likelihood function has two or more high peaks. When it is important for an estimator to remain reliable, it becomes…
The distribution functions of the matricvariate beta type I and II distributions are studied under real normed division algebras. The unified approach for real, complex, quaternions and octonions, also considers general properties and…
An a priori semimeasure (also known as "algorithmic probability" or "the Solomonoff prior" in the context of inductive inference) is defined as the transformation, by a given universal monotone Turing machine, of the uniform measure on the…
Our work is motivated by the fact that the norms of the Eulerian integers are related to the sums of form $a^2-ab+b^2$, providing a natural generalization for problems concerning products over sums or differences of integers. Let $E$ be the…
The emergent field of probabilistic numerics has thus far lacked clear statistical principals. This paper establishes Bayesian probabilistic numerical methods as those which can be cast as solutions to certain inverse problems within the…
An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…
This paper studies the interplay between probability, number theory, and geometry in the context of relatively prime integers in the ring of integers of a number field. In particular, probabilistic ideas are coupled together with integer…
The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…
The problem of assigning probabilities when little is known is analized in the case where the quanities of interest are physical observables, i.e. can be measured and their values expressed by numbers. It is pointed out that the assignment…
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not exhibit such capability. A geometric predicate usually…