jaelz:
How much would you pay

Richhommie:

10 naira.

phpier:
do u wnt us to solve d whole problem or u av a question 2 ask ??

Richhommie:
Please can anyone in the house help me with these problems. I would really appreciate it .
Thanks in advance

Methods should be implemented in java

1. Given the functions
f(a,b)=4a - 8b=0
g(x,y)= 9x^2 - 3y=0
,implement a method that resolves
h(x,y,a,b)= 2g(x,y)^f(a,b) (^ means raised to the power)

Show results for 10 different values in a tabular form as shown below

S/n. x. y. a. b. h(x,y,a,b)
1
2
3
4
5
6
7
8
9
10



2. Given that. f(n)=f(n -1)+ f(n - 2)
where f(0)= f(1)= 5.
And n>1; implement a method for evaluating f(n) using recursion.

class NairalandSolution {

    public static double f(double a, double b){
        double result = (4 * a) - (8 *b);
        return result;
    }

    public static double g(double x, double y){
        double result = (9 * Math.pow(x, 2)) - (3*y);   
        return result;
    }

    public static double h(double x, double y, double a, double b){
        double result = 2.0 * Math.pow(g(x,y), f(a,b));  
        return result;
    }

    public static void main(String[] args) {
        double x,y,a,b;
        x = 6; y = 2; a = 6; b = 2;
        System.out.printf("S/N.\tx.\ty.\ta.\tb.\th(x,y,a,b)%n";
        for(int i = 1; i <= 10; i++){
            x += 2; y++; a += 2; b++;
            System.out.printf("%d\t%.2f\t%.2f\t%.2f\t%.2f\t%.2f%n", i, x, y, a, b, h(x,y,a,b));
        }
    }
}

class Recursion{
    public static int f(int n){
        if(n <= 1) return 5;
        else return f(n-1) + f(n-2);
    }    
    public static void main(String[] args){
        System.out.println("f(9) = " + f(9));
    }
}

nnasino:


Question 1

class NairalandSolution {

    public static double f(double a, double b){
        double result = (4 * a) - (8 *b);
        return result;
    }

    public static double g(double x, double y){
        double result = (9 * Math.pow(x, 2)) - (3*y);   
        return result;
    }

    public static double h(double x, double y, double a, double b){
        double result = 2.0 * Math.pow(g(x,y), f(a,b));  
        return result;
    }

    public static void main(String[] args) {
        double x,y,a,b;
        x = 6; y = 2; a = 6; b = 2;
        System.out.printf("S/N.\tx.\ty.\ta.\tb.\th(x,y,a,b)%n";
        for(int i = 1; i <= 10; i++){
            x += 2; y++; a += 2; b++;
            System.out.printf("%d\t%.2f\t%.2f\t%.2f\t%.2f\t%.2f%n", i, x, y, a, b, h(x,y,a,b));
        }
    }
}

Question 2

class Recursion{
    public static int f(int n){
        if(n <= 1) return 5;
        else return f(n-1) + f(n-2);
    }    
    public static void main(String[] args){
        System.out.println("f(9) = " + f(9));
    }
}