67aaa1f
committed
Commits
Comments (0)
Files changed (3)

+33 0src/projectEuler/1.go

+53 0src/projectEuler/2.go

+30 0src/projectEuler/3.go
src/projectEuler/1.go
+//Copyright (C) 2012 Eric Chen(G+ page:HencriceFOSS, gmail:hencrice+FOSS+introtoalgorithm3ed@gmail.com)
+//introtoalgorithm3ed is a free software; you can redistribute it and/or modify it under the terms of the GNU General
+//Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option)
+//This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+//implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+//You should have received a copy of the GNU General Public License along with this source file; if not, write to the
+//The file contains all the 100,000 integers between 1 and 100,000 (including both) in some random order(no integer is repeated).
+ If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these
src/projectEuler/2.go
+//Copyright (C) 2012 Eric Chen(G+ page:HencriceFOSS, gmail:hencrice+FOSS+introtoalgorithm3ed@gmail.com)
+//introtoalgorithm3ed is a free software; you can redistribute it and/or modify it under the terms of the GNU General
+//Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option)
+//This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+//implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+//You should have received a copy of the GNU General Public License along with this source file; if not, write to the
+//The file contains all the 100,000 integers between 1 and 100,000 (including both) in some random order(no integer is repeated).
+ Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2,
+ By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the
+ /*I find that Fibonnacci sequence has a pattern beginning from 3, namely, (odd,odd,even),(odd,odd,even)......
src/projectEuler/3.go
+//Copyright (C) 2012 Eric Chen(G+ page:HencriceFOSS, gmail:hencrice+FOSS+introtoalgorithm3ed@gmail.com)
+//introtoalgorithm3ed is a free software; you can redistribute it and/or modify it under the terms of the GNU General
+//Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option)
+//This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the
+//implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+//You should have received a copy of the GNU General Public License along with this source file; if not, write to the
+//The file contains all the 100,000 integers between 1 and 100,000 (including both) in some random order(no integer is repeated).
+ //The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?