Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
6 added 77 characters in body
source | link

JavaScript, 103 101 99 97 9393 90

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;l=g;y=x-1,l=(x>1?y=1-1y/x=x:-(y=x-1)y)*l+y/g)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.
- Finally, caught primo's version! With primo's help, of course... :)
- Simplified the assignment to L. Shaved 3 more bytes.

JavaScript, 103 101 99 97 93

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;l=(x>1?y=1-1/x:-(y=x-1))*l+y/g)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.
- Finally, caught primo's version! With primo's help, of course... :)

JavaScript, 103 101 99 97 93 90

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;y=x-1,l=(x>1?y/=x:-y)*l+y/g)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.
- Finally, caught primo's version! With primo's help, of course... :)
- Simplified the assignment to L. Shaved 3 more bytes.

5 added 91 characters in body
source | link

JavaScript, 103 101 99 9797 93

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;y=x>1g;l=(x>1?1y=1-1/x:x-1,l=y/g+(y<0?y=x-y:y1)*l)*l+y/g)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.
- Finally, caught primo's version! With primo's help, of course... :)

JavaScript, 103 101 99 97

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;y=x>1?1-1/x:x-1,l=y/g+(y<0?-y:y)*l)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.

JavaScript, 103 101 99 97 93

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;l=(x>1?y=1-1/x:-(y=x-1))*l+y/g)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.
- Finally, caught primo's version! With primo's help, of course... :)

4 added 64 characters in body
source | link

JavaScript, 103 101 9999 97

This implementation is based on primo's comprehensive description of the algorithm he used.

for(x=prompte=l=x=prompt(e=l=1g=1e5),g=1e5;;--g;y=x>1?1-1/x:x-1,l=y/g+(y<0?-y:y)*l)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.

JavaScript, 103 101 99

This implementation is based on primo's comprehensive description of the algorithm he used.

for(x=prompt(e=l=1),g=1e5;--g;y=x>1?1-1/x:x-1,l=y/g+(y<0?-y:y)*l)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit: Trying to catch Perl. Stole a byte back from primo by copying his branch. :)

JavaScript, 103 101 99 97

This implementation is based on primo's comprehensive description of the algorithm he used.

for(e=l=x=prompt(g=1e5);--g;y=x>1?1-1/x:x-1,l=y/g+(y<0?-y:y)*l)
    e=1+e/g*x;
alert([e,x>0?l:"ERROR"])

Edit:
- Trying to catch Perl. Stole a byte back from primo by copying his branch. :)
- 2 more bytes courtesy of primo.

3 deleted 13 characters in body
source | link
2 added 138 characters in body
source | link
1
source | link