## Search found 5 matches

Tue Jan 22, 2019 1:31 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 175
Replies: 4
Views: 2218

### Re: Problem 175

While investigating problem 175 I calculated that f(242)=13 and f(241) = 17, using the function developed for problem 169. However the problem statement for 175 states that f(241) = 13 and f(240) =17. Which of us is right?
Sat Nov 04, 2017 3:29 pm
Forum: Resources
Topic: Diophantine Equations
Replies: 0
Views: 7825

### Diophantine Equations

A few problems require solutions to Diophantine Equations like Ax 2 + Bxy + Cy 2 + Dx + Ey + F = 0. I tried using Dario Alpert's web page but could not get it to work. I believe this is because it is written in java and browsers nowadays don't like java because of security issues. I downloaded the s...
Tue Sep 06, 2016 12:43 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 259
Replies: 19
Views: 7546

### Re: Problem 259

My problem is that I get the solution but it takes nearly 15 minutes. I took some measurements and I am evaluating 3,392,923,553 expressions, about 3,951,693 per second, which actually seems quite fast. I just don't see how it can be done in 1 minute. An approximate calculation for the number of exp...
Wed Nov 04, 2015 7:13 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 037
Replies: 45
Views: 11959

### Problem 37

Unfortunately, if you..

[moderator]
removed spoilers
[/moderator]
Wed Nov 04, 2015 6:37 pm
Forum: Programming languages
Topic: Big Integers in C++ [Partially solved]
Replies: 8
Views: 11199

### Re: Big Integers in C++ [Partially solved]

Use the GMP arbitrary precision arithmetic library. It's free, and probably one of the better ones you can use. Factorial example: void Factorial(unsigned n, mpz_t& result) { mpz_set_ui(result, 1); for (unsigned i = 1; i <= n; ++i) mpz_mul_ui(result, result, i); } If using Windows and Visual Studio...