| 
									
										
										
										
											2008-02-06 00:53:18 -05:00
										 |  |  |  | ! Copyright (c) 2008 Aaron Schaefer. | 
					
						
							|  |  |  |  | ! See http://factorcode.org/license.txt for BSD license. | 
					
						
							| 
									
										
										
										
											2009-02-02 07:04:29 -05:00
										 |  |  |  | USING: kernel math math.functions math.ranges math.order | 
					
						
							| 
									
										
										
										
											2009-09-11 21:59:54 -04:00
										 |  |  |  | project-euler.common sequences layouts ;
 | 
					
						
							| 
									
										
										
										
											2008-02-06 00:53:18 -05:00
										 |  |  |  | IN: project-euler.044 | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | ! http://projecteuler.net/index.php?section=problems&id=44 | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | ! DESCRIPTION | 
					
						
							|  |  |  |  | ! ----------- | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | ! 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 is pentagonal and D = |Pk − Pj| is minimised; what is the value of D? | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | ! SOLUTION | 
					
						
							|  |  |  |  | ! -------- | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | ! Brute force using a cartesian product and an arbitrarily chosen limit. | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | <PRIVATE
 | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | : nth-pentagonal ( n -- seq )
 | 
					
						
							| 
									
										
										
										
											2009-09-11 21:59:54 -04:00
										 |  |  |  |     dup 3 * 1 - * 2 /i ; inline
 | 
					
						
							| 
									
										
										
										
											2008-02-06 00:53:18 -05:00
										 |  |  |  | 
 | 
					
						
							|  |  |  |  | : sum-and-diff? ( m n -- ? )
 | 
					
						
							| 
									
										
										
										
											2011-10-15 22:19:44 -04:00
										 |  |  |  |     [ + ] [ - ] 2bi [ pentagonal? ] both? ; inline
 | 
					
						
							| 
									
										
										
										
											2009-09-11 21:59:54 -04:00
										 |  |  |  | 
 | 
					
						
							|  |  |  |  | : euler044-step ( min m n -- min' )
 | 
					
						
							|  |  |  |  |     [ nth-pentagonal ] bi@
 | 
					
						
							|  |  |  |  |     2dup sum-and-diff? [ - abs min ] [ 2drop ] if ; inline
 | 
					
						
							| 
									
										
										
										
											2008-02-06 00:53:18 -05:00
										 |  |  |  | 
 | 
					
						
							|  |  |  |  | PRIVATE>
 | 
					
						
							|  |  |  |  | 
 | 
					
						
							|  |  |  |  | : euler044 ( -- answer )
 | 
					
						
							| 
									
										
										
										
											2009-09-29 23:27:54 -04:00
										 |  |  |  |     most-positive-fixnum | 
					
						
							| 
									
										
										
										
											2009-09-11 21:59:54 -04:00
										 |  |  |  |     2500 [1,b] [ | 
					
						
							| 
									
										
										
										
											2009-09-11 22:14:43 -04:00
										 |  |  |  |         dup [1,b] [ | 
					
						
							| 
									
										
										
										
											2009-09-11 21:59:54 -04:00
										 |  |  |  |             euler044-step | 
					
						
							|  |  |  |  |         ] with each
 | 
					
						
							|  |  |  |  |     ] each ;
 | 
					
						
							| 
									
										
										
										
											2008-02-06 00:53:18 -05:00
										 |  |  |  | 
 | 
					
						
							|  |  |  |  | ! [ euler044 ] 10 ave-time | 
					
						
							| 
									
										
										
										
											2009-09-11 22:15:48 -04:00
										 |  |  |  | ! 289 ms ave run time - 0.27 SD (10 trials) | 
					
						
							| 
									
										
										
										
											2008-02-06 00:53:18 -05:00
										 |  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2009-03-19 00:05:32 -04:00
										 |  |  |  | SOLUTION: euler044 |