project euler 44

Problem 44

---

Pentagon numbers

Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are:

1, 5, 12, 22, 35, 51, 70, 92, 117, 145, …

It can be seen that P4 + P7 = 22 + 70 = 92 = P8. However, their difference, 70 − 22 = 48, is not pentagonal.

Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference are pentagonal and D = |Pk − Pj| is minimised; what is the value of D?

---

五边形数

五边形数由公式Pn=n(3n−1)/2生成。前十个五边形数是：

1, 5, 12, 22, 35, 51, 70, 92, 117, 145, …

可以看出P4 + P7 = 22 + 70 = 92 = P8。然而，它们的差70 − 22 = 48并不是五边形数。

在所有和差均为五边形数的五边形数对Pj和Pk中，找出使D = |Pk − Pj|最小的一对；此时D的值是多少？

@Test
	public void test(){
		
		Pentagonal pt = new Pentagonal(100);
		
		for( int i  = 2; ; i ++){
			for( int j = i - 1 ; j >= 1; j --){
				Long sum = pt.getPentagonalNum(i) + pt.getPentagonalNum(j);
				Long diff = pt.getPentagonalNum(i) - pt.getPentagonalNum(j);
				if( pt.isPentagonalNum(sum) && pt.isPentagonalNum(diff)){
					System.out.println("i=" + i + "j=" + j + ",diff=" + diff);
					return;
				}
			}
		}
	}
	
	public static class Pentagonal{
		
		private int n;
		private Long max;
		private Set<Long> dataSet = new HashSet<Long>();
		
		public Pentagonal( int size){
			for( int i = 0; i < size; i ++){
				
				int val = i + 1;
				dataSet.add( 1L * val * ( 3 * val - 1) / 2);
			}
			
			this.n = size ;
			this.max = 1L * size * ( 3 * size - 1) / 2;
		}
		
		public boolean isPentagonalNum(Long val){
			if( val < max){
				return dataSet.contains(val);
			}
			
			while( val > max){
				n ++;
				max = 1L * n * ( 3 * n - 1) / 2;
				dataSet.add(max);
			}
			
			return dataSet.contains(val);
		}
		
		public Long getPentagonalNum( int index){
			return 1L * index * ( 3 * index - 1) /  2;
		}
	}