相关论文: On Hardy's Apology Numbers
New Mersenne conjectures. The problems of simplicity, common prime divisors and free from squares of numbers $L(n) = 2^{2n}\pm2^n\pm1$ are investigated. Wonderful formulas $gcd $ for numbers $L (n) $ and numbers repunit are proved.
A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
A Hardy-Littlewood triple is a 3-tuple of integers with the form $(n, n+2, n+6)$. In this paper, we study Hardy-Littlewood triples of the form $(p, P_{a}, P_{b})$ and improve the upper and lower bound orders of it, where $p$ is a prime and…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
This paper addresses the actual practice of justifying definitions in mathematics. First, I introduce the main account of this issue, namely Lakatos's proof-generated definitions. Based on a case study of definitions of randomness in…
We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and the descriptive two-sorted general frames of Ten Cate. We…
Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…
The idea of writing a table of probabilistic data for a quantum or classical system, and of decomposing this table in a compact way, leads to a shortcut for Hardy's formalism, and gives new perspectives on foundational issues.
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…
In this paper, we introduce the concept of the (higher order) Appell-Carlitz numbers which unifies the definitions of several special numbers in positive characteristic, such as the Bernoulli-Carlitz numbers and the Cauchy-Carlitz…
We present complete classifications of Toeplitz + Hankel operators on vector-valued Hardy spaces and classify paired operators on $L^2(\mathbb{T})$. We also study the latter class through the lens of inner functions on the disc.
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
In 1917, G.H.Hardy and S.Ramanujan proved that the `typical' number of prime factors of a positive integer $n$ is approximately $\ln\ln n$. In this technical paper we proffer a complete exposition of this proof, and further provide novel…
In many combinatorial problems one may need to model the diversity or similarity of assignments in a solution. For example, one may wish to maximise or minimise the number of distinct values in a solution. To formulate problems of this…
In recent years, explainable machine learning methods have been very successful. Despite their success, most explainable machine learning methods are applied to black-box models without any domain knowledge. By incorporating domain…
The Hardy-Ramanujan formula for the number of integer partitions of $n$ is one of the most popular results in partition theory. While the unabridged final formula has been celebrated as reflecting the genius of its authors, it has become…
We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…