Information Search and Analysis Skill

(ISAS)

PRIME FACTORIZATION

Created By:
1. Dionisius Albertus L. L - 2120010039
2. Jeremi Lukas Susanto - 2120010251
3. Muhammad Falahul Islam - 2120010350
Faculty: Kevin Harada S.Kom
Quarter:
Class: 2 ISA 2

Gedung Engineering Center Lt.2 Fakultas Teknik Universitas Indonesia

Kampus UI Depok 16425
2022
 Preface
First, the authors would like to thank Allah SWT for the love and blessing that He
gave for us. The author also would like to say thanks to Mr. Kevin Harada S.Kom as our
faculty that always teaches us and give a lot of knowledge about how to make ISAS properly.
The purpose of this ISAS is to finish and complete the tasks given and to explain about prime
number and prime factorization algorithms. The authors choose Prime Factorization for this
ISAS topic. The authors realize that without the guidance from all who have supported us,
especially from Mr. Kevin Harada S.Kom.
The purpose of this ISAS is to explain how to use prime factorization, so user(s) can
find their factorization prime number efficiently. Hopefully, this task can be useful and
beneficial to readers and other researchers.
The authors knows that this ISAS study is far from perfect therefore the authors are
open to criticism and constructive suggestions in order to improve in making a better ISAS in
the future.

Depok, 8 Juni 2022

Author

i
 TABLE OF CONTENTS
PREFACE…………………………………………………………………………………….i
TABLE OF CONTENTS…………………………………………………………………….ii
TABLE OF FIGURE……………………………………………………………………..…iii

CHAPTER 1………………………………………………………………………………….1
INTRODUCTION……………………………………………………………………………1
I.1 Background………………………………………………………………………………. 1
I.2 Writing Objectives……………………………………………………………………….. 1
I.3 Problem Domain…………………………………………………………………………. 1
I.4 Writing Methodology……………………………………………………………………..1
I.5 Writing Framework……………………………………………………………………….1

CHAPTER II………………………………………………………………………………… 3
BASIC THEORY……………………………………………………………………………. 3
II.1 Definition of Algorithms………………………………………………………………... 3
II.2 Definition of Data Structure…………………………………………………………….. 4
II.3 Definition of Prime Factorizations……………………………………………………... 5

CHAPTER III………………………………………………………………………………...6
PROBLEM ANALYSIS…………………………………………………………………….. 6
III.1 How Prime Factorizations Works……………………………………………………… 6
III.2 Algorithm of Prime Factorizations……………………………………………………...7
III.3 Advantage(s) and Disadvantage(s)…………………………………………………….. 8

CHAPTER IV………………………………………………………………………………...9
CONCLUSION AND SUGGESTION……………………………………………………… 9
IV.1 Conclusion………………………………………………………………………………9
IV.2 Suggestion……………………………………………………………………………… 9

BIBLIOGRAPHY…………………………………………………………………………..10

ii
 TABLE OF FIGURE
Figure 1. Example of Using Algorithms for Email Validation……………………………… 3
Figure 2. Data Structure Hierarchy………………………………………………………….. 4
Figure 3. Prime Factorizations Using Tree Method…………………………………………. 6
Figure 4. Prime Factorizations Using Division Method……………………………………...6
Figure 5. The Syntax of Prime Factorization in Python……………………………………...7
Figure 6. The Output………………………………………………………………………… 7
Figure 7. The Output from the Number User’s Want……………………………………….. 7

iii
 CHAPTER I
INTRODUCTION
I.1 Background
The rapid development of technology, especially computer technology is no longer
in doubt. We also have to force ourselves to keep up with technological developments in
order to adapt and live a competitive life. Beside it, also in order not to be left behind and
belittled by others. In the world of computer programming there are algorithms and several
programming languages such as C, C++, Java, Python, and others. On this occasion we will
discuss about Algorithms and Data Structures regarding the Prime Factorization type.

I.2 Writing Objectives

The purpose of writing this paper is to provide information and description about how
to implement the algorithm of prime factorization completely.

I.3 Problem Domain

This ISAS will only discuss about the algorithm of prime factorizations.

I.4 Writing Methodology

In this study, our group used one of the methodologies, namely the qualitative
methodology. This is one of the few methods of collecting data by searching, namely getting
information by the means of research.
The qualitative method is a research method that provides an explanation using
analysis. In practice, this method is subjective in that the research process is more typical and
tends to focus more on the theoretical basis. According to Nasir, Muhammad (1988), the
notion of research methods is the main way used by researchers to achieve goals and
determine answers to the problems posed.

I.5 Writing Framework

To be more focused, then the discussion will be organized with a systematics writing
as below:
Chapter I Introduction
This chapter describes the background of the problem, the problem boundary, the
purpose of the writing, the writing methodology used, and the systematic writing of the
paper.
Chapter II Basic Theory
This chapter talks about basic theory of algorithm and data structure. It contains: The
definition, characters, and types.

1
 2

Chapter III Problem Analysis

This chapter contains definitions, ways of works, algorithm, advantages and

disadvantages of prime factorization.
Chapter IV Conclusion and Suggestion
This chapter contains conclusions of writing and suggestion result.

Bibliography
In this section contains the references that we use to make this ISAS.
 CHAPTER II
BASIC THEORY
II.1 Definition of Algorithms
Algorithms is an effective method and a set of instructions for solving a problem
systematically, structured and logically. The problem can be anything, with conditions that
must be fulfilled before running the algorithm. In some problem’s cases, an algorithm could
have an iteration and also decisions making until the problem is solved.
Algorithms have several characteristics, such as; Algorithms terminate after a fixed
number of steps; Each step in the algorithm clearly defines the action to be performed; The
steps in the algorithm define basic operations. These operations can include calculations,
input/output operations and comparisons; An algorithm accepts the input data, in a defined
format, before it can be processed; The algorithm produces one or more outputs after the
inputs are processed. The resulting information referred to as output can be displayed or
stored for future reference.

Figure 1 Example of Using Algorithms for Email Validation.

Ref: https://study.com

3
 4

II.2 Definition of Data Structure

Data structure is a different way to saving, arranging, and organizing data in a media
computer so that the data can be used efficiently. Data structure is very important in making a
system. Different structure types serve different purposes, offering data organizations, and
retrieving in addition to storage. Data structure include information about the data, as well as
applicable relationships between the data and the functions.
Data structure are essentials for managing large amount of data efficiently and can be
used to translate abstract data types into applications. For example, displaying a relational
database as a binary tree. Data structures are often classified by their characteristics. For
instance, linear or nonlinear describes chronological and unordered data, respectively.
Homogeneous describes the data that is the same type, while non-homogeneous refers to data
of various types.
Static or dynamic describes how the data structures are compiled. Beyond
characteristics, specific types of data structures align with required operations and algorithms.
This includes: arrays, which store a collection of items at adjoining memory locations; stacks
and queues, which store a collection of items in the order of operations applied; linked lists,
which store data in linear order; and tress, which store data in abstract hierarchical ways.

Figure 2 Data Structure Hierarchy

Ref: https://searchsqlserver.techtarget.com
 5

II.3 Definition of Prime Factorizations

Prime Number is any number greater than one and only divisible by itself and one.
Number one is not a prime number, because number one is not greater than one, although one
can by divisible by itself. Number two, three, five, seven and eleven are some of the
examples of the prime number, because this number is greater than one and only divisible by
itself and one. There actually many important uses for prime numbers, such as, modern
screen use them to define color intensities of pixels, computer encryption system,
cryptography, etc.
Prime factor is factor of a given number which is a prime number. Prime factor is any
of the prime numbers when being multiplied will give the original number. For example, the
prime factors of forty-two are two, three, and seven.
Prime Factorization is the process of finding a number as the result of prime numbers,
and when those numbers multiplied, it is forming the original number. There are many
methods to find a prime numbers in prime factorization of a number. But the most common
methods that are used are prime factorization using factor tree method and prime
factorization using division method.
 CHAPTER III
PROBLEM ANALYSIS
III.1 How Prime Factorizations Works
The most common methods for prime factorizations are factor tree method and
division method. In the factor tree method, first we place the number on top the factor tree as
the number that we want to find its prime factor. Then write down the pair of factors of the
first number as the branches. Then do the same thing from the last step to make another pair
of factors into branches until we get the prime factors of all the composite factors. On the
picture below (Figure 2) we can see
Prime factorization using division method is one of the most common factorizations
methods. We can use division method to find the prime factors of a number by just dividing
the number by prime numbers. We first divide the number by the smallest prime number that
are correspond to the number. Then we do the same thing, divide the quotient of the last step
by the smallest prime number until the quotient becomes one. Then multiply all the prime
factors that we found, which are the divisors. On the picture below (Figure 3) we can see the
example of division method. The result of prime factorization of number sixty are 2 * 2 * 3 *
5 * 1 and the prime numbers of number sixty are two, three and five.

Figure 3 Figure
Prime Factorizations Using Tree
4 Prime Factorizations Method
Using Division Method
Ref: https://www.cuemath.com/en-id/
Ref: https://www.cuemath.com/en-id/

5
 6

III.2 Algorithm of Prime Factorizations

Step 1 : Suppose our number is 100.
Step 2 : We find smallest prime number that actually divides 100 and we found 2.
Step 3 : Thus 100 divided by 2 become 50. Now our number becomes 50.
Step 4 : Thus 50 divided by 2 become 25. Now our number is 25.
Step 5 : We divide 25 with 5 and produces 5. Now our number is 5.
Step 6 : We find smallest prime number that actually divides 25 and we found 5.
Step 7 : We divide 25 with 5 and produces 5. Now our number is 5.
Step 8 : Since 5 is also a prime number, our smallest prime number is 5.
Step 9 : The division of 5 with 5 produces 1 and we stop the computation and gathering the
result such that 100 = 2 x 2 x 5 x 5

The author also got another example for the algorithm of the prime factorizations in
Python shown on this picture below:

Figure 5 The Syntax of Prime Factorization in Python

The picture down below is the output of the syntax from picture’s above:

Figure 6 The Output

The syntax gives users to input any number in order to find the prime factorization. On this
example, we try to input the number 620, and after we input the number, we can get the prime factor
(prime factorization) immediately:

Figure 7 The Output from the Number User's Want

 7

III.3 Advantage(s) and Disadvantage(s)

The advantages of prime factorization are:
 It is fast dan easy for find the result of prime factorization from a number.
 Programmer can use prime factorization (prime number) to make a unique code for
cryptography which the number is not too heavy for computers to store the data and
process quickly.

The disadvantages of prime factorization are:

 That it can be time-consuming with larger numbers.

 This method can only use for specific problem.
 CHAPTER IV
CONCLUSION AND SUGGESTION
IV.1 Conclusion
In computer programming world, there are algorithm, data structure, and several
programming languages. Algorithm have several characteristics and also types. This type in
algorithm and data structure as a prime number’s method. One of them is Prime
Factorization. Prime Factorization is the process of finding a number as the result of prime
numbers, and when those numbers multiplied, it is forming the original number. There are
many methods to find a prime numbers in prime factorization of a number. But the most
common methods that are used are prime factorization using factor tree method and prime
factorization using division method.

IV.2 Suggestion
To make it easier to find the factorization value of a number in the algorithm . We can
use several methods, there are factor tree method and division method. From this discussion
about ISAS, we hope that readers can find out more about Prime Factorization.

9
 BIBLIOGRAPHY
Reference(s) from site:

1. https://study.com/academy/lesson/what-is-an-algorithm-in-programming-definition-
examples-analysis.html [08/06/2022]

2. https://interestingengineering.com/the-incredible-importance-of-prime-numbers-in-daily-
life#:~:text=There%20are%20dozens%20of%20important,of%20harmonics%20in%20their
%20products [08/06/2022]

3. https://www.geeksforgeeks.org/data-structures/ [08/06/2022]

4. https://docplayer.info/163266489-Pendahuluan-a-latar-belakang-b-tujuan.html
[08/06/2022]

5. https://people.revoledu.com/kardi/tutorial/BasicMath/Prime/Algorithm-PrimeFactor.html
[08/06/2022]

6. https://www.merdeka.com/jabar/algoritma-adalah-logika-berikut-definisi-dan-ciri-cirinya-
kln.html [08/06/2022]

10