← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.763Z

for the elementary arithmetic operations? 31-4 Quadratic residues Let p be an odd prime.

A number is a quadratic residue modulo p, if the equation x2 = a (mod p) has a solution for the unknown x. a. Show that there are exactly (p – 1)/2 quadratic residues, modulo p. b. If p is prime, we define the Legendre symbol , for , to be 1 if a is a quadratic residue, modulo p, and –1 otherwise. Prove that if , then Give an efficient algorithm that determines whether a given

number a is a quadratic residue, modulo p. Analyze the efficiency of your algorithm. c. P

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea