Faithful Decomposition of Rationals
Abstract
If an irreducible fraction mn>0 can be decomposed into the sum of several irreducible proper fractions with different denominators, and the positive number smaller than mn in fractional ideal 1n Z can not be obtained by replacing some numerator with smaller non-negative integers, then the decomposition is said to be faithful. For t∈ Z, we prove that the length of faithful decomposition of an irreducible fraction mn with 2 t mn<t+1 is at least t+2. In addition, we show a faithful decomposition of rationals consisting only of unit fractions except for one term. And we write 4n as a faithful decomposition with three fractions at most one non-unit fraction.
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.