JAVA+MATH EXAM [PAYING BTC]

[maybach1980]

Have an exam who need skills on math and java
if anyone is good at them please pm me your skype

example of a question :

The Fibonacci sequence of numbers is 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The first and second numbers are 1 and after that ni = ni-2 + ni-1, e.g., 34 = 13 + 21. A number in the sequence is called a Fibonacci number. Write a method with signature int closestFibonacci(int n) which returns the largest Fibonacci number that is less than or equal to its argument. For example, closestFibonacci(12) returns 8 because 8 is the largest Fibonacci number less than 12 and closestFibonacci(33) returns 21 because 21 is the largest Fibonacci number that is <= 33. closestFibonacci(34) should return 34. If the argument is less than 1 return 0. Your solution must not use recursion because unless you cache the Fibonacci numbers as you find them, the recursive solution recomputes the same Fibonacci number many times.

PM me skype/whatever im you use.... + your price

[1715184560]

1715184560

[1715184560]

1715184560

[1715184560]

1715184560

[1715184560]

1715184560

[1715184560]

1715184560

[maybach1980]

paying 20$ / btc....

[SummerBliss]

Hi, I could try to help you with that. My skype is enilk09.

[Coding Enthusiast]

Code written in C♯: https://gist.github.com/Coding-Enthusiast/40bf7e9b7780eaa6b6f07f257acf2fe7
Ways to contact: comment on the gist, or PM me here
Price: Free!

I just did it for fun, and since Java and C♯ are really close.

Some results:

Code:

Number: 0
Closest Fibonachi is: 0

Number: 1
Closest Fibonachi is: 1

Number: 12
Closest Fibonachi is: 8

Number: 33
Closest Fibonachi is: 21

Number: 34
Closest Fibonachi is: 34

[MagicIsMe]

This seems doable. Similar problems can be seen on Project Euler (which I have experience in), so I'll take a shot at it.

You can contact me via Skype at the username I sent through PM.

[maybach1980]

so far no one said he can do.....

[jambola2]

I'll complete it right now, and I'll post some images of how it looks running.
Send me a PM with what proof of completion you'll need.
Code will be given upon 50% payment with rest of payment after verification.

Completed, proof:



Basic invalid data catching:

[MagicIsMe]

so far no one said he can do.....

You still haven't responded on Skype. I sent the code for what you were after to prove I can do this.

[fsb4000]

Code:

int closestFibonacci(int n)
{
    int current = 0;
    int next = 1;
    while (n >= next) {
        long temp = (long)current + (long)next;
        if (temp > 2147483647) {  // 2,147,483,647 - this is maximal int value
            return next;
        }
        current = next;
        next = (int)temp;
    }
    return current;
}

[arunka71]

http://mathworld.wolfram.com/BinetsFibonacciNumberFormula.html

should be faster?

[TriggerX]

I am interested in this. I PM'd you my skype. Could you elaborate on what you need to do?

[bitkng]

Iam good at math but not at java