On incompatibility of a nonlinear equations over set of natural numbers
Satisfaction problem of equation x m + y m = z m over set of positive natural numbers, where m and z are prime is consider. General case of this equation, is called “big” Fermata’s theorem, has been decided by using very complexity methods [1, 2]. In this paper is presented local result using by ele...
Saved in:
| Date: | 2015 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PROBLEMS IN PROGRAMMING
2015
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/18 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | Satisfaction problem of equation x m + y m = z m over set of positive natural numbers, where m and z are prime is consider. General case of this equation, is called “big” Fermata’s theorem, has been decided by using very complexity methods [1, 2]. In this paper is presented local result using by elementary methods. |
|---|