<< problem 107 - Minimal network | Darts - problem 109 >> |
Problem 108: Diophantine reciprocals I
(see projecteuler.net/problem=108)
In the following equation x, y, and n are positive integers.
dfrac{1}{x} + dfrac{1}{y} = dfrac{1}{n}
For n = 4 there are exactly three distinct solutions:
dfrac{1}{5} + dfrac{1}{20} = dfrac{1}{4}
dfrac{1}{6} + dfrac{1}{12} = dfrac{1}{4}
dfrac{1}{8} + dfrac{1}{8} = dfrac{1}{4}
What is the least value of n for which the number of distinct solutions exceeds one-thousand?
NOTE: This problem is an easier version of Problem 110; it is strongly advised that you solve this one first.
My Algorithm
It's safe to assume x <= y. Moreover, x > n because frac{1}{x} < frac{1}{n}. That means y > n, too.
There must be some a and b such that x = n + a and y = n + b.
The original equation becomes:
dfrac{1}{n + a} + dfrac{1}{n + b} = dfrac{1}{n}
Multiply both sides by n:
dfrac{n}{n + a} + dfrac{n}{n + b} = dfrac{n}{n} = 1
Multiply by n+a:
dfrac{n(n+a)}{n + a} + dfrac{n(n+a)}{n + b} = n + a
n + dfrac{n(n+a)}{n + b} = n + a
And the same for n+b:
n(n+b) + dfrac{n(n+a)(n+b)}{n + b} = (n + a)(n + b)
n(n+b) + n(n+a) = (n + a)(n + b)
Simplify:
n^2 + nb + n^2 + na = n^2 + na + nb + ab
n^2 = ab
In the example where n=4 you can compute x = n + a → 5 = 4 + a → a = 1 and because of y = n + b → b = 16.
Indeed, ab = 1 * 16 = 16 = 4^2 = n^2.
(And for the other two solutions: ab = (6-4) * (12-4) = 16 = n^2 and ab = (8-4) * (8-4) = 16 = n^2).
What does it mean ? Well, finding all ab = n^2 produces all solutions.
The number of solutions is the number of divisors of n^2.
My first attempt was based on brute force and is at the end of the code (it's not used anymore).
A smarter approach is to perform a prime factorization.
A high number of divisors means that prime factors must be small.
To speed up the program I abort when a prime factor > 100 is left. This is kind of cheating ... and roughly 100x faster.
Modifications by HackerRank
I didn't notice that prime factorization of n^2 can be reduced to a slightly modified prime factorization of n.
Thanks to www.mathblog.dk/project-euler-108-diophantine-equation/ where I found that trick (see numSquareDivisors
)
The code becomes much faster but I kept my old code numDivisors
for the original problem.
However, I still time-out on two thirds of the test cases (my old code timed out in 80% of all cases).
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This live test is based on the Hackerrank problem.
This is equivalent toecho "1 3" | ./108
Output:
(this interactive test is still under development, computations will be aborted after one second)
My code
… was written in C++11 and can be compiled with G++, Clang++, Visual C++. You can download it, too.
The code contains #ifdef
s to switch between the original problem and the Hackerrank version.
Enable #ifdef ORIGINAL
to produce the result for the original problem (default setting for most problems).
#include <iostream>
//#define ORIGINAL
// count divisors
unsigned long long numDivisors(unsigned long long n)
{
unsigned int result = 1;
auto reduce = n;
// trial division by all prime numbers
// => I didn't precompute a sieve, therefore divide by 2 and all odd numbers
for (unsigned long long divisor = 2; divisor <= reduce; divisor++)
{
// 2 is the only even prime number
if (divisor % 2 == 0 && divisor > 2)
divisor++;
if (divisor > 100) // WARNING: unsafe speed optimization !
break; // returns correct values for original problem but fails for some Hackerrank test cases
unsigned int exponent = 0;
while (reduce % divisor == 0)
{
exponent++;
reduce /= divisor;
}
result *= exponent + 1;
}
return result;
}
// count divisors of n^2, note: parameter is n, not n^2 (this is different from my old code in numDivisors)
unsigned long long numSquareDivisors(unsigned long long n)
{
unsigned int result = 1;
auto reduce = n;
// trial division by all prime numbers
// => I didn't precompute a sieve, therefore divide by 2 and all odd numbers
for (unsigned long long divisor = 2; divisor <= reduce; divisor++)
{
// 2 is the only even prime number
if (divisor % 2 == 0 && divisor > 2)
divisor++;
unsigned int exponent = 0;
while (reduce % divisor == 0)
{
exponent++;
reduce /= divisor;
}
result *= 2*exponent + 1; // changed vs. my code: times 2
}
return result;
}
int main()
{
#ifdef ORIGINAL
unsigned long long n = 1;
unsigned long long threshold = 1000;
while (true)
{
auto divisors = numDivisors(n * n);
// a and b are interchangeable therefore only half of the solutions are "unique"
auto half = (divisors + 1) / 2; // plus 1 because n^2 is obviously a square number
if (half >= threshold)
{
std::cout << n << std::endl;
break;
}
// check next square number
n++;
}
#else
unsigned int tests;
std::cin >> tests;
while (tests--)
{
// find the number of solutions
unsigned long long n;
std::cin >> n;
auto divisors = numSquareDivisors(n);
// a and b are interchangeable therefore only half of the solutions are "unique"
auto half = (divisors + 1) / 2; // plus 1 because n^2 is obviously a square number
std::cout << half << std::endl;
}
#endif
return 0;
}
// my initial brute force solution
int bruteForce(unsigned int threshold)
{
unsigned long long n = 4;
while (true)
{
unsigned int solutions = 0;
// try all values between n+1 ... 2n
for (unsigned long long x = n + 1; x <= 2*n; x++)
{
// the same as 1/x + 1/y = 1/n
auto y = n*x / (x - n);
// integer arithmetic might produce a wrong result, re-compute the formula backwards
if (y * (x - n) != n*x)
continue;
// exhausted ?
if (y < x)
break;
// valid solution
solutions++;
}
if (solutions > threshold)
break;
n++;
}
std::cout << n << std::endl;
return 0;
}
This solution contains 28 empty lines, 19 comments and 4 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.12 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
(compiled for x86_64 / Linux, GCC flags: -O3 -march=native -fno-exceptions -fno-rtti -std=gnu++11 -DORIGINAL
)
See here for a comparison of all solutions.
Note: interactive tests run on a weaker (=slower) computer. Some interactive tests are compiled without -DORIGINAL
.
Changelog
May 12, 2017 submitted solution
May 16, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler108
My code solves 5 out of 12 test cases (score: 36.36%)
I failed 7 test cases due to wrong answers and 0 because of timeouts
Difficulty
Project Euler ranks this problem at 30% (out of 100%).
Hackerrank describes this problem as easy.
Note:
Hackerrank has strict execution time limits (typically 2 seconds for C++ code) and often a much wider input range than the original problem.
In my opinion, Hackerrank's modified problems are usually a lot harder to solve. As a rule thumb: brute-force is rarely an option.
Links
projecteuler.net/thread=108 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
C# www.mathblog.dk/project-euler-108-diophantine-equation/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/108.cs (written by Haochen Liu)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-108.py (written by Hugh Brown)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p108.py (written by Nayuki)
Python github.com/steve98654/ProjectEuler/blob/master/108.py
C++ github.com/roosephu/project-euler/blob/master/108.cpp (written by Yuping Luo)
Java github.com/dcrousso/ProjectEuler/blob/master/PE108.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p108.java (written by Nayuki)
Go github.com/frrad/project-euler/blob/master/golang/Problem108.go (written by Frederick Robinson)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p108.mathematica (written by Nayuki)
Mathematica github.com/steve98654/ProjectEuler/blob/master/108.nb
Scala github.com/samskivert/euler-scala/blob/master/Euler108.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/108-Diophantine-reciprocals-1.pl (written by Gustaf Erikson)
Perl github.com/shlomif/project-euler/blob/master/project-euler/108/euler-108.pl (written by Shlomi Fish)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p108.rs
Those links are just an unordered selection of source code I found with a semi-automatic search script on Google/Bing/GitHub/whatever.
You will probably stumble upon better solutions when searching on your own.
Maybe not all linked resources produce the correct result and/or exceed time/memory limits.
Heatmap
Please click on a problem's number to open my solution to that problem:
green | solutions solve the original Project Euler problem and have a perfect score of 100% at Hackerrank, too | |
yellow | solutions score less than 100% at Hackerrank (but still solve the original problem easily) | |
gray | problems are already solved but I haven't published my solution yet | |
blue | solutions are relevant for Project Euler only: there wasn't a Hackerrank version of it (at the time I solved it) or it differed too much | |
orange | problems are solved but exceed the time limit of one minute or the memory limit of 256 MByte | |
red | problems are not solved yet but I wrote a simulation to approximate the result or verified at least the given example - usually I sketched a few ideas, too | |
black | problems are solved but access to the solution is blocked for a few days until the next problem is published | |
[new] | the flashing problem is the one I solved most recently |
I stopped working on Project Euler problems around the time they released 617.
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 |
51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 |
76 | 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 |
101 | 102 | 103 | 104 | 105 | 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 |
126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | 146 | 147 | 148 | 149 | 150 |
151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 |
176 | 177 | 178 | 179 | 180 | 181 | 182 | 183 | 184 | 185 | 186 | 187 | 188 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 200 |
201 | 202 | 203 | 204 | 205 | 206 | 207 | 208 | 209 | 210 | 211 | 212 | 213 | 214 | 215 | 216 | 217 | 218 | 219 | 220 | 221 | 222 | 223 | 224 | 225 |
226 | 227 | 228 | 229 | 230 | 231 | 232 | 233 | 234 | 235 | 236 | 237 | 238 | 239 | 240 | 241 | 242 | 243 | 244 | 245 | 246 | 247 | 248 | 249 | 250 |
251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | 263 | 264 | 265 | 266 | 267 | 268 | 269 | 270 | 271 | 272 | 273 | 274 | 275 |
276 | 277 | 278 | 279 | 280 | 281 | 282 | 283 | 284 | 285 | 286 | 287 | 288 | 289 | 290 | 291 | 292 | 293 | 294 | 295 | 296 | 297 | 298 | 299 | 300 |
301 | 302 | 303 | 304 | 305 | 306 | 307 | 308 | 309 | 310 | 311 | 312 | 313 | 314 | 315 | 316 | 317 | 318 | 319 | 320 | 321 | 322 | 323 | 324 | 325 |
326 | 327 | 328 | 329 | 330 | 331 | 332 | 333 | 334 | 335 | 336 | 337 | 338 | 339 | 340 | 341 | 342 | 343 | 344 | 345 | 346 | 347 | 348 | 349 | 350 |
351 | 352 | 353 | 354 | 355 | 356 | 357 | 358 | 359 | 360 | 361 | 362 | 363 | 364 | 365 | 366 | 367 | 368 | 369 | 370 | 371 | 372 | 373 | 374 | 375 |
376 | 377 | 378 | 379 | 380 | 381 | 382 | 383 | 384 | 385 | 386 | 387 | 388 | 389 | 390 | 391 | 392 | 393 | 394 | 395 | 396 | 397 | 398 | 399 | 400 |
401 | 402 | 403 | 404 | 405 | 406 | 407 | 408 | 409 | 410 | 411 | 412 | 413 | 414 | 415 | 416 | 417 | 418 | 419 | 420 | 421 | 422 | 423 | 424 | 425 |
426 | 427 | 428 | 429 | 430 | 431 | 432 | 433 | 434 | 435 | 436 | 437 | 438 | 439 | 440 | 441 | 442 | 443 | 444 | 445 | 446 | 447 | 448 | 449 | 450 |
451 | 452 | 453 | 454 | 455 | 456 | 457 | 458 | 459 | 460 | 461 | 462 | 463 | 464 | 465 | 466 | 467 | 468 | 469 | 470 | 471 | 472 | 473 | 474 | 475 |
476 | 477 | 478 | 479 | 480 | 481 | 482 | 483 | 484 | 485 | 486 | 487 | 488 | 489 | 490 | 491 | 492 | 493 | 494 | 495 | 496 | 497 | 498 | 499 | 500 |
501 | 502 | 503 | 504 | 505 | 506 | 507 | 508 | 509 | 510 | 511 | 512 | 513 | 514 | 515 | 516 | 517 | 518 | 519 | 520 | 521 | 522 | 523 | 524 | 525 |
526 | 527 | 528 | 529 | 530 | 531 | 532 | 533 | 534 | 535 | 536 | 537 | 538 | 539 | 540 | 541 | 542 | 543 | 544 | 545 | 546 | 547 | 548 | 549 | 550 |
551 | 552 | 553 | 554 | 555 | 556 | 557 | 558 | 559 | 560 | 561 | 562 | 563 | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | 574 | 575 |
576 | 577 | 578 | 579 | 580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 | 590 | 591 | 592 | 593 | 594 | 595 | 596 | 597 | 598 | 599 | 600 |
601 | 602 | 603 | 604 | 605 | 606 | 607 | 608 | 609 | 610 | 611 | 612 | 613 | 614 | 615 | 616 | 617 | 618 | 619 | 620 | 621 | 622 | 623 | 624 | 625 |
626 | 627 | 628 | 629 | 630 | 631 | 632 | 633 | 634 | 635 | 636 | 637 |
I scored 13526 points (out of 15700 possible points, top rank was 17 out of ≈60000 in August 2017) at Hackerrank's Project Euler+.
My username at Project Euler is stephanbrumme while it's stbrumme at Hackerrank.
Look at my progress and performance pages to get more details.
Copyright
I hope you enjoy my code and learn something - or give me feedback how I can improve my solutions.
All of my solutions can be used for any purpose and I am in no way liable for any damages caused.
You can even remove my name and claim it's yours. But then you shall burn in hell.
The problems and most of the problems' images were created by Project Euler.
Thanks for all their endless effort !!!
<< problem 107 - Minimal network | Darts - problem 109 >> |