MathDB
2016 LMT Individual #23

Source:

April 10, 2016

Problem Statement

Call a positive integer n2n\geq 2 junk if there exist two distinct nn digit binary strings a1a2ana_1a_2\cdots a_n and b1b2bnb_1b_2\cdots b_n such that
[*] a1+a2=b1+b2,a_1+a_2=b_1+b_2, [*] ai1+ai+ai+1=bi1+bi+bi+1a_{i-1}+a_i+a_{i+1}=b_{i-1}+b_i+b_{i+1} for all 2in1,2\leq i\leq n-1, and [*] an1+an=bn1+bna_{n-1}+a_n=b_{n-1}+b_n.
Find the number of junk positive integers less than or equal to 20162016.
Proposed by Nathan Ramesh