## Search found 639 matches

- Mon Dec 28, 2009 9:45 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 222
- Replies:
**14** - Views:
**4999**

### Re: Problem 222

Let's say a brute force approach is supposed to not be a good idea. Look at the function that gives you the length or saved length locally. It has a property which lets you find the optimal arrangement quite easily (assuming what you're studying is mathematics or has a large mathematical component, ...

- Mon Dec 21, 2009 9:31 am
- Forum: Recreational
- Topic: Something's wrong here...
- Replies:
**1** - Views:
**1112**

### Re: Something's wrong here...

Well, it may comfort you that the term "rational integers" is used in number theory to denote the members of Z (the integers one learns about in school). So if you're talking e.g. about numbers of the form ( a + b *[radic]2) where a and b are rational integers, it is perfectly reasonable to refer to...

- Fri Dec 18, 2009 3:40 pm
- Forum: News, Suggestions, and FAQ
- Topic: Accesibility of new problems
- Replies:
**7** - Views:
**3587**

### Re: Accesibility of new problems

Problem 269 is scheduled for today, Friday, 18

Since the clock at PE is currently three hours ahead, the notification says Saturday, 12.a.m (midnight).

We are sorry about the confusion.

^{th}December, at 9 p.m. GMT.Since the clock at PE is currently three hours ahead, the notification says Saturday, 12.a.m (midnight).

We are sorry about the confusion.

- Wed Nov 18, 2009 10:37 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 264
- Replies:
**18** - Views:
**4601**

### Re: Problem 264

I'm afraid that's too low.

- Mon Nov 16, 2009 5:01 pm
- Forum: News, Suggestions, and FAQ
- Topic: Can you change my name please?
- Replies:
**7** - Views:
**2431**

### Re: Can you change my name please?

I am Eduardo here in this forum, but vareedu in Project Euler. Would you like to cange my name to Eduardo in Project Euler, please? In Project Euler: Old name: vareedu New name: Eduardo Thanks. Eduardo. There's already a user eduardo , so I don't think Eduardo would be good (I don't even know for s...

- Thu Nov 05, 2009 3:24 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 094
- Replies:
**47** - Views:
**14041**

### Re: Problem 094

You're missing some, e.g. the second smallest.

- Wed Nov 04, 2009 11:39 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 262
- Replies:
**27** - Views:
**6786**

### Re: Problem 262

Depends on your notion of "reasonable". It's too far off to be a precision error.

- Wed Nov 04, 2009 11:36 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 093
- Replies:
**52** - Views:
**13027**

### Re: Problem 093

Yes, it does count. Intermediate results need not be integers, only the final result must be an integer.

- Sun Nov 01, 2009 12:13 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 261
- Replies:
**26** - Views:
**6162**

### Re: Problem 261

Both numbers are too low.

- Sat Oct 31, 2009 4:45 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 262
- Replies:
**27** - Views:
**6786**

### Re: Problem 262

No, it would be much shorter.

- Sat Oct 31, 2009 1:45 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 259
- Replies:
**18** - Views:
**5932**

### Re: Problem 259

No, the sum is much smaller, between 10

^{10}and 10^{12}.- Sat Oct 31, 2009 1:43 pm
- Forum: News, Suggestions, and FAQ
- Topic: Request new language in drop down
- Replies:
**3** - Views:
**2190**

### Re: Request new language in drop down

'tis a dialect of Basic, isn't it?

So I suggest you choose that. If we had a separate category for every dialect of every language, that'd be too many.

Or is there a fundamental reason not to subsume vb.net under the heading Basic?

So I suggest you choose that. If we had a separate category for every dialect of every language, that'd be too many.

Or is there a fundamental reason not to subsume vb.net under the heading Basic?

- Tue Oct 27, 2009 1:30 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 251
- Replies:
**15** - Views:
**6041**

### Re: Problem 251

i have wrote a program that successfully solve the problem for 1000,10000,100000 limits for a+b+c<=1000000 i getting 82444 That's far too low, should be 171128. however i'm keep getting the wrong answer :(,the answer i reciving begin with 919 does the computations needed to achive the solution goes...

- Mon Oct 26, 2009 5:29 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 133
- Replies:
**10** - Views:
**3452**

### Re: Problem 133

Well....wouldn't 2 be one of the primes you're trying to find? But in the example, it says that ''it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can ever be a factor of R(10^n)" - and 2 is not included! ''it is remarkable that 11, 17, 41, and 73 are the onl...

- Mon Oct 26, 2009 1:43 pm
- Forum: Number Theory
- Topic: Quadratic Residues Question
- Replies:
**9** - Views:
**3839**

### Re: Quadratic Residues Question

Now I've just gotta figure out the relatively easy cases where D & m are not co-prime (for example, z 2 [cong] 36 (mod 135), where both D and m are divisible by 9). As long as p 2 divides D and m, z must be a multiple of p. Divide equation by p 2 to get w 2 [cong] ([frac]D,p 2 [/frac]) (mod ([frac]...

- Mon Oct 26, 2009 3:02 am
- Forum: Number Theory
- Topic: Quadratic Residues Question
- Replies:
**9** - Views:
**3839**

### Re: Quadratic Residues Question

What is a quadratic residue equation and how could you solve them? A question about quadratic residues 8-) And one way to solve such questions is to post them here :lol: Now the joking's done, an integer r is called a quadratic residue modulo n if there is a k with k 2 [cong] r (mod n ). So, given ...

- Sun Oct 25, 2009 1:16 am
- Forum: Number Theory
- Topic: Quadratic Residues Question
- Replies:
**9** - Views:
**3839**

### Re: Quadratic Residues Question

If a is even, a = 2 t *u, u odd (t < x), a isn't a square if t is odd, otherwise solve w 2 [cong] u (mod 2 x-t ) as above. The solutions to s 2 [cong] a (mod 2 x ) are then 2 t/2 *(k*2 x-t-1 [plusmn]w). First off, huuuuuge thanks for this. You're welcome :D It's something I've been trying to put to...

- Sun Oct 25, 2009 1:05 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 210
- Replies:
**69** - Views:
**18311**

### Re: Problem 210

I suggest you look at Thales' theorem (or its generalisation). That should tell you exactly what shape the figure is.

- Sat Oct 24, 2009 10:12 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 261
- Replies:
**26** - Views:
**6162**

### Re: Problem 261

No, the sum for 10

^{8}ends in 7.- Sat Oct 24, 2009 7:29 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 133
- Replies:
**10** - Views:
**3452**

### Re: Problem 133

Quite.