sum N Fibonnaci - Java java.lang

Java examples for java.lang:Math Algorithm

  1. HOME
  2. Java
  3. java.lang
  4. Math Algorithm

Description

sum N Fibonnaci

Demo Code

/**//from  w  w  w .j  a v a2s.c  om
 *
 * maer - Solutions to problems of Project Euler
 * Copyright (C) 2011, Sandeep Gupta
 * http://www.sangupta.com/projects/maer
 *
 * The file is licensed under the the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 */
//package com.java2s;

public class Main {
    private static double psi = (1 + Math.sqrt(5)) / 2;

    public static long sumN(long n) {
        return getFibonnaci(n + 2) - 1;
    }

    public static long getFibonnaci(long i) {
        return (long) ((Math.pow(psi, i) - Math.pow((1 - psi), i)) / Math
                .sqrt(5));
    }
}

Related Tutorials