## Search found 165 matches

- Mon Aug 10, 2015 3:49 pm
- Forum: Number
- Topic: nth Root Algorithm
- Replies:
**2** - Views:
**7765**

### nth Root Algorithm

I've found this n-th root algorithm in Richard P. Brent's book "Modern Computer Arithmetic". The power function was inserted by me to get the algorithm to work with bigints if necessary. D's internal ^^ operator for powers only works with purely numerical values. Anyway, I've tried the algorithm an ...

- Thu Aug 06, 2015 11:16 pm
- Forum: News, Suggestions, and FAQ
- Topic: PE has been hacked (02/08/2015 00:42 CEST)
- Replies:
**36** - Views:
**10412**

### Re: PE has been hacked (02/08/2015 00:42 CEST)

Maybe an admin has some update to cut the speculations

- Thu Aug 06, 2015 5:26 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 221
- Replies:
**12** - Views:
**5367**

### Re: Problem 221

I've iterated my way into this, but I've encountered an issue, which keeps me wondering. My code is ready to run, and it does find the correct answer...but not in the right spot. Would somebody care to take a look? edit Top of the evening. Solved this one. Had an overflow, temporary big integer help...

- Sun Aug 02, 2015 6:29 pm
- Forum: News, Suggestions, and FAQ
- Topic: PE has been hacked (02/08/2015 00:42 CEST)
- Replies:
**36** - Views:
**10412**

### Re: PE has been hacked (02/08/2015 00:42 CEST)

@nicolas and others: For those who want to solve problems, despite the absence of PE, you could try the Wayback Machine on https://archive.org. Of course, one cannot have their results checked.

- Sun Aug 02, 2015 5:11 pm
- Forum: News, Suggestions, and FAQ
- Topic: PE has been hacked (02/08/2015 00:42 CEST)
- Replies:
**36** - Views:
**10412**

### Re: PE has been hacked (02/08/2015 00:42 CEST)

Alas, I can't see your image, only the word "image".nicolas.patrois wrote:Can we have a pdf with all the problems, please?

Note that the imagelet in the signature still work.

- Wed Jul 29, 2015 8:35 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies:
**37** - Views:
**11330**

### Re: Problem 149

Never mind. I think I've worked it out...

- Tue Jul 28, 2015 8:11 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies:
**37** - Views:
**11330**

### Re: Problem 149

Since I've read that in several publications... Do you, too, consider the maximum subsequence sum = 0 if all items in that sequence are < 0? Can you check my results and tell which are wrong: max in rows: 13414319 max in columns: 11593776 max in anti-diagonals: 10284763 max in diagonals: 10785046 Sp...

- Tue Jul 28, 2015 4:58 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies:
**37** - Views:
**11330**

### Re: Problem 149

Once again you saved my day, jaap!

I'd mistaken the compiler to internally use maximum precision, but I failed.

I'd mistaken the compiler to internally use maximum precision, but I failed.

- Tue Jul 28, 2015 12:53 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies:
**37** - Views:
**11330**

### Re: Problem 149

Alas, no. I am getting s[10] correctly, but for some weird reason s[100] is always -357419. I just don't see what I might be missing... [edit] I've also tested things in D: import std.stdio, std.algorithm, std.container; immutable uint MAX_LENGTH = 4_000_000; int main() { uint k; long j; /* fill arr...

- Tue Jul 28, 2015 12:23 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies:
**37** - Views:
**11330**

### Re: Problem 149

It's like this in Pascal. const MAX_LENGTH = 4000000; var s: array of longint; k: longint; begin setlength(s, MAX_LENGTH+1); { LFG: fill array } for k := 1 to 55 do s[k] := ((100003 - 200003*k + 300007*k*k*k) mod 1000000) - 500000; for k := 56 to MAX_LENGTH do s[k] := ((s[k-24] + s[k-55] + 1000000) ...

- Tue Jul 28, 2015 11:05 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies:
**37** - Views:
**11330**

### Re: Problem 149

I've been trying to squeeze the correct values out of that LFG. I am getting s[10] correctly, but for some weird reason s[100] is always -357419. I don't think there's an overflow. What could possibly go wrong with s[k] = ((s[k-24] + s[k-55] + 1000000) mod 1000000) - 500000? Could someone be so kind...

- Thu Jul 09, 2015 3:05 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 195
- Replies:
**16** - Views:
**5239**

### Re: Problem 195

Whatever...

Is a=7, b=3, c=8 considered the same as a=7,b=8,c=3, so the count is 1? Or are they taken to be 2 different triangles?

Is a=7, b=3, c=8 considered the same as a=7,b=8,c=3, so the count is 1? Or are they taken to be 2 different triangles?

- Wed Jul 08, 2015 7:49 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 195
- Replies:
**16** - Views:
**5239**

### Re: Problem 195

Then why do you write some?

- Wed Jul 08, 2015 5:29 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 195
- Replies:
**16** - Views:
**5239**

### Re: Problem 195

According to the description I should be right to assume that

**is not necessarily an integer either?***r*- Fri Jul 03, 2015 8:36 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 165
- Replies:
**41** - Views:
**13788**

### Re: Problem 165

From the description I gather that line segments created with that BBS thing are immutable? E. g. t[0;1]-t[2;3], t[4;5]-t[6;7] etc. Or is it that only two consecutive numbers out of t[] make a point which is then combined with another point to give a line? What I'm talking about is, can a line be ma...

- Fri May 22, 2015 1:08 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 245
- Replies:
**16** - Views:
**6291**

### Re: Problem 245

I'm advancing on this one *heavy breathing*

If I set the maximum composite to 100,000 instead of 2*10^11 I get a total sum of 595,394 out of 22 numbers. Could this be?

If I set the maximum composite to 100,000 instead of 2*10^11 I get a total sum of 595,394 out of 22 numbers. Could this be?

- Sun May 10, 2015 8:07 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 228
- Replies:
**6** - Views:
**2288**

### Re: Problem 228

I have a question about "adding the polygons"... Say, there are two polygons, A and B, determined by the points A{(Pa1),...,(Pan)} and B{(Pb1),...,(Pbn)}. According to Wiki the sum is for An = 3 and Bn = 4 the following: S{(a1+b1),(a1+b2),(a1+b3),(a1+b4),(a2+b1),(a2+b2),(a2+b3),(a2+b4),(a3+b1),(a3+b...

- Wed May 06, 2015 9:17 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 157
- Replies:
**21** - Views:
**8066**

### Re: Problem 157

Hmm, back after some time off I seem to have picked a "nice" one...

I've tried to brute-force my way into this and get e.g. 102 fractions for n = 2 and *56 for n = 3. I'm somewhat doubtful that this is correct...

I've tried to brute-force my way into this and get e.g. 102 fractions for n = 2 and *56 for n = 3. I'm somewhat doubtful that this is correct...

- Sun Apr 26, 2015 10:42 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 168
- Replies:
**30** - Views:
**9430**

### Re: Problem 168

No? Hmm.... I guess I'd misread the description. Should be 98,331...

- Sun Apr 26, 2015 10:29 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 168
- Replies:
**30** - Views:
**9430**

### Re: Problem 168

Considering a maximum of 10^6, the desired sum would be 98376?