Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.math.BigInteger;
- import java.util.ArrayList;
- import java.util.List;
- public class Generador {
- public static void main(String[] args) {
- int num = 10000;
- List<BigInteger> fib = new ArrayList<BigInteger>();
- BigInteger fib0 = BigInteger.ZERO;
- BigInteger fib1 = BigInteger.ONE;
- BigInteger tmp = BigInteger.ZERO;
- fib.add(fib0);
- fib.add(fib1);
- for(int x = 0; x < num; x++) {
- tmp = fib1;
- fib1 = fib0.add(fib1);
- fib0 = tmp;
- fib.add(fib1);
- }
- // tomando una posicion x
- // a = x, b = x + 1, c = x + 2, d = x + 3
- // (a * c) + (b * d) = y
- // la posicion de y = x + (x + 3) = 2x + 3
- BigInteger a, b, c, d, y, yPos;
- for(int x = 0; x < fib.size() - 3; x++) {
- a = fib.get(x);
- b = fib.get(x + 1);
- c = fib.get(x + 2);
- d = fib.get(x + 3);
- y = a.multiply(c).add(b.multiply(d));
- if(y.isProbablePrime(10))
- System.out.println(y);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement