solve congruency thank you so much, I understand it now
solve congruency the coding, I do not understand how to implement the mathematics as a c++ code
solve congruency Write a procedure to solve a pair of congruences of the form
x ≡ a (mod m)
x ≡ b (mod n)
Convolution of dice thank you
Convolution of dice I have a biased dice with probability of throwing 1,2,3,4,5,6 as 0.35 , 0.10, 0.05, 0.05, 0.15, 0.3...