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!