<< problem 130 - Composites with prime repunit property | Large repunit factors - problem 132 >> |
Problem 131: Prime cube partnership
(see projecteuler.net/problem=131)
There are some prime values, p, for which there exists a positive integer, n, such that the expression n^3 + n^2 p is a perfect cube.
For example, when p = 19, 8^3 + 8^2 * 19 = 123.
What is perhaps most surprising is that for each prime with this property the value of n is unique, and there are only four such primes below one-hundred.
How many primes below one million have this remarkable property?
My Algorithm
The equation n^3 + n^2 p = k^3 can be rewritten:
n^3 (1 + dfrac{p}{n}) = k^3
Which becomes:
n * sqrt[3]{1 + dfrac{p}{n}} = k
And:
n * sqrt[3]{dfrac{n+p}{n}} = k
The only way that n and k are integers is when the cube root is rational:
sqrt[3]{dfrac{n+p}{n}} = sqrt[3]{dfrac{a^3}{b^3}} = dfrac{a}{b}
Then the equation would be:
n * dfrac{a}{b} = k
The new variables a and b are:
a^3 = n+p
b^3 = n
Solving for p:
p = a^3 - n = a^3 - b^3
The binomial expansion a^3 - b^3 = (a - b)(a^2 + ab + b^2) tells us:
p = (a - b)(a^2 + ab + b^2)
All values a, b and p must be integers. Moreover, p must be a prime. Remember: a prime number can only be factorized into two numbers: 1 and itself.
Obviously a - b < a^2 + ab + b^2 (for positive values of a and b). Then it follows for the factors 1 and p:
1 = a - b
p = a^2 + ab + b^2
The first equation is interesting: a and b are consecutive numbers:
a = b + 1
Which can be inserted in the second equation:
p = a^2 + a(a+1) + (a+1)^2
p = a^2 + a^2 + a + a^2 + 2a + 1
p = 3a^2 + 3a + 1
Whenever p = 3a^2 + 3a + 1 is prime, then a valid value was found.
I didn't see it at first, but (a + 1)^3 - a^3 = 3a^2 + 3a + 1, too → p is the difference of two consecutive cubes.
This time I use my Wheel-based primality test (because it's the fastest and I haven't used it in a long time).
It's part of my toolbox.
Modifications by HackerRank
Hackerrank has a huge amount of input values: I have to split my program into two parts. First, I find all solutions up to a limit
,
then I scan those solutions and print the result.
This time all solutions are generated in ascending order. std::lower_bound
finds the largest matching prime below the input very fast (binary search) and returns its position.
For example: querying 100 returns position 3 because 61 is the largest prime below 100. std::distance
returns 4 because index counting starts at zero.
My primality test is too slow to handle all primes below 25 * 10^12. About 10^12 is the most I can process in two seconds.
Note
I increased limit
to 10^8 for the live test. You only need limit = 1000000
for the original problem.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho "1 100" | ./131
Output:
Note: the original problem's input 1000000
cannot be entered
because just copying results is a soft skill reserved for idiots.
(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.
#include <iostream>
#include <vector>
#include <algorithm>
// wheel-based prime test from my toolbox
bool isPrime(unsigned int x)
{
// prime test for 2, 3 and 5
if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0)
return x == 2 || x == 3 || x == 5;
// wheel with size 30 (=2*3*5):
// test against 30m+1, 30m+7, 30m+11, 30m+13, 30m+17, 30m+19, 30m+23, 30m+29
// their deltas/increments are:
const unsigned char Delta[] = { 6, 4, 2, 4, 2, 4, 6, 2 };
// start with 7, which is 30*0+7
unsigned int i = 7;
// 7 belongs to the second test group
unsigned int pos = 1;
// check numbers up to sqrt(x)
while (i*i <= x)
{
// not prime ?
if (x % i == 0)
return false;
// skip forward to next test divisor
i += Delta[pos];
// next delta/increment
pos = (pos + 1) & 7;
}
// passed all tests, must be a prime number
return x > 1;
}
int main()
{
// find all matching primes up to this limit
unsigned int limit = 100000000;
// store all matching primes
std::vector<unsigned int> matches;
// start with a=1
unsigned int a = 1;
while (true)
{
// (a+1)^3 - a^3 = 3a^2 + 3a + 1
auto p = 3*a*a + 3*a + 1;
// too big ?
if (p >= limit)
break;
// found one more prime ?
if (isPrime(p))
matches.push_back(p);
// keep going ...
a++;
}
// process STDIN
unsigned int tests = 1;
std::cin >> tests;
while (tests--)
{
std::cin >> limit;
// find highest position located before the limit (matches are sorted, should use binary search)
auto lower = std::lower_bound(matches.begin(), matches.end(), limit);
// count number of primes
auto result = std::distance(matches.begin(), lower);
std::cout << result << std::endl;
}
return 0;
}
This solution contains 12 empty lines, 22 comments and 3 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.01 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
June 27, 2017 submitted solution
June 27, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler131
My code solves 4 out of 7 test cases (score: 50%)
I failed 0 test cases due to wrong answers and 3 because of timeouts
Difficulty
Project Euler ranks this problem at 40% (out of 100%).
Hackerrank describes this problem as hard.
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=131 - 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-131-primes-perfect-cube/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/131.cs (written by Haochen Liu)
Python github.com/steve98654/ProjectEuler/blob/master/131.py
C++ github.com/Meng-Gen/ProjectEuler/blob/master/131.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/131.cpp (written by Yuping Luo)
C++ github.com/smacke/project-euler/blob/master/cpp/131.cpp (written by Stephen Macke)
C++ github.com/zmwangx/Project-Euler/blob/master/131/131.cpp (written by Zhiming Wang)
Java github.com/dcrousso/ProjectEuler/blob/master/PE131.java (written by Devin Rousso)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem131.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem131.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/131.nb
Perl github.com/gustafe/projecteuler/blob/master/131-Prime-cube-partnership.pl (written by Gustaf Erikson)
Perl github.com/shlomif/project-euler/blob/master/project-euler/131/euler-131.pl (written by Shlomi Fish)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p131.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 | 638 | 639 | 640 | 641 | 642 | 643 | 644 | 645 | 646 | 647 | 648 | 649 | 650 |
651 | 652 | 653 | 654 | 655 | 656 | 657 | 658 | 659 | 660 | 661 | 662 | 663 | 664 | 665 | 666 | 667 | 668 | 669 | 670 | 671 | 672 | 673 | 674 | 675 |
676 | 677 | 678 | 679 | 680 | 681 | 682 | 683 | 684 |
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 130 - Composites with prime repunit property | Large repunit factors - problem 132 >> |