Related papers: Beal's Conjecture vs. "Positive Zero", Fight
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
We present two related conjectures, arising in work on i-matchings in random r-regular bipartite graphs. The conjectures themselves are easily stated and involve only basic properties of convergent power series. One formulation involves…
The aim of this expository article is twofold. The first is to introduce several polynomials of one variable as well as two variables defined on the positive integers with values as congruent numbers. The second is to present connections…
Counterfactual definiteness must be used as at least one of the postulates or axioms that are necessary to derive Bell-type inequalities. It is considered by many to be a postulate that is not only commensurate with classical physics (as…
While it is widely agreed that Bell's theorem is an important result in the foundations of quantum physics, there is much disagreement about what exactly Bell's theorem shows. It is agreed that Bell derived a contradiction with experimental…
In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
The example of the calculus is used to explain how simple, practical math was made enormously complex by imposing on it the Western religiously-colored notion of mathematics as "perfect". We describe a pedagogical experiment to make math…
A nonnegative martingale with initial value equal to one measures evidence against a probabilistic hypothesis. The inverse of its value at some stopping time can be interpreted as a Bayes factor. If we exaggerate the evidence by considering…
We consider a variant of the ABC Conjecture, attempting to count the number of solutions to $A+B+C=0$, in relatively prime integers $A,B,C$ each of absolute value less than $N$ with $r(A)<|A|^a, r(B)<|B|^b, r(C)<|C|^c.$ The ABC Conjecture…
Logical reasoning is essential in a variety of human activities. A representative example of a logical task is mathematics. Recent large-scale models trained on large datasets have been successful in various fields, but their reasoning…
The vivid contrast between two competing algorithms for solving Abel's equation $g(\theta(x)) = g(x) + 1$, given $\theta(x)$, is easily sketched. EJ is faster and more efficient, but ML evaluates a limit characterizing the principal…
Recent work in cognitive science has uncovered a diversity of explanatory values, or dimensions along which we judge explanations as better or worse. We propose a Bayesian account of how these values fit together to guide explanation. The…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…
We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…
Because of its relation to the distribution of prime numbers, the Riemann zeta function {\zeta} (s) is one of the most important functions in mathematics. The zeta function is defined by the following formula for any complex number s with…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…