Answer:
<u>Residue</u>
Step-by-step explanation:
Let a and b be integers. We define a mod b to be the residue of dividing a by b. For example, if a evenly divides b, then a mod b=0, 20 mod 6= 2. The modulus operator is widely used in programming, and it is convenient when a and b are large numbers.
a mod b is always a nonnegative integer. In fact, 0≤ a mod b≤ |b-1| by the division algorithm. a and b can also be negative integers. Since 8=-(-5)+3 then 8 mod -5= 3.
As a final example, some known properties can be rewritten in terms of mod. a mod 2=0 if and only if a is even. a mod 2=1 if and only if a is odd.
We have a formula for that( according to the Intersecting chords theorem)
3×4=2×jk
6=jk
Answer: C. None of the above
Step-by-step explanation:
Answer:
6/8, 9/12, 12/16 etc.
Step-by-step explanation:
You just think of a number for an example 2. Multiply 3 and 4 by it and you have a fraction equivalent to 3/4.
Hope this helped
