Some remarks on nmax(k) Diophantine n-gons
Abstract
In this article one of the fundamental problems of Diophantine (integer) planar geometric figures, the Task max n(k), is considered.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.