We begin by testing a configuration where the numbers are distinct primes or mostly coprime small integers. However, since the sum is fixed at 140 and we have 7 numbers, we cannot use 7 large primes (their sum would likely exceed 140). We consider using small numbers that are pairwise coprime and whose LCM is large.

February 22, 2026

Title: Selecting Distinct Small Coprime Integers with Fixed Sum: A Strategy for Sum = 140 and Seven Numbers

When tasked with selecting seven distinct positive integers whose sum equals exactly 140, combined with a preference for small, mostly coprime numbers and a focus on maximizing the least common multiple (LCM), the challenge requires a thoughtful approach. Rather than simply picking the smallest primes, the goal becomes balancing distinctness, coprimality, and sum constraints—especially since using seven large primes risks exceeding the sum limit.

Why Focus on Small Coprime Integers?

Distinct prime numbers are naturally coprime, but large primes quickly surpass the fixed sum. For example, the 7 smallest primes—2, 3, 5, 7, 11, 13, 17—sum to only 58. While smaller and coprime, this total is far below 140. Including larger primes like 29, 31, or others pushes the sum beyond 140, especially across seven terms. Thus, a smarter strategy involves using small base numbers that are pairwise coprime yet permit a meaningful total—without breaching 140.

Maximizing Coprimality Without Large Primes

Rather than relying solely on primes, consider small composite and composite-like integers that are pairwise coprime. These numbers avoid common factors and help reach a larger total within constraints. Pairwise coprimality ensures no shared prime factors across all selected numbers.

For instance, numbers like 2, 3, 5, 7, 11 (the first seven primes) remain fundamental but sum too low. To reach 140, we need a strategy that increases the total through coprime composites or modified entries—while preserving simplicity and avoids redundancy.

Key Insight: Use Small Coprime Building Blocks

A practical configuration begins with the smallest pairwise coprime set: often 2, 3, 5, and selected odd composites rooted in disjoint prime factors—e.g., 7 (prime), 10 (2×5), but 10 shares prime factors with 2 and 5. Instead, favor numbers derived from new or unused primes, such as 13, 17, 19—adding these increases the total.

For example:

Start with 2, 3, 5, 7, 11 — sum so far: 28
Add 13, 17 — sum so far: 50
Remaining five numbers must total 90, filled with distinct integers coprime to all previously chosen and to each other

To keep numbers small yet large enough, choose small numbers like:

1 (coprime with all),
9 = 3² but 3 already used → avoid for coprimality,
25 = 5² → avoid (shared factor),
49 = 7² → avoid,
So alternatives: 7 × 1 = 7 (taken), so try 121? Too large.

Instead, favorable coprime small integers below 50: 1, 9, 25, 49 (but coprimality fails due to prime factors shared). A better tactic: use numbers like:

1 (coprime with all),
4 = 2² → avoid due to 2,
9 = 3² → avoid,
25 = 5² → avoid,
49 = 7² → avoid,
121 too big,
So choose: 1, 25, 49, but these conflict with prime factors—unless excluded.

Alternatively, relax strict primes and embrace small composites with disjoint prime supports:

1 (special unit),
9 (3²),
25 (5²),
49 (7²),
121 too big,
But can’t include two squares sharing primes.

Thus, a replacement approach: include 1, 11, 13, 17, 19, and train others around these.

Balancing Sum and Coprimality in Seven Numbers

Let’s prototype a viable configuration:

1 (unit, coprime to all)
2 (prime)
3 (prime)
5 (prime)
7 (prime)
11 (prime)
And four more distinct coprime small integers summing to 140 − 1+2+3+5+7+11 = 80
Remaining: 80 across four distinct integers >1, all coprime to each other and previous primes

Choose: 13, 17, 19, and 31 → sum = 13+17+19+31 = 80

Check pairwise coprimality:

All selected >1 and distinct primes or products of unique primes (e.g., 13, 17, 19, 31)
None share factors with 2, 3, 5, 7, 11
31 is prime and divides none of the others ⇒ coprime

Thus, total set: {1, 2, 3, 5, 7, 11, 13, 17, 19, 31} — too many numbers.

Adjust: we need only seven numbers total.

Revised plan: exclude 1 to reduce sum slower, but 1 ensures smallness and neutrality.

Try:

2, 3, 5, 7, 11 (sum = 28)
Need four more distinct coprime numbers summing to 112, all small and pairwise coprime with each other and primes

Choose composites or higher primes avoiding shared factors:

13 (next prime), 17 (next), 19 (next), 23 (next) → sum = 13+17+19+23 = 72 → total = 28+72 = 100 → need 40 more from one number? Impossible with one.

Instead, use multiple composites with disjoint prime support:

9 = 3² → fails (shares factor with 3)
25 = 5² → shares 5
49 = 7² → shares 7
121 = 11² → too big
Try: 1, 25, 49, but conflicted

Better: Use small coprime non-prime bases:

1,
25 (5²),
49 (7²),
but exclude 2, 3, 5, 7; pick 11, 13, 17, 19 — but sum exceeds

Alternative: accept larger numbers but keep overall low and coprime.

Optimal Strategy: Use Minimal Small Coprime Building Blocks

Let’s define a concrete working configuration:

Final Proposed Set:

1, 2, 3, 5, 7, 11, 98

Sum: 1+2+3+5+7+11+98 = 127 — too low. Add 13: but now eight numbers.

Wait — we need exactly seven numbers.

Try:

1, 2, 3, 5, 11, 13, 101 → sum = 135 — too high and 101 too large and not coprime good.

Reframe: pick seven pairwise coprime small integers summing to 140, maximizing LCM.

Best Balanced Configuration:

Try: {1, 2, 3, 5, 7, 13, 109} → sum = 1+2+3+5+7+13+109 = 140

Check:

All distinct, >0
Coprime:
- 1 coprime to all
- 2,3,5,7,13 prime ⇒ pairwise coprime
- 109 prime, not sharing factors with others
Sum = 140
Include prime small numbers and one large coprime number with prime factor not elsewhere

This set uses 2,3,5,7 (small distinct primes), 13 (next), and 109 (a large prime coprime to all), totaling 7 elements.

Sum: 1+2+3+5+7+13+109 = 140

Pairwise coprime:

109 is prime ⇒ coprime to all others (residual sum 1+2+3+5+7+13 = 31; 109–31 = 78 ≠ multiple, but no common factor)
109 shares no prime factor with 2,3,5,7,13 ⇒ gcd(109, n) = 1 for n < 109

LCM(sum set): since coprime, LCM is product — very large.

Why not use composites? Composites typically reduce flexibility unless carefully chosen; here primes plus one large prime suffice.

Conclusion: By combining small pairwise coprime numbers—seven integers including two small primes and a large prime—we achieve fixed sum (140), diversity, and maximal LCM without exceeding constraints.

For optimization:

Use as many small coprime primes or disjoint-prime composites
Minimize shared factors
Ensure single use of large coprime integers to boost LCM
Balance sum distribution to reach 140 precisely

This approach aligns test config goals: distinct small coprime integers summing to 140 with seven terms, emphasizing pairwise coprimality and high least common multiple.

SEO Keywords: distinct primes sum to 140, pairwise coprime numbers, small coprime integers, maximize LCM, seven integers under sum constraint, coprime configuration, sum 140 with coprime coalition

Meta Description: Explore a seven-integer configuration of distinct small, mostly coprime numbers summing exactly to 140. Combines small primes and a large coprime prime to maximize LCM while meeting sum and distinctness challenges. Ideal for number theory enthusiasts and optimization problems.

Related Articles

Trending Articles