<< problem 291 - Panaitopol Primes | Zeckendorf Representation - problem 297 >> |
Problem 293: Pseudo-Fortunate Numbers
(see projecteuler.net/problem=293)
An even positive integer N will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
The first twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.
If N is admissible, the smallest integer M > 1 such that N+M is prime, will be called the pseudo-Fortunate number for N.
For example, N=630 is admissible since it is even and its distinct prime factors are the consecutive primes 2,3,5 and 7.
The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is M=11.
It can also be seen that the pseudo-Fortunate number for 16 is 3.
Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N less than 10^9.
My Algorithm
The problem description starts with "an even positive integer [...]" and continues with "[...] its distinct prime factors are consecutive primes.".
Therefore any admissible number must be a multiple of 2 and its prime factors must start with 2, 3, 5, 7, ... without any gap.
Its general form is: 2^a * 3^b * 5^c * ... where a exponent is only zero if all following exponents are zero, too.
The highest relevant base (prime) is 23 because 2^1 * 3^1 * 5^1 * 7^1 * 9^1 * 11^1 * 13^1 * 17^1 * 19^1 * 23^1 = 223092870 < 10^9.
Extending the series with 29^1 would exceed 10^9.
In step 1 of my algorithm I create all such admissible numbers up to 10^9 in ascending order:
- put a 2 in the automatically sorted
todo
container, its highest prime factor is 2 (index 0 offactors
) - then repeat until
todo
is empty: - pick the lowest number from
todo
and store it inadmissible
- multiply the same number by all values of
factor[0 ... index+1]
(those are the prime factors) and store them intodo
(if < 10^9)
Step 3 needs these prime numbers to run a primality test on each admissible number's right neighbors.
Admissible numbers are always even, therefore only the numbers +3, +5, +7, +9, ... have to be checked.
Note
There are a few optimization tricks:
- some admissible numbers are smaller than the prime numbers generated in step 2 → simple linear search in
primes
- for this specific range, not all primes in step 2 are actually needed → it's sufficient to have all primes up to sqrt{2.8 * 10^8} → 30% faster
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 50 | ./293
Output:
Note: the original problem's input 1000000000
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. Or just jump to my GitHub repository.
#include <iostream>
#include <vector>
#include <map>
#include <set>
int main()
{
unsigned int limit = 1000000000;
std::cin >> limit;
// ---------- step 1: find all admissible numbers ----------
// generate all numbers 2^a * 3^b * 5^c * 7^d * 11^e ...
const unsigned int NumFactors = 9;
const unsigned int factors[NumFactors] = { 2,3,5,7,11,13,17,19,23 };
// product of all factors is just under 10^9, including the next prime (29) would be bigger than 10^9
// store all admissible numbers
std::vector<unsigned int> admissible;
// [number] => [index of its highest prime factor]
std::map<unsigned int, unsigned char> todo = { { 2, 0 } };
while (!todo.empty())
{
// pick smallest number and remove from to-do list
auto current = *(todo.begin());
todo.erase(todo.begin());
auto number = current.first;
auto maxPrime = current.second;
// add to admissible list
admissible.push_back(number);
// multiply by all already used prime numbers and the next one
for (unsigned char i = 0; i <= maxPrime + 1; i++) // can start with i = maxPrime, too
{
// only up to 9 primes are relevant
if (i == NumFactors)
break;
// put on to-do list if below 10^9
auto next = number * (unsigned long long)factors[i];
if (next < limit)
todo[next] = std::max(maxPrime, i);
}
}
// note: only 6656 admissible numbers
// ---------- step 2: generate prime numbers up to sqrt(10^9) ----------
// find at least one prime factor for each number below 10^9
// => all up to sqrt(10^9) which is about 31622
// and a few more to be on the safe side ... not needed in this case, but safety first :-)
auto primeLimit = limit + 1000;
// but I can cheat and reduce primeLimit as long as I get the correct result
// => makes the program about 30% faster
//primeLimit = 271623361;
std::vector<unsigned int> primes = { 2 };
// simply trial-division prime generator
for (unsigned int i = 3; i*i <= primeLimit; i += 2)
{
bool isPrime = true;
// test against all prime numbers we have so far (in ascending order)
for (auto x : primes)
{
// prime is too large to be a divisor
if (x*x > i)
break;
// divisible => not prime
if (i % x == 0)
{
isPrime = false;
break;
}
}
// yes, we have a prime
if (isPrime)
primes.push_back(i);
}
// only 1911 out of the 3401 primes are actually needed in step 3
// ---------- step 3: look for each admissible number's fortunate number ----------
// std::set automatically filters duplicates
std::set<unsigned int> fortunate;
size_t pos = 0;
for (auto x : admissible)
{
// every admissible number is even and m > 1
// => therefore the first candidate is at m = 3
const unsigned int MinDistance = 3;
// fast check for small primes
if (x <= primes.back() - MinDistance)
{
while (primes[pos] < x + MinDistance)
pos++;
auto distance = primes[pos] - x;
// might be a duplicate but std::set makes sure that all values are unique
fortunate.insert(distance);
continue;
}
// every prime is odd (except for 2)
// => I look at every second number
for (unsigned int m = MinDistance; ; m += 2)
{
auto candidate = x + m;
// is it a prime ?
bool isPrime = true;
// trial division
for (auto p : primes) // actually I could skip p = 2 because all candidates are odd
if (candidate % p == 0)
{
// it's a composite number
isPrime = false;
break;
}
// no, keep going ...
if (!isPrime)
continue;
// yes, a prime
auto distance = candidate - x;
// might be a duplicate but std::set ensures that all values are unique
fortunate.insert(distance);
break;
}
}
// add all fortunate numbers
unsigned int sum = 0;
for (auto x : fortunate)
sum += x;
// display result
std::cout << sum << std::endl;
return 0;
}
This solution contains 26 empty lines, 40 comments and 4 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.10 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
July 26, 2017 submitted solution
July 26, 2017 added comments
Difficulty
Project Euler ranks this problem at 25% (out of 100%).
Links
projecteuler.net/thread=293 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python github.com/LaurentMazare/ProjectEuler/blob/master/e293.py (written by Laurent Mazare)
Python github.com/steve98654/ProjectEuler/blob/master/293.py
C++ github.com/Meng-Gen/ProjectEuler/blob/master/293.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/293.cpp (written by Yuping Luo)
C++ github.com/steve98654/ProjectEuler/blob/master/293.cpp
Java github.com/thrap/project-euler/blob/master/src/Java/Problem293.java (written by Magnus Solheim Thrap)
Mathematica github.com/steve98654/ProjectEuler/blob/master/293.nb
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 | 685 | 686 | 687 | 688 | 689 | 690 | 691 | 692 | 693 | 694 | 695 | 696 | 697 | 698 | 699 | 700 |
701 | 702 | 703 | 704 | 705 | 706 | 707 | 708 | 709 | 710 | 711 | 712 | 713 | 714 | 715 | 716 | 717 | 718 | 719 | 720 |
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 291 - Panaitopol Primes | Zeckendorf Representation - problem 297 >> |