A requirement for a cipher is that every plaintext letter corresponds to a different ciphertext letter. If a and b are not relatively prime to n, does the affine cipher meet this property? If so, prove it. Otherwise, present a counterexample. Show your work.

the answer to your question would be something called hertz. the unit of measurement called a hertz, which is one cycle per second, is used to measure clock speed. within one cycle, your computer processes, refreshes, or updates itself to the changes that it is going through. in the case of computer clock speed, one hertz equals one tick per second. the clock speed of computers is usually measured in megahertz (mhz) or gigahertz (ghz)