Related papers: Powerful numbers and the ABC-conjecture
A new version of a strong law of large numbers for a ``good'' pairwise independent sequence of random variables (r.v.'s) with a small part of ``bad'' dependent r.v.'s is proposed. The main goal is to relax the assumption on the existence of…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a)=ab$, $\sigma(b)=ac$, $\sigma(c)=a$. The prefix of $\mathbb{T}$ of length $n$ is denoted by $\mathbb{T}[1,n]$. The main result is threefold, we give: (1)…
In this paper we consider integers in base 10 like $abc$, where $a$, $b$, $c$ are digits of the integer, such that $abc^2 - (abc \cdot cba) \; = \; \pm n^2$, where $n$ is a positive integer, as well as equations $abc^2 - (abc \cdot cba) \;…
We establish supercongruences for two kinds of Ap\'ery-like numbers, which involve Bernoulli numbers and Bernoulli polynomials. Conjectural supercongruences of the same type for another four kinds of Ap\'ery-like numbers are also proposed.
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop…
For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…
In this paper, a new criterion is given to determine the $p-$rationality of some complex cubic number fields in terms of $ p-$divisibility of certain terms of a third-order recurrence sequence, several illustrated examples are…
In this article the idea of random variables over the set theoretic universe is investigated. We explore what it can mean for a random set to have a specific probability of belonging to an antecedently given class of sets.
This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…
In this short note we confirm the relation between the generalized $abc$-conjecture and the $p$-rationality of number fields. Namely, we prove that given K$/\mathbb{Q}$ a real quadratic extension or an imaginary $S_3$-extension, if the…
The goal of this paper is to explore the basic Approximate Bayesian Computation (ABC) algorithm via the lens of information theory. ABC is a widely used algorithm in cases where the likelihood of the data is hard to work with or…
In this paper, we introduce the quantitative coarse Baum-Connes conjecture with coefficients (or QCBC, for short) for proper metric spaces which refines the coarse Baum-Connes conjecture. And we prove that QCBC is derived by the coarse…
Approximate Bayesian computation (ABC) is a widely used inference method in Bayesian statistics to bypass the point-wise computation of the likelihood. In this paper we develop theoretical bounds for the distance between the statistics used…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…