In Perl 6 you can do something like this:
my @fib = 0, 1, * + * ... *
This make uses of the ... sequence operator, which will produce (possibly lazy) generic sequences on demand.
Then you can get the first 10 Fibonacci numbers:
10
@fib[0..10]
More detailed explanation about this (not mine) could be found at: perl6.online/2018/12/15/playing-wi... and perl6advent.wordpress.com/2010/12/...
If you could get this to return a single number for value n, you'd be set up to get the bonus points for no loops or recursion! 🔂
n
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
In Perl 6 you can do something like this:
This make uses of the ... sequence operator, which will produce (possibly lazy) generic sequences on demand.
Then you can get the first
10Fibonacci numbers:More detailed explanation about this (not mine) could be found at: perl6.online/2018/12/15/playing-wi... and perl6advent.wordpress.com/2010/12/...
If you could get this to return a single number for value
n, you'd be set up to get the bonus points for no loops or recursion! 🔂