MENENTUKAN BILANGAN PRIMA DENGAN MENGGUNAKAN PROGRAM MICROSOFT VISUAL BASIC

Fahrur Rozi, Anang (2008) MENENTUKAN BILANGAN PRIMA DENGAN MENGGUNAKAN PROGRAM MICROSOFT VISUAL BASIC. Other thesis, University of Muhammadiyah Malang.

[img]
Preview
Text
MENENTUKAN_BILANGAN_PRIMA_DENGAN_MENGGUNAKAN_PROGRAM_MICROSOFT__VISUAL_BASIC.pdf

Download (89kB) | Preview

Abstract

Prime number developed first time by Erastosthenes in the year 240 SM with creating concept seeking of prime number, then Pierre De Fermat give concept seeking of different number, and hereinafter developed by Mersenne giving concept seeking of larger ones prime number. Seeking of prime number is very tardy because in searching prime number still use the way of unassisted manual of computer. There are many computer applications able to wear to look for prime number. One of the computer applications able to use in seeking of prime number is Microsoft Visual Basic 6.0, which developed from language programming of BASIC (Beginner All-Purpose Symbolic Instruction Code). Excess of Microsoft Visual Basic 6.0 is can be used to make application base on windows, making ministrant objects of program, testing program (debugging) as well as can make program having the character of executable or earn direct run without running program initially. With a few excess had by Microsoft Visual Basic, programmer can compile program seeking of prime number using Erastosthenes, Fermat, and Mersenne formulas yielding prime number up to thousands of number. Microsoft Visual Basic used to look for prime number with Erastosthenes, Fermat, Mersenne formulas. Result of application seeking of prime number later will assist user to look for prime number according to number definition that wanted. Program seeking of this prime number earn running if program parameter not exceed boundary which have been specified in the plan its making. In the plan making, these programs have boundaries that are Erastosthenes tabulation that is smaller or equal to 65537, while number boundary to Fermat tabulation is n ≤ 4 where n represent natural number. Later, then number boundary to Mersenne tabulation is p ≤ 13 where p represent prime number. Making of this application program in general consist of some step that is design of program appearance, design of Erastosthenes tabulation, Fermat and Mersenne, and make application .EXE so that program seeking of this prime number can be running. After phase of design program finish, step hereinafter is to run program. In running program seeking of this prime number there are two step that is by running is direct of program seeking of prime number without passing process of installation second stage and is doing installation of program seeking of prime number beforehand before process seeking of prime number.

Item Type: Thesis (Other)
Subjects: L Education > L Education (General)
Divisions: Faculty of Teacher Training and Education > Department of Mathematics and Computing
Depositing User: Anggit Aldila
Date Deposited: 03 May 2012 04:49
Last Modified: 03 May 2012 04:49
URI: http://eprints.umm.ac.id/id/eprint/4067

Actions (login required)

View Item View Item