← 返回起始笔记位置

知识卡片

普通读书笔记卡 · 3703.a

勒让德符号区分平方剩余类

理解等级:初级

对奇素数p及非零剩余类a,勒让德符号用1表示a是二次剩余、用−1表示不是;它把“是否能开模平方根”压缩为一个分类值。

原书在习题中定义该符号,后续判别式仍是待证明任务。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第31章 数论算法 · 查看原书依据

      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. Prove that if p is a prime of the form 4k + 3 and a is a quadratic residue in , then ak+1 mod p is a square root of a, modulo

    参考来源

    - 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[95000,100000))。 - 结论依据:第31章相应定理、习题定义或章末注释;相关图式与来源段落已核对。 - 原始内容: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. Prove that if p is a prime of the form 4 k + 3 and a is a quadratic residue in , then a k +1 mod p is a square root of a , modulo