Related papers: Finding the Fermat point via analysis

Computing mountain passes is a standard way of finding critical points. We describe a numerical method for finding critical points that is convergent in the nonsmooth case and locally superlinearly convergent in the smooth finite…

This paper presents in detail the originally developed Quadratic Point Estimate Method (QPEM), aimed at efficiently and accurately computing the first four output moments of probabilistic distributions, using 2n^2+1 sample (or sigma)…

In this paper, we propose Hermite collocation method for solving Thomas-Fermi equation that is nonlinear ordinary differential equation on semi-infinite interval. This method reduces the solution of this problem to the solution of a system…

In a metric space, the Fermat-Weber points of a sample are statistics to measure the central tendency of the sample and it is well-known that the Fermat-Weber point of a sample is not necessarily unique in the metric space. We investigate…

Let $K$ be a totally real number field. For all prime number $p\geq 5$, let us denote by $F_p$ the Fermat curve of equation $x^p+y^p+z^p=0$. Under the assumption that $2$ is totally ramified in $K$, we establish some results about the set…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

In the present paper we study, in a mathematically non-formal way, the validity of the Fermat's Last Theorem (FLT) by generalizing the usual procedure of extracting the square root of non convenient objects initially introduced by P. A. M.…

Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…

We apply a recently obtained three critical points theorem of B. Ricceri to prove the existence of at least three solutions of certain two-parameters Dirichlet problems defined on the Sierpinski gasket. We also show the existence of at…

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…

We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.

Let F be a totally real number field of odd degree. We prove several purely local criteria for the asymptotic Fermat's Last Theorem to hold over F, and also for the non-existence of solutions to the unit equation over F. For example, if 2…

We take the perspective of an advanced high school student trying to understand the proof of Fermat's Last Theorem for the first time. We collect definitions and statements needed to summarise how Fermat's Last Theorem was first proved in…

We explicitly compute the least degree of generators of all symbolic powers of the defining ideal of Fermat-like configuration of lines in $\mathbb{P}^3_\mathbb{C}$, except for the second symbolic powers, where we provide bounds for them.…

The recently developed proof of Fermat's Last Theorem is very lengthy and difficult, so much so as to be beyond all but a small body of specialists. While certainly of value in the developments that resulted, that proof could not be, nor…

For a real valued function, a point is critical if its derivatives are zero, and a critical point is a saddle point if it is not a local extrema. In this paper, we study algorithms to find saddle points of general Morse index. Our approach…

The Fermat principle is advocated to be a convenient tool to analyze the light propagation in a curved space time. It is shown that in the weak deflection regime the light ray trajectories can be systematically described by applying the…

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

A elementary proof of Fermat"s Last Theorem[1] is presented for the case of even exponents n=2q, where q is any integer, including 2. For even exponents, the proof of the theorem reduces to showing that solutions of the Pythagorean equation…