Button addd = new Button("A + B"); Button sub = new Button("A - B"); Button mul = new Button("A * B"); Button dec = new Button("Dec"); Button fac = new Button("x!"); Button gcf = new Button("GCF"); // This is the code package prog2; import java.math.BigInteger; public abstract class Biginteger extends Frame { static BigInteger a; static BigInteger b; public Biginteger(BigInteger a, BigInteger b) { this.a = a; this.b = b; } @Override public String toString() { return "Biginteger{" + "a=" + a + ", b=" + b + '}'; } //addition method static BigInteger addbig(BigInteger a, BigInteger b) { return a.add(b); } //subtraction method static BigInteger subtract(BigInteger a, BigInteger b) { return a.subtract(b); } //multiplication method static BigInteger multiply(BigInteger a, BigInteger b) { return a.multiply(b); } //division method static BigInteger divide(BigInteger a, BigInteger b) { return a.divide(b); } //modulous method static BigInteger modulous(BigInteger a, BigInteger b) { return a.remainder(b); } //GCF method static BigInteger GCF(BigInteger a, BigInteger b) { return a.gcd(b); } //LCM method static BigInteger LCM(BigInteger a, BigInteger b) { BigInteger product=a.multiply(b); BigInteger GCF= GCF(a,b); return product.divide(GCF); } //factorial method static BigInteger factorial(int a) { BigInteger fac=new BigInteger("1"); for(int i=2;i<=a;i++) { fac=fac.multiply(BigInteger.valueOf(i)); } return fac; } }
Can I get GUI code for this
These is the buttons that you need to use
//
Button addd = new Button("A + B");
Button sub = new Button("A - B");
Button mul = new Button("A * B");
Button dec = new Button("Dec");
Button fac = new Button("x!");
Button gcf = new Button("GCF");
//
This is the code
package prog2;
import java.math.BigInteger;
public abstract class Biginteger extends Frame {
static BigInteger a;
static BigInteger b;
public Biginteger(BigInteger a, BigInteger b) {
this.a = a;
this.b = b;
}
@Override
public String toString() {
return "Biginteger{" +
"a=" + a +
", b=" + b +
'}';
}
//addition method
static BigInteger addbig(BigInteger a, BigInteger b)
{
return a.add(b);
}
//subtraction method
static BigInteger subtract(BigInteger a, BigInteger b)
{
return a.subtract(b);
}
//multiplication method
static BigInteger multiply(BigInteger a, BigInteger b)
{
return a.multiply(b);
}
//division method
static BigInteger divide(BigInteger a, BigInteger b)
{
return a.divide(b);
}
//modulous method
static BigInteger modulous(BigInteger a, BigInteger b)
{
return a.remainder(b);
}
//GCF method
static BigInteger GCF(BigInteger a, BigInteger b)
{
return a.gcd(b);
}
//LCM method
static BigInteger LCM(BigInteger a, BigInteger b)
{
BigInteger product=a.multiply(b);
BigInteger GCF= GCF(a,b);
return product.divide(GCF);
}
//factorial method
static BigInteger factorial(int a)
{
BigInteger fac=new BigInteger("1");
for(int i=2;i<=a;i++)
{
fac=fac.multiply(BigInteger.valueOf(i));
}
return fac;
}
}
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 11 images
