東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回上頁

切換: 標籤 | MARC模式 | ISBD

Numerical methods in prime factoriza...

Luu, David.

FindBook

Google Book

Amazon

博客來

Numerical methods in prime factorization to find or not to find a prime.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Numerical methods in prime factorization to find or not to find a prime./
作者:	Luu, David.
面頁冊數:	59 p.
附註:	Source: Masters Abstracts International, Volume: 49-01, page: 0477.
Contained By:	Masters Abstracts International49-01.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1486208
ISBN:	9781124231235

Numerical methods in prime factorization to find or not to find a prime.
Luu, David.

Numerical methods in prime factorization to find or not to find a prime. - 59 p.

Source: Masters Abstracts International, Volume: 49-01, page: 0477.

Thesis (M.S.)--California State University, Fullerton, 2010.

Time is always an issue when we deal with calculations in prime factorization and so we consider some tradeoffs. We assume that no prior knowledge of the factorization of a number is known. There are two main concerns that are faced when dealing with prime factorization. One is determining if we can factor the number to begin with and the other is that there is no single formula or algorithm when compared to others that uses the least amount of time for general numbers.

ISBN: 9781124231235Subjects--Topical Terms:

1669109
Applied Mathematics.

Numerical methods in prime factorization to find or not to find a prime.
LDR:01918nam 2200301 4500 001 1399939
005 20110930095916.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124231235
035 $a (UMI)AAI1486208
035 $a AAI1486208
040 $a UMI $c UMI
100 1 $a Luu, David. $3 1678948
245 1 0 $a Numerical methods in prime factorization to find or not to find a prime.
300 $a 59 p.
500 $a Source: Masters Abstracts International, Volume: 49-01, page: 0477.
500 $a Adviser: Kevin Wortman.
502 $a Thesis (M.S.)--California State University, Fullerton, 2010.
520 $a Time is always an issue when we deal with calculations in prime factorization and so we consider some tradeoffs. We assume that no prior knowledge of the factorization of a number is known. There are two main concerns that are faced when dealing with prime factorization. One is determining if we can factor the number to begin with and the other is that there is no single formula or algorithm when compared to others that uses the least amount of time for general numbers.
520 $a A proposed solution is to develop a hybrid type of algorithm. We primarily look at products of two primes that are relatively large to the number to be factored in our benchmarks. Based on certain properties or the size of a number, a particular algorithm will be chosen to either test if the number to be factored is prime or to actually factor the number. Although this hybrid algorithm does not minimize the calculation time for every number, it does reduce the calculation time in general when compared to the individual algorithms.
590 $a School code: 6060.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Mathematics. $3 515831
650 4 $a Computer Science. $3 626642
690 $a 0364
690 $a 0405
690 $a 0984
710 2 $a California State University, Fullerton. $3 1017845
773 0 $t Masters Abstracts International $g 49-01.
790 1 0 $a Wortman, Kevin, $e advisor
790 $a 6060
791 $a M.S.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1486208