In combinatorics, Sun's curious identity is the following identity involving binomial coefficients, first established by Zhi-Wei Sun in 2002:
After Sun's publication of this identity, five other proofs were obtained by various mathematicians: they are Panholzer and Prodinger's proof via generating functions, Merlini and Sprugnoli's proof using Riordan arrays, Ekhad and Mohammed's proof by the WZ method, Chu and Claudio's proof with the help of Jensen's formula, and Callan's combinatorial proof involving dominos and colorings.
An application of the identity was given by Sun in a recent paper.
...
Screenshot
About
Completely overhauled styles, including default and dark themes
Reply to, star and flag messages
Slide-out Sidebar for easy menu/star list access
Tweaks to make typing easier (including Return -> Send, @username completion)
The app works by injecting extra CSS and JS i...
Your program, function, whatever will take input of a string (or closest equivalent) and output a string with grammar fixed. See below.
Rules
Try to fix as many grammar rules as possible, subtract 5 from your score for each rule you implement.
You must provide documentation of your grammar rul...
We have a rising sequence of non-negative integers, like:
12 11 10
Wait! This sequence isn't rising, is it? Well, the numbers are written in different bases. The least possible base is 2, the biggest is 10.
The task is to guess bases each number is written, so that:
the sequence is rising,
...
Golf these arrays
Your task is to output these 128 arrays: http://pastebin.com/UeBMJfv7
Gzip base64: (too long, will be added if I'll post this question).
Rules
You don't have to output them all. And you can output the arrays in any order. But the order of items in the arrays must be kept as...
Update: The decision has been made to deactivate MathJax on main for now (it's still active on meta to play around with). This does not reflect the current votes, as these changed significantly after the decision was made.
We've had MathJax support for 3 days now. While it makes our maths chal...
Largest permutation order code-golf
Find the largest order of any permutation on n elements (Landau's g(n) OEIS A000793). Input is the positive integer n, output is a positive integer. Fewest bytes wins.
Since the order of a permutation is the LCM of its cycle lengths, this equals the largest L...
