Copyright students of FIT CTU and others, 2014. Content on this site is licensed under a Creative Commons Attribution-ShareAlike 4.0 International license.
| 2016-11-13 17:13:06 +0100 | received badge | ● Editor (source) |
| 2016-11-13 17:10:20 +0100 | commented question | Rešení kongruence Dobrý den. Ano, k, b, a mod m znám. Hledám X. Prý to jde Euklidovým algoritmem ale prý to jde ještě rychleji jiným postu ... |
| 2016-11-07 16:05:04 +0100 | received badge | ● Famous Question (source) |
| 2016-11-03 17:30:38 +0100 | received badge | ● Notable Question (source) |
| 2016-11-03 09:21:27 +0100 | received badge | ● Popular Question (source) |
| 2016-11-01 19:08:35 +0100 | received badge | ● Student (source) |
| 2016-11-01 17:46:09 +0100 | asked a question | Rešení kongruence Prosim pomoc. Jak obecne, co nejefektivneji vyřesim nasledujici kongruenci.
(2^k)*x≡b (mod m)
Děkuji
k, b a mod m zná ... |
Copyright students of FIT CTU and others, 2014. Content on this site is licensed under a Creative Commons Attribution-ShareAlike 4.0 International license.