Commonmark migration

edited Jun 17, 2020 at 9:04

1

[Jelly]Jelly, 8 7 6 [bytes]bytes

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]Try it online!

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 r - inclusive range = [-1,0,1,2,3,4,5,...,n] ‘ - increment n = [ 0,1,2,3,4,5,6,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,5,8,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the 0^th Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 r - inclusive range = [-1,0,1,2,3,4,5,...,n] ‘ - increment n = [ 0,1,2,3,4,5,6,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,5,8,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the 0^th Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

Jelly, 8 7 6 bytes

-r‘ÆḞċ

Try it online!

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 r - inclusive range = [-1,0,1,2,3,4,5,...,n] ‘ - increment n = [ 0,1,2,3,4,5,6,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,5,8,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the 0^th Fibonacci number;

added 7 characters in body

Source Link

edited Jun 14, 2017 at 19:13

Jonathan Allan

115.5k
8
68
293

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 r ‘ - incrementinclusive nrange = [-1,0,1,2,3,4,5,...,n]  ‘ = n+1  r - increment n - inclusive range = [-1, 0,1,2,3,4,5,6,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,5,8,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the -10^th (-1^st?) Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 ‘ - increment n = n+1  r - inclusive range = [-1,0,1,2,3,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the -1^th (-1^st?) Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 r - inclusive range = [-1,0,1,2,3,4,5,...,n]  ‘ - increment n = [ 0,1,2,3,4,5,6,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,5,8,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the 0^th Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

added 34 characters in body

Source Link

edited Jun 14, 2017 at 18:04

Jonathan Allan

115.5k
8
68
293

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 ‘ - increment n = n+1 r - inclusive range = [-1,0,1,2,3,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd is theand 4^th Fibonacci numbernumbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the -1^th (-1^st?) Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 ‘ - increment n = n+1 r - inclusive range = [-1,0,1,2,3,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 3, since 3 is the 4^th Fibonacci number - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the -1^th (-1^st?) Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

[Jelly], 8 7 6 [bytes]

-r‘ÆḞċ

[Try it online!][TIO-j3x8ymyn]

How?

-r‘ÆḞċ - Link: non negative number, n - - literal -1 = -1 ‘ - increment n = n+1 r - inclusive range = [-1,0,1,2,3,...,n+1] ÆḞ - Fibonacci = [ 0,1,1,2,3,...,fib(n+1)] ċ - count occurrences of n (1 if n is a Fibonacci number, 0 otherwise)

Notes:

the increment, ‘, is needed so this works for 2 and 3, since they are the 3^rd and 4^th Fibonacci numbers - beyond 3 all Fibonacci numbers are greater than their index.
the - is needed (rather than just ‘R) so this works for 0 since 0 is the -1^th (-1^st?) Fibonacci number; [Jelly]: https://github.com/DennisMitchell/jelly [bytes]: https://github.com/DennisMitchell/jelly/wiki/Code-page [TIO-j3x8ymyn]: https://tio.run/##y0rNyan8/1@36FHDjMNtD3fMO9L9//9/Q2MA "Jelly – Try It Online"

added 67 characters in body

Source Link

edited Jun 14, 2017 at 17:45

Jonathan Allan

115.5k
8
68
293

Loading

added 592 characters in body

Source Link

edited Jun 14, 2017 at 17:34

Jonathan Allan

115.5k
8
68
293

Loading

added 21 characters in body

Source Link

edited Jun 14, 2017 at 17:18

Jonathan Allan

115.5k
8
68
293

Loading

Source Link

answered Jun 14, 2017 at 17:12

Jonathan Allan

115.5k
8
68
293

Loading

Stack Exchange Network

Return to Answer

[Jelly]Jelly, 8 7 6 [bytes]bytes

How?

[Jelly], 8 7 6 [bytes]

How?

Jelly, 8 7 6 bytes

How?

[Jelly], 8 7 6 [bytes]

How?

[Jelly], 8 7 6 [bytes]

How?

[Jelly], 8 7 6 [bytes]

How?

[Jelly], 8 7 6 [bytes]

How?

[Jelly], 8 7 6 [bytes]

How?

[Jelly], 8 7 6 [bytes]

How?