| bio | website | en.wikipedia.org/wiki/… |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 5 months |
| seen | Jan 8 at 1:30 | |
| stats | profile views | 24 |
|
Sep 24 |
comment |
Does $\gcd(40,80)$ = $40$ or $20$ This is a much longer answer than the one I intended to accept when I asked you to turn the comment into an answer, but I accept anyway. |
|
Sep 24 |
comment |
Calculating the Modular Multiplicative Inverse without all those strange looking symbols That is good to know. I would still like to know how I could calculate this myself. |
|
Sep 24 |
comment |
Calculating the Modular Multiplicative Inverse without all those strange looking symbols I would like to keep it to the basic functions plus, minus, divide, remainder (modulus), power-of, and if I have to repeat a function many times to get to the final result, I can program that in no problem. If additional functions are necessary, that is fine. I am not sure what I need, but the Modular Multiplicative Inverse and Extended Euclidean are not something I understand. I am hoping that getting the mod_inverse can be broken down to a lower level. The calculator I am using is just a programming language that is capable of mod_inverse directly, but I would like to know what tha means. |
|
Sep 24 |
comment |
Does $\gcd(40,80)$ = $40$ or $20$ @André, Please make that an answer so I can accept. |
|
Jan 12 |
comment |
Given an infinite number of monkeys and an infinite amount of time, would one of them write Hamlet? When calculating likelyhood.. don't forget that monkeys will be more likely hit a group of letters in the same area of the keyboard then to press one at a time.. |