Multiplicative Inverses Mod n Write a program which takes in two integers a, and n. Your job is to ensure that they are both positive integers (just to reinforce positivity, zero is not legal input either). Then your objective is to find out if there is an integer x so that a times x is 1 mod n. Sometimes they exist, and sometimes they won't. Test all possibilities between 1 and n to see if they work.

news channels,news papers,and the internet

24

step-by-step explanation:

if it takes 8 pounds to make 12 divide 12 by 8 and you get 1.5, 1.5 x 16 = 24

c.

step-by-step explanation:

because first you have to add the 4x, 9x, and the 7x together and you get 20x and then you add the last numbers up and you get 5and then you put the subtraction sign in there and that's how you get the answer.

these sign is used to tell weather the number is greater or less than the number   <   or >     but this sign means its equal =    

hope this you and

step-by-step explanation: