import java.util.scanner; public class Assigment12 { int decnumber; public Assigment12(int number,int base){ if (base == 10) this.decnumber = number;

Transcription

1 import java.util.scanner; public class Assigment12 { int decnumber; public Assigment12(int number,int base){ if (base == 10) this.decnumber = number; if (base == 2) this.decnumber = bin2dec(number); if (base == 8) this.decnumber = oct2dec(number); public Assigment12(String number){ this.decnumber = hex2dec(number); public int getnumber(int base){ int number = 0; if(base==10) number = this.decnumber; return number; public int bin2dec(int binnumber){ int number = 0; int digit =0; int base = 1; while(binnumber!=0){ digit = binnumber%10; number+=base*digit; base*=2; binnumber = (binnumber - digit)/10;

2 return number; public int oct2dec(int octnumber){ int number = 0; int digit =0; int base = 1; while(octnumber!=0){ digit = octnumber%10; number+=base*digit; base*=8; octnumber = (octnumber - digit)/10; return number; public int hex2dec(string hexnumber){ int number = 0; char digit =0; int base = 1; hexnumber = hexnumber.touppercase(); for(int i=hexnumber.length()-1; i>=0; i--){ digit = hexnumber.charat(i); switch(digit){ case '0': case '1':

3 case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': digit-=48; case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': digit-=55; default: digit=0; number+=base*digit; base*=16; return number; public boolean isprime(){

4 boolean is=true; for(int i=2;i<=this.decnumber-1;i++) if ((this.decnumber % i)==0) return false; return is; public boolean ispower2(){ return (Math.log(this.decNumber)/Math.log(2)==Math.floor(Math.log(this.decNumber)/Math.log(2))); public int GCD(int othernumber){ int m = this.decnumber; int n = othernumber; if (m < n) { int t = m; m = n; n = t; int r = m % n; if (r == 0) { return n; else { return recgdc(n, r); private int recgdc(int m, int n){ if (m < n) { int t = m;

5 m = n; n = t; int r = m % n; if (r == 0) { return n; else { return recgdc(n, r); public boolean iscoprime(int othernumber){ return (GCD(otherNumber)==1); public int tobase(int base){ int number=0; int remain=0; int quocient=this.decnumber; int basedec=1; do{ remain = quocient%base; quocient=quocient/base; number+=basedec*remain; basedec*=10; while(quocient>=1); return number;

6 public String tobase(char base){ String number=""; int remain=0; int quocient=this.decnumber; if(base!='h'&&base!='h') return "Only permit base 'H'"; base=16; do{ remain = quocient%base; quocient=quocient/base; number = "" + (((remain>=0)&&(remain<=9))?(char)(remain+48):(char)(remain+55)) + number; while(quocient>=1); return number; public int countdigit(int digit, int base){ int count=0; int tempdigit = 0; int number=tobase(base); System.out.println("Number = "+number + " Base " + base + " digit " + digit); while(number!=0){ tempdigit = number%10; number = (number - tempdigit)/10; if(digit==tempdigit) count++; return count;

7 public int countdigit(char digit, char base){ int count=0; String number=tobase(base); for(int i=0;i<number.length();i++){ if(number.charat(i)==digit) count++; return count; public String reverseorder(){ int digit = 0; int number=this.decnumber; String reversenumber = ""; while(number!=0){ digit = number%10; number = (number - digit)/10; reversenumber += "" + digit; return reversenumber; public int sumodds(){ int sum=0; int temp = this.decnumber%2==0?this.decnumber-1:this.decnumber; for(int i=temp;i>0;i=i-2) sum+=i; return sum;

8 public int sumevens(){ int sum=0; int temp = this.decnumber%2==0?this.decnumber:this.decnumber-1; for(int i=temp;i>0;i=i-2) sum+=i; return sum; static public boolean isvalid(string snumber,int base){ boolean is=true; int number = Integer.parseInt(snumber); if(base==16){ snumber=snumber.touppercase(); for(int i=0;i<snumber.length();i++) if(snumber.charat(i)<'0'&&snumber.charat(i)>'9') if(snumber.charat(i)<'a'&&snumber.charat(i)>'f') return false; else{ int digit = 0; while(number!=0){ digit = number%10; number = (number - digit)/10; if(digit>=base) return false;

9 return is; public static void main(string[] args) { Scanner in = new Scanner(System.in); String sbase=""; int base = 0; int option = 0; int number=0; char sdigit=' '; String snumber=""; Assigment12 N; do{ do{ System.out.println("Insert Base: "); sbase = in.next().touppercase(); if(sbase.equals("q")!sbase.equals("2")&&!sbase.equals("8")&&!sbase.equals("10")&&!sbase.equals(" 16")) return; base = Integer.parseInt(sbase); System.out.println("Insert number: "); snumber = in.next().touppercase(); while(!assigment12.isvalid(snumber,base)); if(base==16) N = new Assigment12(snumber); else

10 N = new Assigment12(Integer.parseInt(snumber),base); System.out.println("1. determine if it is a prime number or not"); System.out.println("2. determine if it is a power of 2 or not"); x"); System.out.println("3. determine what is the GCD of this number and a specific positive number System.out.println("4. determine if this number is co-prime with a specific number x"); System.out.println("5. determine how many times a specific digit d is repeated in its base x representation"); System.out.println(" where x is either 2, 8, 10, or 16"); System.out.println("6. provide its binary representation"); System.out.println("7. provide octal representation"); System.out.println("8. provide decimal representation"); System.out.println("9. provide its hexadecimal representation"); System.out.println("10. provide in decimal representation, its digits in reverse order"); System.out.println("11. provide in decimal representation, the sum of all odd numbers that are lesser than it"); System.out.println("12. provide in decimal representation, the sum of all even numbers that are lesser than it"); System.out.println(""); System.out.println("Choice a option"); option = in.nextint(); switch(option){ case 1: System.out.println("Is prime = " + N.isPrime()); case 2: System.out.println("Is Power2 = " + N.isPower2());

11 case 3: System.out.println("Insert positive number"); number=math.abs(in.nextint()); System.out.println("GCD is = " + N.GCD(number)); case 4: System.out.println("Insert positive number"); number=math.abs(in.nextint()); System.out.println("Are coprimes = " + N.isCoPrime(number)); case 5: System.out.println("Insert digit"); sdigit=(char)in.nextint(); System.out.println("Insert base"); base=math.abs(in.nextint()); base))); System.out.println("Count = " + ((base==16)?n.countdigit(sdigit, 'H'):N.countDigit((int)sdigit, case 6: System.out.println("Binary Representation = "+N.toBase(2)); case 7: System.out.println("Octal Representation = "+N.toBase(8)); case 8: System.out.println("Decimal Representation = "+N.toBase(10)); case 9: System.out.println("Hexadecimal Representation = "+N.toBase('H'));

12 case 10: System.out.println("Reverse Order = "+N.reverseOrder()); case 11: System.out.println("Sum Odds = "+N.sumOdds()); case 12: System.out.println("Sum Evens = "+N.sumEvens()); default: System.out.println("Invalid choice!!!"); return; while(true);