{"id":"d80341da-4bc0-4c84-94d4-f44ca276dee4","arxiv_id":"2507.04521","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every real number is a sum of two numbers whose continued fraction partial quotients tend to infinity.","lead":"The paper proves that any real number is the sum of two real numbers whose continued fraction digits grow without bound. It resolves an open question in number theory and includes explicit growth estimates for the construction.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: Theorem 1 proof is sound; remaining gaps are auxiliary.","rationale":"The central claim of Theorem 1 rests on Theorem 4, Lemma 12, and Corollary 5. I checked these in detail. Theorem 4's contradiction from Lemma 9(4) and (5) is algebraically sound. Lemma 12's two-case proof (unbounded cn via (15); bounded cn via (31)) is valid, including the estimates qn−qn−1 > qn/2 and tn > cn tn−1. Corollary 5's rational termination uses the standard cylinder-denominator fact, which is true; its irrational divergence uses qn+1qn > tn^2, which follows from Lemma 9(3) rather than directly from (3), but the conclusion is correct. The remaining issues are real but non-central: the n≤6 finite verification is missing, and Lemma 14's equation (33) contains a mislabeled algebraic manipulation. Since these affect only Theorem 6 and Theorem 7 (optimality and growth-rate results), not the existence of the G-decomposition, I do not see a load-bearing objection to Theorem 1. The reader's conditional verdict is therefore appropriate: the paper should be accepted once the auxiliary gaps are cleaned up, but nothing in them undermines the main theorem.","tokens_in":12453,"tokens_out":29296,"duration_ms":265509,"concrete_test":"Reproduce the finite n≤6 verification for Theorem 6 and Lemma 15 by exhaustive interval-arithmetic search over the Shulga interval partition, printing a table of all cases that must satisfy b6≥8 and inequalities (5) and (6); if any case fails, Theorem 6 is unsupported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No load-bearing flaw found in the central claim. The reader's concern about the rational-case denominator bound is standard and correct: any rational in the cylinder [[0;c1..cn],[0;c1..cn+1]] has reduced denominator at least tn, so tn/qn ≤ q and the algorithm terminates for rational α. The step 'from (3), qn+1qn > tn^2' is compressed but valid: it follows from Lemma 9(3) applied to Bn+1∩Cn, which is nonempty for α∈An+1, giving qn+1qn > tn(tn+tn−1) > tn^2, hence bn+1 > (tn/qn)^2 − 1; Lemma 12 then gives divergence. The genuine loose ends are auxiliary: the n≤6 computer check in Theorem 6 (and the base cases in Lemma 15) is asserted without code or table, and Lemma 14's equation (33) is labeled 'equivalent' when the printed algebra is only a valid one-way consequence. Neither affects Theorem 1.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that every real number can be written as a sum of two numbers whose continued-fraction partial quotients either terminate (for rationals) or tend to infinity (for irrationals). The proof is constructive and is based on Shulga's decomposition algorithm. The main technical contribution is Theorem 4, which strengthens Shulga's inequality c_n >= b_n to the strict inequality c_n > b_n for n > 1. From this the authors derive that t_n/q_n tends to infinity (Lemma 12), which yields Corollary 5: for every alpha in [0,1], the Shulga decomposition beta + gamma has beta, gamma in G, and if alpha is rational then beta and gamma are rational. The paper also proves growth estimates for the partial quotients (Theorem 6) and constructs an irrational example with linear growth (Theorem 7), giving a negative answer to Shulga's Problem 6.1. The proof of the main theorem is self-contained: Section 3 re-proves Shulga's theorem using interval intersections rather than assuming it.","tokens_in":12655,"tokens_out":20082,"duration_ms":183574,"significance":"If correct, the paper resolves a natural question posed by Shulga and adds to the classical line of results by Hall, Erdős, and Cusick on sums of sets defined by continued-fraction constraints. The proof is constructive and the interval-intersection analysis of the Shulga algorithm is of independent interest. The main argument is largely self-contained and derives the key inequalities in detail. The main theorem is not affected by the auxiliary gaps I note below, which concern Theorem 6 and the wording of Lemma 14. I found no circularity: the paper re-proves Shulga's theorem and does not assume the target result.","major_comments":[],"minor_comments":[{"comment":"The assertion that \"one can easily check (e.g., by a computer program)\" the base cases n <= 6, in particular b6 >= 8, is not supported by any reproducible verification in the manuscript. Since the induction for (5) and (6) uses (34) as its base, this is an omitted proof for a stated theorem. The same applies to the \"direct computation\" for 2 <= n <= 6 in Lemma 15. This gap does not affect the proof of Theorem 1, but it should be repaired by supplying an explicit table, a short human proof, or well-documented code.","section":"§5, proof of Theorem 6"},{"comment":"The sentence \"which is equivalent to c_{n+1}/(b_n - 1) > 1 + c_{n+1}/t\" before equation (33) is inaccurate: the displayed algebra gives (33) as a one-way consequence of the preceding inequality, not as an equivalent reformulation. The later deductions use only the one-way implication, so the proof remains valid after rewording, but the current text is formally incorrect.","section":"§5, Lemma 14"},{"comment":"The line \"from (3) we have q_{n+1}q_n > t_n^2\" is not a direct consequence of the inequality c_n > b_n. It follows from Lemma 9(3) applied to the nonempty intersection B_{n+1} ∩ C_n for alpha in A_{n+1}, which gives q_{n+1}q_n > t_n(t_n + t_{n-1}) > t_n^2. Please correct the citation or add the missing step.","section":"§4, proof of Corollary 5"},{"comment":"The proof uses the standard but unstated fact that a rational number lying in the cylinder interval [[0;c_1,...,c_n], [0;c_1,...,c_n+1]] has reduced denominator at least t_n. This fact is correct, but it should be stated explicitly, because the bound t_n/q_n <= q depends on it.","section":"§4, proof of Corollary 5, rational case"},{"comment":"The chain \"From (15) one can see that c_n/(2t_n^2) < 1/(2t_{n-1}t_n) < 2/q_n^2\" is compressed. The second inequality uses q_n - q_{n-1} >= q_n/2, which follows from b_n >= 2. This intermediate step should be written out for readability.","section":"§3, Lemma 12"},{"comment":"The implication from Corollary 5 to Theorem 1 is not explained in the text. It should be noted explicitly that adding an integer to a real number in G preserves membership in G, so the result for [0,1] extends to all of R by an integer shift.","section":"§1, Corollary 5 implies Theorem 1"},{"comment":"There are several typos and minor formatting issues: \"Defition 2\" in Section 4; \"Let n > 6 be an arbitrary integer greater than 6\" in the proof of Theorem 6; the displayed expression \"4 − 3.8(c_n−x)/(c_n+2.1) (c_n−x)+x\" in Lemma 15 is garbled and should read 4 + x − 3.8(c_n−x)/(c_n+2.1); and the reference to \"Erd˝ os\" should use the standard accent.","section":"Various"}],"recommendation":"minor_revision","confidential_remarks":"The central claim, Theorem 1, appears sound and the proof is largely self-contained. The issues I found are local and auxiliary: the unspecified computer verification in Theorem 6, the mislabeled 'equivalent' in Lemma 14, and a few compressed justifications. I do not see a circularity or a load-bearing flaw. I recommend minor revision rather than major revision because the main theorem does not depend on Theorem 6 or on the exact wording of Lemma 14."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Bottom line: this paper proves the right thing, and the proof of the main theorem is sound. The strict inequality c_n > b_n is a genuine strengthening of Shulga's c_n ≥ b_n, and it is exactly what is needed to force both summands in the Shulga decomposition to have diverging partial quotients. The interval intersection analysis in Lemma 9 is the real engine, and the paper is careful to re-prove Shulga's theorem rather than quoting it, so the result is self-contained. The quantitative growth estimates (Theorem 6) and the explicit linear-growth example (Theorem 7) are new and answer Shulga's Problem 6.1 as a bonus: the c_n sequence need not be monotone. The paper is honest about what is numerical evidence versus proved, as in Remark 1.\n\nThe soft spots are minor and auxiliary. The proof of Theorem 6 delegates the n ≤ 6 base cases, including the claim b_6 ≥ 8, to \"a computer program\" with no code or table. A finite check of this size is not a reason to reject, but the authors should supply the verification or replace it with a hand proof. Similarly, Lemma 15 starts with a direct computation for 2 ≤ n ≤ 6 without showing the numbers. The other flaw the reader flagged is in Lemma 14: the line \"which is equivalent to\" before (33) is only a one-way implication as printed. The direction used is the valid one, so the argument survives; it just needs rewording.\n\nI checked the compressed step in Corollary 5 that the reader worried about. The fact that a rational in the cylinder interval has reduced denominator at least t_n is standard, and the step q_{n+1} q_n > t_n^2 follows from Lemma 9(3) applied to the intersection B_{n+1} ∩ C_n, which is nonempty for α in A_{n+1}. So the rational-case termination is fine.\n\nWho should read this: anyone working on sums of Cantor sets, continued fraction sums, or Cusick-type problems. It is a community paper, not a field-reorganizing one, but it cleanly settles an open problem and the method is reusable.\n\nRecommendation: send it to a serious referee. The main theorem deserves publication, and the loose ends are exactly the kind of things a referee can ask to be cleaned up. The paper should be accepted after minor revision.","headline":"The strict inequality c_n > b_n is the right lever: it turns Shulga's decomposition into a proof that both summands have diverging partial quotients, and the main theorem is sound; only auxiliary computer checks and a compressed algebra step need cleanup.","tokens_in":13173,"tokens_out":2232,"would_cite":true,"duration_ms":22376,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11A55","11K50","28A80"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every real number can be written as the sum of two numbers whose continued-fraction partial quotients go to infinity.","keywords":["continued fractions","divergent partial quotients","sumset decomposition","constructive algorithm","growth of partial quotients","rational inputs","Diophantine approximation","cylinder intervals"],"falsifier":"Run the algorithm on every rational p/q with q up to some large bound and check whether, for any n > 1, the computed digits satisfy c_n ≤ b_n; Theorem 4 predicts none exists, so any violation would refute the main inequality. Equally decisive: verify the explicit nesting construction claimed for Theorem 7 by computing its first digits [0;2,6,11,16,21,26,...] and [0;4,9,14,19,24,28,...] and checking that the stated containments B_n ⊇ C_n ⊇ B_{n+1} hold for all n; a single failed containment would break the construction.","tokens_in":12276,"feed_emoji":"∞","tokens_out":6384,"duration_ms":67085,"temperature":0.7,"pith_summary":"The paper proves that every real number α can be written as β + γ where both β and γ are either rational or have continued-fraction partial quotients tending to infinity. This answers a question raised in a recent study of a decomposition algorithm for numbers in [0,1]. The proof is constructive: for any input α the algorithm produces explicit β and γ, and the key step is a strict inequality between the two digit sequences at every step after the first. The same argument shows that if α is rational, the algorithm stops after finitely many steps and returns rational β and γ.","feed_headline":"Every real number splits into two numbers with diverging digits","feed_subtitle":"The proof is constructive: an explicit algorithm returns two numbers whose continued fractions blow up, even for rational inputs.","key_machinery":"The engine of the proof is an interval-intersection reformulation of the algorithm. For candidate digit blocks, sets B_k and C_k are intervals in [0,1] that encode the condition that the first k digits produced by the algorithm equal the given blocks, and the true input α lies in their intersection A_n for every n. The proof converts the existence of a common point into explicit inequalities between continued-fraction convergents, most importantly Lemma 9(4)–(5), which under the assumption c_n = b_n yield contradictory bounds z < (1+1/y)(1-x) and z > (1+1/y)(1-x). This contradiction gives the strict inequality c_n > b_n, and Lemma 12 converts the resulting growth of t_n/q_n into divergence of b_n and c_n.","core_discovery":"The central claim is Theorem 1: for every real α there exist β, γ in the set G (rationals, or irrationals whose partial quotients a_n(·) tend to infinity) with α = β + γ. For α in [0,1] the decomposition is produced by the algorithm studied here: it defines digit sequences b_n and c_n and stops early if α already equals the sum of the finite continued fractions; otherwise β = [0;b_1,b_2,...] and γ = [0;c_1,c_2,...]. The paper's main technical discovery is that the second sequence strictly dominates the first, c_n > b_n for every n > 1, which forces the ratios t_n/q_n of the convergent denominators to grow without bound; from this the divergence of the partial quotients follows. For rational α, the same denominator growth forces the algorithm to terminate, giving rational β and γ.","pith_inferences":["The same interval-inequality machinery may transfer to other continued-fraction classes, such as numbers whose partial quotients stay above a prescribed increasing function; the strict c_n > b_n inequality is likely the flexible heart of the argument.","One could test computationally whether the O(log q) bound for rational inputs truly holds; the paper leaves this open, and a proof or counterexample would sharpen the constructive claim.","Since G has Hausdorff dimension 1/2, the theorem shows that a small-dimensional set of continued-fraction numbers can still have a sumset covering the whole real line, in contrast with the bounded-partial-quotient sums in Hall's classical result.","The explicit nesting construction in Theorem 7 could be adapted to produce decompositions with prescribed linear growth rates, giving a family of examples rather than a single one."],"forward_implications":["If the theorem is correct, the set G of rationals and numbers with diverging partial quotients is additively universal: G + G = R.","For rational α = p/q the algorithm terminates, and the continued-fraction lengths of β and γ are O(q^2); the paper notes numerical evidence that the true length may be O(log q).","The strict inequality c_n > b_n forces b_n ≥ n for every n, so the constructed numbers have explicit, at least linear growth in their partial quotients.","The constructed example satisfying 4n − 2 ≤ b_n < c_n < 5n shows that linear growth is best possible up to a constant factor and that the c_n sequence need not be monotone, settling an open problem."],"supporting_citations":[{"why":"Supplies the decomposition algorithm and the two open problems (termination and monotonicity) that the paper resolves.","marker":"[8]"},{"why":"Defines the set G and computes its Hausdorff dimension, establishing the object whose additive structure is the paper's subject.","marker":"[3]"},{"why":"Hall's sum theorem for bounded partial quotients is the classical counterpart that the present unbounded-partial-quotient result goes beyond.","marker":"[4]"},{"why":"Erdős's sum theorem for Liouville numbers provides the earlier unbounded-coefficient model motivating the same question for divergent partial quotients.","marker":"[2]"},{"why":"Cusick's theorem on sums of numbers with all partial quotients at least a is the property that the algorithm was designed to extend.","marker":"[1]"}],"fun_headline_variants":["Every real is a sum of two with diverging partial quotients","Every real number splits into two with diverging continued fractions","All reals are sums of pairs with diverging partial quotients","Every real splits as a sum of two with diverging partial quotients"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument that the algorithm stops for rational inputs assumes a standard denominator bound: a rational number lying in a continued-fraction cylinder interval has reduced denominator at least the denominator of the interval's endpoint, and the proof uses this without stating it explicitly.","fun_headline_variants_meta":{"raw":{"variants":["Every real is a sum of two with diverging partial quotients","Every real number splits into two with diverging continued fractions","All reals are sums of pairs with diverging partial quotients","Every real splits as a sum of two with diverging partial quotients"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001306,"raw_usage":{"total_tokens":5234,"prompt_tokens":762,"completion_tokens":4472,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":378,"completion_tokens_details":{"reasoning_tokens":4398}},"tokens_in":378,"tokens_out":4472,"duration_ms":34234,"temperature":1.0,"reasoning_tokens":4398,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T19:47:00.845163+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the algorithm on every rational p/q with q up to some large bound and check whether, for any n > 1, the computed digits satisfy c_n ≤ b_n; Theorem 4 predicts none exists, so any violation would refute the main inequality. Equally decisive: verify the explicit nesting construction claimed for Theorem 7 by computing its first digits [0;2,6,11,16,21,26,...] and [0;4,9,14,19,24,28,...] and checking that the stated containments B_n ⊇ C_n ⊇ B_{n+1} hold for all n; a single failed containment would break the construction.","supporting_citations":[{"cited_title":"On a Conjecture of Cusick on a sum of Cantor sets","cited_arxiv_id":"2411.17379","evidence_quote":"Supplies the decomposition algorithm and the two open problems (termination and monotonicity) that the paper resolves."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the set G and computes its Hausdorff dimension, establishing the object whose additive structure is the paper's subject."},{"cited_title":"On the sum and product of continued fractions.Annals of Mathematics, 48(4):966–993, 1947","cited_arxiv_id":null,"evidence_quote":"Hall's sum theorem for bounded partial quotients is the classical counterpart that the present unbounded-partial-quotient result goes beyond."},{"cited_title":"Representations of real numbers as sums and products of Liouville numbers","cited_arxiv_id":null,"evidence_quote":"Erdős's sum theorem for Liouville numbers provides the earlier unbounded-coefficient model motivating the same question for divergent partial quotients."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Cusick's theorem on sums of numbers with all partial quotients at least a is the property that the algorithm was designed to extend."}],"review_version":1}