Linked Questions

9 votes
13 answers

Find the nth Fibonnaci Prime, in the shortest code

The challenge is rather simple: Take a positive whole number \$n\$ as input. Output the \$n\$th Fibonacci prime number, i.e. the \$n\$th Fibonacci number that is also prime. Input can be as an ...
Inkbug's user avatar
  • 554
23 votes
12 answers

Is this number secretly Fibonacci?

Background Most of you know what a Fibonacci number is. Some of you may know that all positive integers can be represented as a sum of one or more distinct Fibonacci numbers, according to Zeckendorf'...
Cowabunghole's user avatar
  • 1,650
14 votes
10 answers

Sequentia Filii Bonacci

Leonardo of Pisa (ca. 1175 - ca. 1245) is better known as Fibonacci. But this is actually a short for the Latin "filius Bonacci" (the son of Bonacci) which was made up during the 18th century (...
Arnauld's user avatar
  • 194k
29 votes
8 answers

Tips for golfing in Julia

What general tips do you have for golfing in Julia? I'm looking for ideas that can be applied to code golf problems in general that are at least somewhat specific to Julia (e.g. "remove comments" is ...
Jonathan Van Matre's user avatar
10 votes
7 answers

Tips for golfing in jq

Since jq is the Language Of The Month for September 2021, what general tips do you have for golfing in jq? I'm looking for ideas which can be applied to code-golf problems and which are also at least ...
emanresu A's user avatar
  • 39.2k
16 votes
6 answers

Golff y Côd - Treiglad

Read this yng Nghymraeg Challenge Given a word in Welsh, output all of the possible mutated forms of the word. Mutations A mutation is a change of the first letter of a word when following certain ...
Beta Decay's user avatar
  • 23.4k
30 votes
4 answers

Orientation Oriented Programming

Write a program for a specific language that in different orientations performs different tasks. Your code should have at least two non-empty lines and at least two non-empty columns and should ...
Dom Hastings's user avatar
20 votes
4 answers

SKI calculus golf: Half of a Church numeral

Background SKI combinator calculus, or simply SKI calculus, is a system similar to lambda calculus, except that SKI calculus uses a small set of combinators, namely ...
Bubbler's user avatar
  • 77.7k
5 votes
4 answers

Implement the Fibonacci sequence... Shifted to the right [duplicate]

Background We all know the famous Fibonacci sequence, where each term is the sum of the previous two, with the first term being 0 and the second one being ...
Mr. Xcoder's user avatar
  • 42.4k
-3 votes
4 answers

Fibonacci Sequenze without using loops! [closed]

Here is one more "Challenge"! Today i had a meeting with a friend, and mostly we are a little bit crazy.. He bets, that it is not possible to create a Fibonacci Sequence without using loops. No ...
Tyralcori's user avatar
  • 193
-3 votes
4 answers

Calculate Fibonacci series from nth term to mth term [duplicate]

Your goal is to calculate the sum of Fibonacci series from n th term to m th term (including both terms). No use of / * % or mathematically what they are in your ...
Mukul Kumar's user avatar
  • 2,711
4 votes
3 answers

Recamán's triangular fibonacci

This challenge is based upon three sequences, below are their formulae: Recamán's sequence: a1 = 0; for n > 0, an = an-1 - n if positive and not already in the sequence, otherwise an = an-1 + n ...
Buffer Over Read's user avatar
3 votes
1 answer

Add the Fibonnaci Sequence to the Lucas Sequence [duplicate]

Background of Lucas Numbers The French mathematician, Edouard Lucas (1842-1891), who gave the name to the Fibonacci Numbers, found a similar series occurs often when he was investigating Fibonacci ...
Belfield's user avatar
  • 571
3 votes
0 answers

Hack Sequence : Simplify Hi = 2014*Hi-1 + 69*Hi-2 [closed]

Can someone help me with simplifying this sequence. I write code to loop through entire n, I am getting timeout. Hack sequence of IndiaHacks-2014 if given as below Hi = 2014*Hi-1 + 69*Hi-2 for (i > ...
Sujith's user avatar
  • 39
0 votes
0 answers

Shortest way to print the first 20 numbers in the fibbonacci sequence with python3 [duplicate]

I was wondering if it was possible to make this code even shorter than it already was. f=lambda x:f(x-1)+f(x-2) if x>1 else 1 [print(f(i))for i in range(20)] ...
Eric Pan's user avatar

15 30 50 per page