The Simple Condition of Fermat Wiles Theorem Mainly Led by Combinatorics

Junya Sebata

The Simple Condition of Fermat Wiles Theorem Mainly Led by Combinatorics

This paper gives the simple and necessary condition of Fermat Wiles Theorem with mainly providing one method to analyze natural numbers and the formula X^n + Y^n = Z^n logically and geometrically, which is positioned in combinatorial design theory. The condition is gcd(X, E)^n = X − E ∧ gcd(Y, E)^n = Y − E in ¬(n | XY ), or gcd(X, E)^n/n = X − E ∧ gcd(Y, E)^n = Y − E in n | X ∧ ¬(n | Y ). Provided that E denotes E = X + Y − Z, n is a prime number equal to or more than 2, and X, Y, Z are coprime numbers.

Comments: 10 Pages. JP J. Algebra, Number Theory Appl. 51(1) (2021), 55 - 75.

Download: PDF

Submission history

[v1] 2021-01-12 02:15:29
[v2] 2021-02-08 01:45:04

Unique-IP document downloads: 243 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.