Accepted and rejected Bragg rows are exact path ledgers. 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-order equality accepts

Order 1 with wavelength 6 m and plane spacing 3 m gives path left 6 m, path right 6 m, and accepted bit 1.

nλ=16=6 m = 2d=23=6 m,accepted=1n\lambda=1\cdot 6=6\ \mathrm{m}\ =\ 2d=2\cdot 3=6\ \mathrm{m},\quad accepted=1
Bragg row firstThe accepted bit is computed from the path equality.d=3 mlambda=6 mn=1n*lambda=6 m2d=6 maccepted=1

Second-order equality also accepts

Order 2 with wavelength 4 m and plane spacing 4 m gives path left 8 m, path right 8 m, and accepted bit 1.

nλ=24=8 m = 2d=24=8 m,accepted=1n\lambda=2\cdot 4=8\ \mathrm{m}\ =\ 2d=2\cdot 4=8\ \mathrm{m},\quad accepted=1
Bragg row secondThe accepted bit is computed from the path equality.d=4 mlambda=4 mn=2n*lambda=8 m2d=8 maccepted=1

A nearby wavelength still rejects

Order 1 with wavelength 4 m and plane spacing 3 m gives path left 4 m, path right 6 m, and accepted bit 0.

nλ=14=4 m  2d=23=6 m,accepted=0n\lambda=1\cdot 4=4\ \mathrm{m}\ \ne\ 2d=2\cdot 3=6\ \mathrm{m},\quad accepted=0
Bragg row offThe accepted bit is computed from the path equality.d=3 mlambda=4 mn=1n*lambda=4 m2d=6 maccepted=0