how can i write square root of mod x1(t)
3 次查看(过去 30 天)
显示 更早的评论
回答(1 个)
John D'Errico
2018-10-22
Huh? It looks like you already know how to write sqrt(x(1)*t). So what is your question?
Are you looking to find a modular square root? Something else? For example, if you are working in the integers modulo n, the square root of a number x is defined as the number y such that
mod(y*y,n) = mod(x,n)
You can find modroot in my VPI toolbox. Or, you can write the code for the Shanks-Tonelli algorithm.
modroot(vpi(13437),100003)
ans =
643
mod(643^2,100003)
ans =
13437
Or, are you looking for something completely different?
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Matrix Indexing 的更多信息
产品
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!