83
\$\begingroup\$

This is the PPCG Prime

624 digits long

777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777111111111111111111111111111111111111111111111111111111111111111111111111111111188888888118888888811188888811188888811188111118818811111881881111881881111881188111118818811111881881111111881111111188888888118888888811881111111881118888188111111118811111111881111111881111881188111111118811111111881111881881111881188111111118811111111188888811188888811111111111111111111111111111111111111111111111111111111111111111111111111111111333333333333333333333333333333333333333

If we split every 39 digits we get
777777777777777777777777777777777777777
777777777777777777777777777777777777777
777777777777777777777777777777777777777
777777777777777777777777777777777777777
111111111111111111111111111111111111111
111111111111111111111111111111111111111
188888888118888888811188888811188888811
188111118818811111881881111881881111881
188111118818811111881881111111881111111
188888888118888888811881111111881118888
188111111118811111111881111111881111881
188111111118811111111881111881881111881
188111111118811111111188888811188888811
111111111111111111111111111111111111111
111111111111111111111111111111111111111
333333333333333333333333333333333333333

Your task is to output the PPCG-Prime

This is . The shortest code in bytes wins.

If you input the PPCG-Prime in the Mathematica function below, you get this result

ArrayPlot@Partition[IntegerDigits@#,39]&   

enter image description here

\$\endgroup\$
8
  • 46
    \$\begingroup\$ How on earth did you find this? \$\endgroup\$ Commented Oct 23, 2017 at 6:38
  • 5
    \$\begingroup\$ @StewieGriffin The average probability for a number n to be prime is proportional to 1/log(n), which is not very small, anyway. Just check a lot of numbers until it's prime. \$\endgroup\$
    – user202729
    Commented Oct 23, 2017 at 6:40
  • 2
    \$\begingroup\$ Comments are not for extended discussion; this conversation has been moved to chat. \$\endgroup\$
    – Dennis
    Commented Oct 23, 2017 at 12:51
  • 1
    \$\begingroup\$ @user202729 log(n) is about 1436.6 in this case. \$\endgroup\$ Commented Oct 24, 2017 at 21:25
  • 4
    \$\begingroup\$ @Fabian I don't think this method would be efficient... For a Prime this big (624 digits), the number you are asking has 621 digits (and is even more difficult to golf), Unless this is the 10^621th prime!!! If you want to find your number, here is a simple approximation x/logx by Gauss \$\endgroup\$
    – user72253
    Commented Oct 25, 2017 at 13:31

33 Answers 33

1
2
0
\$\begingroup\$

FEU, 178 bytes

a/lllmtwrzxyzrrszwqqwqqwzqwzxzwqqwqqwszvyzxyzxzwszszzqvzvzwszwzxzvzvzwzqwzxzvzv1yrtvooop
m/l/mmmm/m/nnn/n/7777/o/pppp/p/333/q/1z/r/sy/s/x1/t/uuu/u/vvv/v/ww/w/xx/x/11/y/zzz/z/88/g

Try it online!

Compression. My compression testing wasn't very rigorous, so this might be able to be optimized.

\$\endgroup\$
0
\$\begingroup\$

brainfuck, 531 503 bytes

-[>+>+<<-----]>++++>-->---[>+<+++++++]>++>>++++++++++<<<++++[->[>+<-]>[<<<<.>>>+>-]>.<<<]++[->[>+<-]>[<<<.>>+>-]>.<<<]<<+>>++[-<.<........>.>]++[-<..<......>.>]<.>>>>.<<<++[-<.<..>.....<..>>]++[-<.<..>....<..>>]<.>>>>.<<<++[-<.<..>.....<..>>]++[-<.<..>......>]<.>>>>.<<<++[-<.<........>.>]<.<..>.......<..>...<....>>>>>.<<<+++[-<.<..>.......>]<<..>....<..>.>>>>.<<<++[-<.<..>.......>]++[-<.<..>....<..>>]<.>>>>.<<<++[-<.<..>.......>]++[-<..<......>.>]<.>>>>.<<<++[->[>+<-]>[<<<.>>+>-]>.<<<]<++>>[-<<.>>]

Try it online!

\$\endgroup\$
0
\$\begingroup\$

05AB1E, 148 bytes

•d•Å3•Θ•Å1ì•2œP²IM›BŽт›ÖΛZY
‰ øÕŒQÉΓΩr‡'?₁0rºн∊÷ζì‰ÉöΘ…çнEîx5›иñĽü’üΔιàòEγ®é∍NaV†Sƒ¯%à˜PÝ™₆·à≠ø€ćËÙzLtp:Ö†p\nJ$gāböò_¿®₂@h”•rª•Δ•Å1ìƵtÅ7컶õ.:ðõ.:

Try it online!

Explanation

•d•Å3•Θ•Å1ì•...•rª•Δ•Å1ìƵtÅ7컶õ.:ðõ.:
•d•Å3                                  push 39 "3"s
     •Θ•Å1                             push 80 "1"s
          ì                            merge lists
           •...•                       compressed number containing the "1"s and "8"s (probably could be shortened)
                r                      reverse stack
                 ª                     append
                  •Δ•Å1                push 79 "1"s
                       ì               merge everything
                        »              convert list to newline separated string
                          ¶õ.:         replace newlines with nothing
                              ðõ.:     replace spaces with nothing
                                       (implicit print)

Definitely can be golfed...

\$\endgroup\$
1
2

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.