10-24-2011, 06:27 AM | #61 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
i'm seriously advocating that the quickest method would be starting at the set for Co(100) and drawing each Co(n+1) from Co(n)
__________________
~*~Lurkadurk - 1134-7796-6967~*~ |
10-24-2011, 10:26 AM | #62 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
it's predictable though
basically it comes down to an iterative process i think the hardest part would be how to arrange the arrays for optimal speed i was thinking that you would basically set it up like this: [a_2, a_3, a_5, a_7, ..., a_p] p is the largest prime below n, and the a_i are not necessarily distinct, so that when you actually wanted to find Co(n) you'd remove duplicates and add 1
__________________
~*~Lurkadurk - 1134-7796-6967~*~ Last edited by FFR4EVA_00; 10-24-2011 at 10:47 AM.. |
10-24-2011, 01:29 PM | #63 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
__________________
~*~Lurkadurk - 1134-7796-6967~*~ Last edited by FFR4EVA_00; 10-24-2011 at 03:46 PM.. |
10-24-2011, 01:50 PM | #64 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
like i said: the set doesn't have to be distinct in this arrangement
i could easily just leave empty spaces but hey, programming doesn't really like those and 16 only has one factor i have no idea what you're talking about what's going on with 21 is this: if a < b < c, then ac+b > ab+c i just threw in the snippet about testing 20 because i figured a program would try it
__________________
~*~Lurkadurk - 1134-7796-6967~*~ Last edited by FFR4EVA_00; 10-24-2011 at 01:53 PM.. |
10-24-2011, 03:26 PM | #65 |
-
Join Date: Jul 2008
Location: Malaysia
Age: 33
Posts: 1,679
|
Re: THE project euler thread
|
10-24-2011, 03:58 PM | #66 | ||
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
longgone is correct on 1 and 2
here's what you're confused about if i am right: Quote:
Quote:
__________________
~*~Lurkadurk - 1134-7796-6967~*~ |
||
10-24-2011, 04:18 PM | #67 |
FFR Player
Join Date: Oct 2011
Posts: 3
|
Re: THE project euler thread
|
10-24-2011, 04:24 PM | #68 |
FFR Player
Join Date: Oct 2011
Posts: 3
|
Re: THE project euler thread
1+64+81+25+49+11+13+17+19+23+29+31+37+41+43+47+53+59+61+67+71+73+79+83+89+97+
(95-25-19)+(91-49-13)+(88-64-11) =1356 |
10-24-2011, 04:25 PM | #69 |
FFR Player
Join Date: Sep 2005
Age: 32
Posts: 4,245
|
Re: THE project euler thread
Worked on this for a little bit one night. Did 1, 2, and 6 all in C:
Question 1: Question 2: Question 6: Easy stuff so far but I'm not really all that knowledgeable about math at all so I'm not sure how far I'll get with this lol. Last edited by fido123; 10-24-2011 at 04:28 PM.. |
10-24-2011, 04:28 PM | #70 | |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
Quote:
i heard whispers that this is true but i am trying to rigorously disprove it
__________________
~*~Lurkadurk - 1134-7796-6967~*~ Last edited by FFR4EVA_00; 10-24-2011 at 04:33 PM.. |
|
10-24-2011, 04:56 PM | #71 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
yeah, i never said what those were, i'm sorry
a_p is just the number that is divisible by p in whatever set we're looking at (since we're supposed to be looking at coprime sets there is exactly one a_p for every p but not all a_p are unique) the reason why i'm duplicating the terms is that i think it will be easier for a computer to traverse
__________________
~*~Lurkadurk - 1134-7796-6967~*~ Last edited by FFR4EVA_00; 10-24-2011 at 04:58 PM.. |
10-24-2011, 05:18 PM | #72 | |
-
Join Date: Jul 2008
Location: Malaysia
Age: 33
Posts: 1,679
|
Re: THE project euler thread
Quote:
Last edited by LongGone; 10-24-2011 at 05:22 PM.. |
|
10-24-2011, 05:22 PM | #73 |
x'); DROP TABLE FFR;--
Join Date: Nov 2010
Posts: 6,332
|
Re: THE project euler thread
Last edited by Reincarnate; 10-26-2011 at 01:41 PM.. |
10-24-2011, 06:04 PM | #74 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
@Reincarnate- that is correct, yes
now i'm messing around with a brute-force solution of sorts though, NOTHING like what i was doing before
__________________
~*~Lurkadurk - 1134-7796-6967~*~ |
10-24-2011, 07:42 PM | #75 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
__________________
~*~Lurkadurk - 1134-7796-6967~*~ |
10-24-2011, 08:19 PM | #76 |
x'); DROP TABLE FFR;--
Join Date: Nov 2010
Posts: 6,332
|
Re: THE project euler thread
congrats FFR4, nicely done
|
10-25-2011, 12:44 AM | #77 |
behanjc & me are <3'ers
Join Date: Jul 2006
Posts: 2,051
|
Re: THE project euler thread
__________________
Rhythm Simulation Guide Comments, criticism, suggestions, contributions, etc. are all welcome. Piano Etude Demon Fire sheet music |
10-25-2011, 08:53 AM | #78 |
D6 FFR Legacy Player
Join Date: Jan 2009
Age: 32
Posts: 4,342
|
Re: THE project euler thread
Got #71 with pencil and paper xD
EDIT: Nice FFREva! |
10-25-2011, 09:41 AM | #79 |
FFR Player
Join Date: Aug 2005
Location: Banned
Posts: 1,770
|
Re: THE project euler thread
http://projecteuler.net/eulerians
"For the twelve most recent problems the difference, d, in the length of time to solve the problem (in minutes) between each member and the slowest in the table is calculated and log2(max(d,2)) points are awarded." so every time someone solves the problem, the points of everyone who already solved it go up in other words cosmovibe has 8 points now
__________________
~*~Lurkadurk - 1134-7796-6967~*~ |
10-25-2011, 10:58 AM | #80 |
x'); DROP TABLE FFR;--
Join Date: Nov 2010
Posts: 6,332
|
Re: THE project euler thread
Last edited by Reincarnate; 10-25-2011 at 11:01 AM.. |
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
|
|