Worked Example: Splitting $100 Among Three People

See the problem with independent rounding

The mathematical share is $100/3 = $33.333…. Rounding every person independently to $33.33 collects only $99.99. Rounding every share upward to $33.34 collects $100.02. Neither reproduces the payable total.

Divide the total integer cents

Represent $100 as 10,000 cents. Integer division by three yields base share 3,333 cents and remainder one. Give one person one extra cent: $33.34, $33.33 and $33.33. Their total is exactly $100.

Check totals ending in different cents

For $100.01, base share remains 3,333 cents but remainder is two, so two people pay $33.34 and one $33.33. For $100.02 the remainder is zero and each pays $33.34. No hidden cent is created or lost.

Make the remainder rule explicit

The allocation differs by at most one cent. The arithmetic decides how many higher shares are needed, not which named person should pay them. For repeated events, rotating the higher-cent positions can be a practical fairness policy. The calculator should not pretend that all identical rounded shares preserve the total.

Finish tip rounding before splitting

First determine the final tip amount under the chosen convention and add it to the bill. Then split that total once. Splitting the bill and separately rounding everyone’s portion of the tip can introduce another remainder. Itemized or unequal shares require a different allocation model.

A second bill with tax and tip calculated on the same base

Consider a separate illustrative bill of $84.75 before tax and tip, with 8% tax, an 18% tip and four equal participants. Both percentages use the base bill. Tax is $6.78 and the unrounded tip is $15.255. The exact combined amount is $84.75 × 1.26 = $106.785. The bill-split tool rounds that combined payable amount once to cents, with a positive half-cent rounded upward, giving $106.79. It does not separately finalize the tip before adding it.

Represent the final total as 10,679 integer cents. Dividing by four gives base share 2,669 cents and remainder three. Three participants pay $26.70 and one pays $26.69, for exactly $106.79. Charging all four the nearest displayed mathematical share of $26.70 would collect $106.80, one cent too much. The differing shares are the deliberate cent-preserving allocation, not a floating-point defect.

To reproduce the result, enter bill 84.75, tax 8, tip 18 and people 4. Confirm the total and the number of higher shares before assigning people to positions. If the actual tip is assessed on a tax-inclusive bill or is a fixed amount, these inputs represent a different model. First determine the actual payable total separately, then enter it as the base bill with zero tax and zero tip to use only the equal-cent allocation.

A third bill and a deliberately different tip-rounding policy

Now take a $57.83 bill, no tax, a 20% tip and five equal participants. The exact tip is $11.566 and the combined amount is $69.396. Rounding the total once produces $69.40. Its 6,940 cents divide evenly by five, so everyone pays $13.88 and no higher-cent positions are needed. This case shows that a repeating or fractional intermediate tip does not necessarily leave a remainder in the final split.

Suppose instead the group explicitly chooses to round the tip itself to the nearest whole dollar. The tip calculator returns $12 and total $69.83. Its mathematical per-person display is $13.966, not a complete payment allocation. Pass the finalized $69.83 to the bill-split form with tip and tax both zero. Dividing 6,983 cents by five gives 1,396 cents and remainder three: three people pay $13.97 and two pay $13.96. The result exactly reconciles to the chosen total.

The forty-three-cent difference between $69.40 and $69.83 is not caused by the allocation. It comes from choosing a whole-dollar tip of $12 instead of an unrounded $11.566 before finalizing the bill. The standalone tip tool labels this option as tip rounding, not total rounding. Rounding only the final total to a whole dollar would be a third policy and should receive its own clearly labeled ledger.

Verify the invariant before deciding who receives the extra cent

For any nonnegative finalized integer-cent total T and positive participant count n, write T = nq + r with 0 ≤ r < n. Charge r participants q + 1 cents and the remaining n − r participants q cents. The sum is r(q + 1) + (n − r)q = nq + r = T. The two share sizes differ by at most one cent. This proof explains both the allocation and the maximum number of higher shares without relying on currency display rounding.

A tiny illustrative total of two cents split among four participants has q = 0 and r = 2. Two shares are one cent and two are zero. A zero payable total gives every participant zero and no higher shares. These boundary cases are mathematically valid even if they are uncommon restaurant bills. A participant count of zero or a fractional person count is rejected because the equal-participant model needs a positive whole number.

The current tool assigns higher shares to the first positions in the list convention. It does not know names or decide which person's meal was larger. A group can rotate those positions across repeated events or choose another explicit fairness rule while preserving the same counts and total. Itemized meals, unequal sponsorship and prior payments require a different allocation ledger, not a change to the equal-share result.

Keep the original base, percentage bases, finalization policy, final integer cents, participant count and remainder allocation together. Reconcile collected cents to payable cents once; splitting and rounding the tax, tip and base independently can accumulate multiple remainders. These are invented financial examples, not recommendations about an appropriate tip, tax law or a payment provider's fee policy. The validated claim is that the stated finalized total is preserved exactly in cents.