claim: In particular, PMOD alters the data from the Nimbus7 / ERB record from 1989 to 1991.
evidence: In mathematics, in particular the area of number theory, a modular multiplicative inverse of an integer a is an integer x such that the product ax is congruent to 1 with respect to the modulus m. In the standard notation of modular arithmetic this congruence is written as a x ≡ 1 (  mod m  ) , { \displaystyle ax\equiv 1{ \pmod { m } }, } which is the shorthand way of writing the statement that m divides ( evenly ) the quantity ax − 1, or, put another way, the remainder after dividing ax by the integer m is 1.