2022-01-27 14:52:31 +0100 | received badge | ● Famous Question (source) |
2022-01-27 14:52:31 +0100 | received badge | ● Notable Question (source) |
2022-01-27 14:52:31 +0100 | received badge | ● Popular Question (source) |
2018-01-19 06:59:06 +0100 | received badge | ● Student (source) |
2018-01-18 22:43:14 +0100 | commented question | Trouble with sage small_roots I just want to use coppersmith method, that said root can be found if |x| < N^(1/f.degree()). In @dan_fuelea's example no root can be found for k = 3, 4 even if should contains 2. 2^15 < 55555 , so also 2 < 55555^(1/7). For small_root from documentation condition on bound is also true. |
2018-01-18 01:04:15 +0100 | commented question | Trouble with sage small_roots So what should i do ? I fault understanding meaning of function purpose or should i use other implementation ? |
2018-01-17 18:15:35 +0100 | received badge | ● Editor (source) |
2018-01-17 16:36:01 +0100 | asked a question | Trouble with sage small_roots ...some code above Edit: Coef are list of coefficients, b is polynomial root(line 3). Why small._root didnt return list with b, if b is "small_root"- (b)**f.degree() < n(condition for coppersmith method) |
2018-01-17 16:36:01 +0100 | asked a question | Trouble with sage small_roots |