bilangan prima

3.5 bilangan prima

1. masalah

                  Setiap integer bisa di ekspresikan ke dalam hasil bilangna atau angka. Prima pola algoritma untuk memperhitungkan semua factor prima dan sebuah integer.

2. input dan output

A= integer

R= integer

I= integer

X=integer

X=integer

3. algoritma

A ß x div y

R ß x mod x

I ß 0

While ( r =0) or (a > y) do

If ( I :: 0) then

I= i+1

X [i] ß y

Y ß a

If r > I then

[i] = r

End while

4. test data

X=16

Y= 2

Q =16/2 =8

R=16%2=6

While (r-o) ll (Q > y) do

If (r ==0) I = [+1]

X [i] =2

X=8

5. coding

Class prima {

Friend ostream& operator << (ostream& prima&);

Friend istream& operator >>(istream& prima7);

Public;

Void prima ();

Prima ();

Private;

Int + [50],I,n;

Int Q,R,S;

};

Void prima :: prima (){

Q= n/5;

R=n%5;

I=0;

While ((r=0) ll(Q >5)0{

If (r==0){

If(r==0){

R= i+1;

F(i)=5;

N= Q; }

Else{

Q = n/5;

R= n % 5 ;}

}

If ( n> 1){

I= I + 1

F [i]=n }

}}