![]() |
#261 |
x'); DROP TABLE FFR;--
![]() ![]() Join Date: Nov 2010
Posts: 6,332
|
![]() Not every problem can be done with pencil and paper.
|
![]() |
![]() |
![]() |
#262 |
I am leonid
![]() ![]() ![]() ![]() ![]() Join Date: Oct 2008
Location: MOUNTAIN VIEW
Age: 35
Posts: 8,080
|
![]() ![]() Rubix sent me to solve this A bit of paperwork and then lots of wolframalpha |
![]() |
![]() |
![]() |
#263 |
x'); DROP TABLE FFR;--
![]() ![]() Join Date: Nov 2010
Posts: 6,332
|
![]() Nicely done
|
![]() |
![]() |
![]() |
#264 |
behanjc & me are <3'ers
![]() ![]() Join Date: Jul 2006
Posts: 2,051
|
![]() sorry I should've been more clear
I was referring to problem nine specifically, involving pythagorean triples
__________________
Rhythm Simulation Guide Comments, criticism, suggestions, contributions, etc. are all welcome. Piano Etude Demon Fire sheet music |
![]() |
![]() |
![]() |
#265 |
Digital Dancing!
![]() ![]() ![]() ![]() ![]() Join Date: Feb 2006
Location: 80 billion club, NE
Age: 31
Posts: 12,982
|
![]() brute forcing 12 and it's not going so well. I'm almost an hour in and still no solution.
Code:
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... Let us list the factors of the first seven triangle numbers: 1: 1 3: 1,3 6: 1,2,3,6 10: 1,2,5,10 15: 1,3,5,15 21: 1,3,7,21 28: 1,2,4,7,14,28 We can see that 28 is the first triangle number to have over five divisors. What is the value of the first triangle number to have over five hundred divisors?
__________________
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Last edited by rushyrulz; 05-21-2014 at 06:34 PM.. |
![]() |
![]() |
![]() |
#266 |
x'); DROP TABLE FFR;--
![]() ![]() Join Date: Nov 2010
Posts: 6,332
|
![]() using brute force = not very interesting
usually more fun to try for the faster approaches |
![]() |
![]() |
![]() |
#267 |
Digital Dancing!
![]() ![]() ![]() ![]() ![]() Join Date: Feb 2006
Location: 80 billion club, NE
Age: 31
Posts: 12,982
|
![]() I'm sure there's a very elegant mathematical solution for all of these, but I'm just trying to get as far as I can :P
__________________
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#268 |
behanjc & me are <3'ers
![]() ![]() Join Date: Jul 2006
Posts: 2,051
|
![]() I did the first 30 (excluding 12) and even a couple of the 300+ ones before I figured out 12. I don't know why but that one was hard for me
__________________
Rhythm Simulation Guide Comments, criticism, suggestions, contributions, etc. are all welcome. Piano Etude Demon Fire sheet music |
![]() |
![]() |
![]() |
#269 |
Digital Dancing!
![]() ![]() ![]() ![]() ![]() Join Date: Feb 2006
Location: 80 billion club, NE
Age: 31
Posts: 12,982
|
![]() Probably since there are so many different things you need to account for in 12. Not only do you need a gigantic 500+ factor number, but it also needs to be a summation of n number which is tricky to check for.
__________________
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#270 |
One-handed elite
![]() Join Date: May 2008
Posts: 1,464
|
![]() My brute force of 12 took 15 seconds to run.
__________________
The renegade has betrayed me. |
![]() |
![]() |
![]() |
#271 |
FFR Veteran
![]() ![]() Join Date: Oct 2008
Location: Canada
Posts: 448
|
![]() does project euler ever teach you algorithms, e.x. dynamic programming, breadth/depth first search
|
![]() |
![]() |
![]() |
#272 |
Digital Dancing!
![]() ![]() ![]() ![]() ![]() Join Date: Feb 2006
Location: 80 billion club, NE
Age: 31
Posts: 12,982
|
![]() Project Euler doesn't directly 'teach' you anything.
__________________
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#273 |
FFR Veteran
![]() ![]() Join Date: Oct 2008
Location: Canada
Posts: 448
|
![]() |
![]() |
![]() |
![]() |
#274 |
Digital Dancing!
![]() ![]() ![]() ![]() ![]() Join Date: Feb 2006
Location: 80 billion club, NE
Age: 31
Posts: 12,982
|
![]() It's basically algorithm development, and if dynamic programming, breadth/depth first search is required for efficiency sake, then yes.
Also, rewrote my factorization algorithm and I solved 12 in 5 seconds :P
__________________
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#275 | |
x'); DROP TABLE FFR;--
![]() ![]() Join Date: Nov 2010
Posts: 6,332
|
![]() Quote:
even more so once you start venturing into the harder stages (where the problems also become much more interesting) DP, especially, is used quite often Last edited by Reincarnate; 05-21-2014 at 08:51 PM.. |
|
![]() |
![]() |
![]() |
#276 |
x'); DROP TABLE FFR;--
![]() ![]() Join Date: Nov 2010
Posts: 6,332
|
![]() For example, try your hand at any of these:
http://projecteuler.net/problem=161 http://projecteuler.net/problem=425 http://projecteuler.net/problem=442 Last edited by Reincarnate; 05-21-2014 at 08:47 PM.. |
![]() |
![]() |
![]() |
#277 |
x'); DROP TABLE FFR;--
![]() ![]() Join Date: Nov 2010
Posts: 6,332
|
![]() And of course, (some) of the big kahunas that will require both mathematical and programmatical sorcery:
http://projecteuler.net/problem=289 http://projecteuler.net/problem=328 http://projecteuler.net/problem=344 http://projecteuler.net/problem=361 http://projecteuler.net/problem=415 |
![]() |
![]() |
![]() |
#278 |
Digital Dancing!
![]() ![]() ![]() ![]() ![]() Join Date: Feb 2006
Location: 80 billion club, NE
Age: 31
Posts: 12,982
|
![]() you almost have to be too smart...
__________________
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#279 |
behanjc & me are <3'ers
![]() ![]() Join Date: Jul 2006
Posts: 2,051
|
![]() ohhhh the eulerian circle one looks cool
really tempted to try that one lol
__________________
Rhythm Simulation Guide Comments, criticism, suggestions, contributions, etc. are all welcome. Piano Etude Demon Fire sheet music |
![]() |
![]() |
![]() |
#280 |
FFR Veteran
![]() ![]() Join Date: Oct 2008
Location: Canada
Posts: 448
|
![]() ohoho this will be fun, i should get back to project euler
|
![]() |
![]() |
![]() |
Currently Active Users Viewing This Thread: 2 (0 members and 2 guests) | |
|
|