素因数分解について

スポンサーリンク

概要

• 論文の詳細を見る

• It is unfortunately not a simple matter to find prime factorization of n, or to determine whether or not n is prime. So far as anyone knows, it is a great deal harder to factor a large number n than to compute the greatest common divisor of two large numbers m and n. But several ingenious ways to speed up the factoring process have been discovered, and will now investigate some of them.

• 高知大学の論文
• 1990-12-10

著者

• 松田 崇

  Department Of Mathematics Kochi Nedical School

関連論文

• Exponentials and Logarithms
• An Inductive Proof of the Arithmetic-Geometric Mean Inequality
• シュトルツ角領域におけるある不等式の幾何学的証明
• 微分積分学教程の一様相
• 素因数分解について

スポンサーリンク