ＩΣＸＡ²
Zeckendorf's theorem shows that every positive integer can be uniquely represented as a sum of non-adjacent Fibonacci numbers. In this challenge, you have to compute the sum of two numbers in Zeckendorf representation.
Let Fn be the n-th Fibonacci number where
F1 = 1,
F2 = 2 and
for a...
0
Disclaimer: This challenge inspired by me spending the morning debugging recursive functions, which have been frying my brain a little.
Here's an example of recursion, from a letter, we keep going to the previous letter of the alphabet, printing out each one as we go, until we hit the letter a, ...
Your task is, given a family tree, to calculate the Coefficient of Inbreeding for a given person in it.
Definition
The Coefficient of Inbreeding is equal to the Coefficient of Relationship of the parents. The Coefficient of Relationship between two people is defined as weighed sum over all comm...
0
How close are our faces?
Each natural number \$n\$ has 10 faces: its decimal representations in bases \$1\$ through to \$10\$. For example, the 10 faces of \$8\$ are \$[11111111, 1000, 22, 20, 13, 12, 11, 10, 8, 8]\$, and the 10 faces of \$14\$ are \$[11111111111111, 1110, 112, 32, 24, 22, 20, 1...
Predict the state of a Minecraft inventory after click events
Minecraft does inventory management over the network by sending packets describing the clicks that a player does. If you're caching these events, it can be non-trivial to predict what state the inventory is in after the clicks
Challe...
A very-very old (maybe early 2000s) problem:
Print out a decimal number \$n\$ such as \$n^2\$ ends with \$n\$ with maximal length your program can compute in 60 seconds
In other words it's needed to find some long enough \$n\$ such as \$10^{\lfloor\log_{10}n\rfloor+1}|(n^2-n)\$.
A hint may ...
Make a simple calculator which does the basic math operations +, -, * /, one at the time:
Input example: 10+12
Output: 22
Of course, lightest code wins.
Good luck!
