2020
DOI: 10.3906/mat-1911-88
|View full text |Cite
|
Sign up to set email alerts
|

On ternary Diophantine equations of signature(p,p,2)over number fields

Abstract: Let K be a totally real number field with narrow class number one and OK be its ring of integers. We prove that there is a constant BK depending only on K such that for any prime exponent p > BK the Fermat type equation x p + y p = z 2 with x, y, z ∈ OK does not have certain type of solutions. Our main tools in the proof are modularity, level lowering, and image of inertia comparisons.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(21 citation statements)
references
References 51 publications
0
20
1
Order By: Relevance
“…Also, recently in [30] and [31] T , urcas , studied Fermat equation over imaginary quadratic field Q( √ −d) with class number one. We now present a result by Işik, Kara and Ozman, proved in [16] which serves as the starting point of this paper. It gives a computable criteria of testing if the asymptotic Fermat Last Theorem holds for certain type of solutions of the equations with signatures (p, p, 2).…”
Section: Historical Backgroundmentioning
confidence: 93%
See 3 more Smart Citations
“…Also, recently in [30] and [31] T , urcas , studied Fermat equation over imaginary quadratic field Q( √ −d) with class number one. We now present a result by Işik, Kara and Ozman, proved in [16] which serves as the starting point of this paper. It gives a computable criteria of testing if the asymptotic Fermat Last Theorem holds for certain type of solutions of the equations with signatures (p, p, 2).…”
Section: Historical Backgroundmentioning
confidence: 93%
“…In [16], Işik, Kara and Ozman list all known cases where equation (1) has been solved over the rational integers in two tables (p.4). Table 1 contains all unconditional results for infinitely many primes.…”
Section: Historical Backgroundmentioning
confidence: 99%
See 2 more Smart Citations
“…In [18] we used the -unit equation method and this restricted us to the totally real number fields. However using Theorem 4.1 as we did for proving Theorem 1.…”
Section: Proof Of the Theorem 11mentioning
confidence: 99%