Heavily based on this closed challenge. Length of a Sumac Sequence code-golf A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$ The next term, \$t_3 = t_1 - t_2\$ More generally, \$t_n = t_{n-2} - t_{n-1}\$ The sequence ends when \$t_n ≤ 0\$ (exclusive). No negative integers...

One reason why ISO8601 is the best date string format, is that you can simply append as much precision as you like. The standard output format without timezone looks like this: 1970-01-01T00:00:00.000001 Yes, we are allowed to append 6 digits(microseconds) of precision and theoretically more are ...

Question You must make your code output "666" (with or without a newline). I don't know why I want to do this but why not... Requirements Any language allowed, shortest code wins. Please help me improve this question by commenting :) Have fun!

This code-golf challenge will give you an integer n, and ask you to count the number of positive integer sequences \$S = (a_1, a_2, \dots, a_t)\$ such that \$a_1 + a_2 + \cdots + a_t = n\$, and \$\displaystyle \sqrt{a_1+\sqrt{a_2 + \cdots + \stackrel{\vdots}{\sqrt{a_t}}}} \$ is an integer. Exam...

We can read 13576870234289 digit-by-digit in English, and it makes a haiku: one three five seven six eight seven zero two three four two eight nine We say it's a "digit haiku", because when read out like this, it's 5+7+5 syllables long, and no word is broken across a line. For example, 11117111...