Papers
Topics
Authors
Recent
Search
2000 character limit reached

On second case of Strong Fermat's Last Theorem conjecture

Published 23 Apr 2013 in math.NT | (1304.6168v3)

Abstract: This article deals with a conjecture, introduced in GQ, which generalizes the second case of Fermat's Last Theorem: {\it Let $p>3$ be a prime. The diophantine equation $\frac{up+vp}{u+v}=w_1p$ with $u,v,u+v, w_1\in\Z\backslash{0}$, $u,v$ coprime and $v\equiv 0 \mod p$ has no solution.} Let $\zeta$ be a $p$th primitive root of unity and $K:=\Q(\zeta)$. A prime $q$ is said {\it $p$-principal} if the class of any prime ideal $\mathfrak q_K$ of $K$ over $q$ is a $p$-power of a class. Assume that $SFLT2$ fails for $(p,u,v)$. Let $q$ be any odd prime coprime with $puv$, $f$ the order of $q\mod p$, $n$ the order of $\frac{v}{u}\mod q$, $\xi$ a primitive $n$th root of unity, $\mathfrak q$ the prime ideal $(q,u\xi-v)$ of $\Q(\xi)$. In this complement of the article [GQ] revisiting some works of Vandiver, we prove that, if $q$ is {\it $p$-principal} and $n\not=2p$ then $$\Big(\frac{1+\xi\zetak}{1+\xi\zeta}\Big){(qf-1)/p}\equiv 1\mod \mathfrak q for k=1,\dots,p-1.$$ We shall derive, by example, of this congruence that, for $p$ sufficiently large, a very large number of primes should divide $v$. In an other hand we shall show that if $q$ is any prime of order $f\mod p$ dividing $(up+vp)$ then $$(1-\zeta){(qf-1)/p}\equiv p{-(qf-1)/p}\mod q, $$ and a result of same nature if $q$ divides $up-vp$, which reinforces strongly the first and second theorem of Furtw\"angler. The principle of proof relies on the $p$-Hilbert class field theory. Keywords: Fermat's Last Theorem; cyclotomic fields; cyclotomic units; class field theory; Vandiver's and Furtw\"angler's theorems

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.