Related papers: Euclid's Number-Theoretical Work
This is a textbook about elementary number theory, with emphasis on classical topics around the Euklidean Algorithm.
We examine Euclid's lemma that if $p$ is a prime number such that $p | ab$, then $p$ divides at least one of $a$ or $b$. Specifically, we consider the common misapplication of this lemma to numbers that are not prime, as is often made by…
Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
During a first St. Petersburg period Leonhard Euler, in his early twenties, became interested in the Basel problem: summing the series of inverse squares (posed by Pietro Mengoli in mid 17th century). In the words of Andre Weil (1989) "as…
The idea of the principle of nested intervals or the concept of convergent sequences which is equivalent to this idea dates back to the ancient world. Archimedes calculated the unknown in excess and deficiency, approximating with two sets…
The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
Discrete Euclidian Spaces (DESs) are the beginning of a journey without return towards the discretization of mathematics. Important mathematical concepts- such as the idea of number or the systems of numeration, whose formal definition is…
A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part is less than the whole' introduced by Ancient Greeks and applied to all…
An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…
Categorical logic has shown that modern logic is essentially the logic of subsets (or "subobjects"). Partitions are dual to subsets so there is a dual logic of partitions where a "distinction" [an ordered pair of distinct elements (u,u')…
We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
To account for the first proof of existence of an irrational magnitude, historians of science as well as commentators of Aristotle refer to the texts on the incommensurability of the diagonal in Prior Analytics, since they are the most…
This paper attributes the sudden emergence of mathematical probability and statistics in the second half of the seventeenth century to Calvin's Reformed theology. Calvin accommodated Epicurean chance with Stoic determinism and synthesised…
In 1686 in his Discours de Metaphysique, Leibniz points out that if an arbitrarily complex theory is permitted then the notion of "theory" becomes vacuous because there is always a theory. This idea is developed in the modern theory of…
In 1687 Isaac Newton published PHILOSOPHI\AE \ NATURALIS PRINCIPIA MATHEMATICA, where the classical analytic dynamics was formulated. But Newton also formulated a discrete dynamics, which is the central difference algorithm, known as the…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…