Related papers: It is not "B\'ezout's identity"
We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to those of Euclid, in a language closely related to that used in Tarski's formal…
We discuss parabolic versions of Euler's identity e^{it}=cos t + i sin t. A purely algebraic approach based on dual numbers is known to produce a very trivial relation e^{pt} = 1+pt. Therefore we use a geometric setup of parabolic rotations…
The suggestion that particles of the same kind may be indistinguishable in a fundamental sense, even so that challenges to traditional notions of individuality and identity may arise, has first come up in the context of classical…
A famous conjecture of Littlewood (c. 1930) concerns approximating two real numbers by rationals of the same denominator, multiplying the errors. In a lesser-known paper, Wang and Yu (1981) established an asymptotic formula for the number…
By using Cauchy's formula, it is known that Bernoulli numbers and Euler numbers can be represented by the contour integrals \begin{equation*} \begin{aligned} B_n&=\frac{n!}{2\pi i}\oint \frac{z}{e^z-1}\frac{d…
In 1953 LeVeque proved the existence of $U_m$-numbers by showing that for some specially defined Liouville number $\lambda$, the $m$th root $\lambda^{1/m}$ is in $U_m$. In this article we study the following question: let $u$ be an…
We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of $a+b=c$ implies that there exist infinitely many primes. In particular, for small exponents such as $n=3$ or $4$ this gives a new proof of…
In a first article (referred here as B-O), we studied the first part of the so-called 'mathematical part' of Plato's Theaetetus, i.e. Theodorus' lesson. In the present one, we consider the sequel and the end of the passage (147d7-148b2), as…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
Let $B_{n}$ denote the Bernoulli numbers, and $S(n,k)$ denote the Stirling numbers of the second kind. We prove the following identity $$ B_{m+n}=\sum_{\substack{0\leq k \leq n \\ 0\leq l \leq m}}\frac{(-1)^{k+l}\,k!\, l!\,…
We give an algebraic identity for cubic polynomials which generalizes Brahmagupta's identity and facilitates arithmetic in cubic fields. We also pose a question about a relationship between the elements of a cubic field of fixed trace and…
A classical problem due to Abel is to determine if a differential equation $y'=\eta y$ admits a non-trivial solution $y$ algebraic over $\mathbb C(x)$ when $\eta$ is a given algebraic function over $\mathbb C(x)$. Risch designed an…
There are (at least) four ways that an agent can acquire information concerning the state of the universe: via observation, control, prediction, or via retrodiction, i.e., memory. Each of these four ways of acquiring information seems to…
Identical systems, or entities, are indistinguishable in quantum mechanics (QM), and the symmetrization postulate rules the possible statistical distributions of a large number of identical quantum entities. However, a thorough analysis on…
Experiments may not reveal their full import at the time that they are performed. The scientists who perform them usually are testing a specific hypothesis and quite often have specific expectations limiting the possible inferences that can…
According to Cantor, a set is a collection into a whole of defined and separate (we shall say distinct) objects. So, a natural question is ``How to treat as `sets' collections of indistinguishable objects?". This is the aim of quasi-set…
Given a general multiset $\mathcal{M}=\{1^{m_1},2^{m_2},\ldots,n^{m_n}\}$, where $i$ appears $m_i$ times, a multipermutation $\pi$ of $\mathcal{M}$ is called {\em quasi-Stirling}, if it contains no subword of the form $abab$ with $a\neq b$.…
The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence…