$3$ points

Recall that the division algorithm guarantees that for every pair of integers $a,b,$ where $b0,$ there exist unique integers $q,r$ such that The integer $r$ is called the remainder.

$a=bq+r,0r<mi\; id="EditorElement\_2981281">|</mi><mi\; id="EditorElement\_2981283">b</mi><mi\; id="EditorElement\_2981285">|</mi>$

If $a=276$ and $b=35,$ enter the remainder $r$ resulting from applying the division algorithm as above.

Type your answer...