sum First N Divisible By M - Java java.lang

Java examples for java.lang:Math Function

Description

sum First N Divisible By M

Demo Code

/**//from  ww  w  . j a v  a  2s . co  m
 *
 * 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 {
    public static long sumFirstNDivisibleByM(long n, long m) {
        return sumFirstNDivisibleByM(n, m, true);
    }

    public static long sumFirstNDivisibleByM(long n, long m,
            boolean includeN) {
        if (!includeN) {
            n -= 1;
        }
        return m * sumFirstN(n / m);
    }

    public static long sumFirstN(long n) {
        return (n * (n + 1)) / 2;
    }
}

Related Tutorials