Analysis of Generalization of a Problem of Vieta’s Descend Method with Examples and Computing Support
Asian Research Journal of Mathematics · pp. 65–76 · Published 7 Sep 2022
10.9734/arjom/2022/v18i1130426Abstract
Let and be fixed integer numbers. Assume that (a2+b2+c) is divisible by (ab+d) for some natural numbers a and b. Then the value of the fraction $$k ( = {(a^2+b^2+c) \over (ab+d)})$$ remains the same. Statement of this kind will be proved in pp. 1-3 and illustrated on some examples in pp. 3-10. The general method of proofs will be unified and simplified. Computing support will be provided: in pages 11-19 a simple program code is defined with the help of which one can hunt for natural numbers a, b with the same integer values of c, d and k. Here, a number of examples are given as well.
Cited by 0
No indexed citations yet.
Related research
- Finding Remainder on Dividing Numbers — shares topic coverage
Article metrics
Real usage data collected on this platform.
19
Page views
0
PDF downloads
2
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.