A bright interference claim begins with a checked integer path difference. Exact arithmetic here means exact results for the stated model inputs; measured inputs still carry uncertainty and significant-figure limits.

highlighted = computed this step

First measure the two path lengths

The two paths are recorded before any fringe label is accepted. Here the longer path exceeds the shorter path by 4 m.

Δ=14 m10 m=4 m\Delta = 14\ \text{m} - 10\ \text{m} = 4\ \text{m}
Measured path lengthsThe path-difference ledger is the source for the fringe claim.path Apath BpathA=10 mpathB=14 mpathDifference=4 mwavelength=2 morder=2 counthalfWaveBit=0 bitmode=brightacceptedBit=1 bit

Integer wavelength counts stay bright

With the wavelength fixed, each integer wavelength count gives the same bright verdict. The table scans three exact counts instead of relying on one example.

Δλtargetaccepted2 m2 m114 m2 m216 m2 m31\begin{array}{c|c|c|c}\Delta&\lambda&\text{target}&\text{accepted}\\2\ \text{m}&2\ \text{m}&1&1\\4\ \text{m}&2\ \text{m}&2&1\\6\ \text{m}&2\ \text{m}&3&1\\\end{array}

An integer path difference accepts a bright fringe

The checked path difference is 4 m, exactly 2 wavelengths.

Δ=4 m=2λ;λ=2 m;accepted=1\Delta=4\ \text{m}=2\lambda;\quad \lambda=2\ \text{m};\quad \text{accepted}=1
Bright path-difference ledgerTwo checked paths differ by an integer wavelength count.path Apath BpathA=10 mpathB=14 mpathDifference=4 mwavelength=2 morder=2 counthalfWaveBit=0 bitmode=brightacceptedBit=1 bit