|
|
|||||||
Found by accident a link to a site, that made me think of the golfing here. It's stuffed with mathematical problems and can be found right here Project Euler. Enjoy, while I go read something more understandable. Quote: What is Project Euler? Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems. The motivation for starting Project Euler, and its continuation, is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context. |
||||||||
|
|
|||||||
oh that site reminds me of when i was wanting a square root function... and had to code one. |
||||||||
|
|
|||||||
Originally Posted By: Bryce oh that site reminds me of when i was wanting a square root function... and had to code one. Problem 1 & 2 were solved pretty quick. The square root thingie is indeed a showstopper for problem 3 I've done some quick research about it, when I find some time I'll see if I can conjure up something |
||||||||
|
|
|||||||
I enjoy checking out my old threads. My gawd, I've been spewing stuff around here ;). |
||||||||
|
|
|||||||
Found this when I started to play with Python back in 2009 ... doing those problems for almost a year got me to Kix could solve only one or two of the problems there. |
||||||||
|
|
|||||||
digging around a bit, problem 500 is a giveaway with only 15% dificulty rating Quote: The number of divisors of 120 is 16. In fact 120 is the smallest number having 16 divisors. Find the smallest number with 2^500500 divisors. Give your answer modulo 500500507. Think I get a bit too old for these |
||||||||
|
|
|||||||
I've played on there some myself. Actually managed to do quite a few using only kix. It made it more challenging to say the least. |
||||||||
|
|
|||||||
Actually playing with one of my unsolved that holds potential for a golf course. It's difficulty rating is 15%, but man, that's an algorithm shizzle. Hungarian Algorithm seems to be the solution but I can't even get my head around the basics there Brute forcing this holds 15! (1307674368000) combinations. hm hm hm maybe I found another one that is not that difficult to grasp. |
||||||||
|
|
|||||||
Which question is it? About a year or so ago...I was able to solve the following (using mostly just Kix). 1,2,4-7, 9-12, 15-20, 22, 28, 31, 34, 36, 37, 39, 42, 50, 52, 67, 75, 76, 79 After that, it started getting very hard to find problems you could solve without a different language. So that's where I left it lol. |
||||||||
|
|
|||||||
Originally Posted By: ShaneEP Which question is it? won't tell.. maybe it becomes the next golf tourney |
||||||||
|
|
|||||||
Oh, yea duh. |
||||||||
|
|
|||||||
that feeling when you answer successful on ProjectEuler after 7 years of hibernation *Note the leap from 155 to 156 in the graphic above Now! Let's see what we can make of this (SFK32), so Allen finally gets to tee off here |
||||||||
|
|
|||||||
Rusty won't describe my play. |
||||||||
|
|
|||||||
nothing to be afraid of. Easy is the level, PLUS there will be a special trophy not related to strokes to win revealed in the public round |
||||||||
|
|
|||||||
well, have the Kix representation ready, steady and bulletproof now. Will try to find the time tomorrow to get it packed into the golf bag. |
||||||||
|
|
|||||||
Probably gonna need to announce this thing is coming up so we can get a hold of the golfers... this is no small feat, I know from experience |
||||||||
|
|
|||||||
Oui mon capitaine |