novaBBS - sci.math - Re: Why actually Polynomials are basically Diophantine equations?

Re: Why actually Polynomials are basically Diophantine equations?

<a6aaf727-9369-4422-a94d-2199f166f406n@googlegroups.com>

https://www.novabbs.com/tech/article-flat.php?id=146726&group=sci.math#146726

X-Received: by 2002:a05:620a:45a9:b0:76f:2990:2d72 with SMTP id bp41-20020a05620a45a900b0076f29902d72mr14149qkb.15.1693419202323;
Wed, 30 Aug 2023 11:13:22 -0700 (PDT)
X-Received: by 2002:a05:6808:1599:b0:3a4:24bc:125f with SMTP id
t25-20020a056808159900b003a424bc125fmr191261oiw.1.1693419202099; Wed, 30 Aug
2023 11:13:22 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Wed, 30 Aug 2023 11:13:21 -0700 (PDT)
In-Reply-To: <138492381.126974.1492870545853.JavaMail.root@sodium.mathforum.org>
Injection-Info: google-groups.googlegroups.com; posting-host=91.186.232.17; posting-account=WJi6EQoAAADOKYQDqLrSgadtdMk3xQwo
NNTP-Posting-Host: 91.186.232.17
References: <138492381.126974.1492870545853.JavaMail.root@sodium.mathforum.org>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <a6aaf727-9369-4422-a94d-2199f166f406n@googlegroups.com>
Subject: Re: Why actually Polynomials are basically Diophantine equations?
From: b.karzed...@yahoo.com (bassam karzeddin)
Injection-Date: Wed, 30 Aug 2023 18:13:22 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 2126

by: bassam karzeddin - Wed, 30 Aug 2023 18:13 UTC

On Saturday, April 22, 2017 at 5:20:05 PM UTC+3, bassam king karzeddin wrote:
> It is not so hard to recognize this simple truth for a given Polynomial of (nth) degree, and becomes easily clearer if the given polynomial of odd degree, where then it is more than trivial case even first by trial and error to substitute a rational number or generally a constructible number in its simple form, for a solution as (n/m), for some nonzero integer (n),
>
> And if your solution requires both your integers (n and m) to be each with infinite sequence of digits, then your solution actually either a constructible number or an approximate solution that actually does not exist for that polynomial or that same Diophantine equation
>
> Regards
> Bassam King Karzeddin
> 22th, April, 2017
You must well understand this basic issue

Bkk 🔊

May all your PUSHes be POPped.

tech / sci.math / Re: Why actually Polynomials are basically Diophantine equations?

Subject	Author
Re: Why actually Polynomials are basically Diophantine equations?	bassam karzeddin