Related papers: An algorithmic proof of Bachet's conjecture and th…
The authors propose and analyze a well-posed numerical scheme for a type of ill-posed elliptic Cauchy problem by using a constrained minimization approach combined with the weak Galerkin finite element method. The resulting Euler-Lagrange…
Based on an apparently new Lagrange-type identity, a Cauchy--Schwarz-type inequality is proved. The mentioned identity is obtained by using certain ``macro'' variables; it is hoped that such a method can be used to prove or produce other…
The purpose of this paper is to make an introduction to univalent function theory for readers of any level, assuming only foundational knowledge in real and complex analysis. In particular, we state and proof (with details) important…
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or normalization theorems. In this paper we…
This expository article on the Lagrange singular integral contains two novelties. The first novelty involves a connection between the Lagrange singular integral for a simplified Clairaut equation, and Euler's homogeneous function theorem.…
This paper introduces and investigates degenerate versions of the A-algorithm and B-algorithm by incorporating a parameter lambda into their respective recurrence relations. We derive explicit formulas for the final sequences of these…
This paper provides a quite simple method of Tonelli's calculus of variations with positive definite and superlinear Lagrangians. The result complements the classical literature of calculus of variations before Tonelli's modern approach.…
In this short position paper we briefly review the development history of automated inductive theorem proving and computer-assisted mathematical induction. We think that the current low expectations on progress in this field result from a…
In \cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\mathbb{F}_{p^n}$ in time polynomial in $p$ and $n$. Shortly…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
This article proposes a new numerical algorithm for second order elliptic equations in non-divergence form. The new method is based on a discrete weak Hessian operator locally constructed by following the weak Galerkin strategy. The…
We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.
We present an astonishingly simple and elegant proof of the celebrated Basel problem.
Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…
There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy…
Collatz Conjecture (also known as Ulam's conjecture and 3x+1 problem) concerns the behavior of the iterates of a particular function on natural numbers. A number of generalizations of the conjecture have been subjected to extensive study.…
This paper presents an algorithmic method that, given a positive integer $j$, generates the $j$-th convergence stair containing all natural numbers from where the Collatz conjecture holds by exactly $j$ applications of the Collatz function.…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
The paper proposes a new algorithm for solving global univariate optimization problems. The algorithm does not require convexity of the target function. For a broad variety of target functions after performing (if necessary) several…
Backtracking search is a powerful algorithmic paradigm that can be used to solve many problems. It is in a certain sense the dual of variable elimination; but on many problems, e.g., SAT, it is vastly superior to variable elimination in…