get Distinct Prime Factors - Java java.lang

Java examples for java.lang:int prime

  1. HOME
  2. Java
  3. java.lang
  4. int prime

Description

get Distinct Prime Factors

Demo Code

/**/*from ww w.j a va 2 s.  co  m*/
 * $Id$
 *
 * Copyright (c) 2009 Thomas Beckmann 
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
//package com.java2s;

import java.util.ArrayList;
import java.util.List;

public class Main {
    public static List<Integer> getDistinctPrimeFactors(int n) {

        final List<Integer> factors = new ArrayList<Integer>();

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                factors.add(i);
                do
                    n /= i;
                while (n % i == 0);
            }
        }
        if (n > 1)
            factors.add(n);

        return factors;
    }

    public static List<Long> getDistinctPrimeFactors(long n) {

        final List<Long> factors = new ArrayList<Long>();

        for (long i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                factors.add(i);
                do
                    n /= i;
                while (n % i == 0);
            }
        }
        if (n > 1)
            factors.add(n);

        return factors;
    }
}

Related Tutorials