The sequence of segmented numbers or prime numbers of measurement (OEIS A002048) is the sequence of numbers such that each member is the smallest positive number that can be made of a sum of earlier consecutive numbers, with a(0) = 1.
Task
Your task is to take a number (via standard methods) ...
Sum or difference of two powers of two
code-golfmath
Your challenge, should you choose to accept it, is, given an integer K >= 1, find integers A and B such that at least one of the two conditions following hold:
K = 2^A + 2^B
K = 2^A - 2^B
If there does not exist such A and B, your progra...
Python 3, 321 bytes
This is in no way the shortest it could be, but I will continue to golf it:
import re
n=input().replace(' ','')
g=lambda m:'-(-'+m.group()[1:]+')'
h=lambda m:'/(1/'+m.group()[1:]+')'
i=lambda m:'0/'+m.group()[:-2]
n=re.sub(r'\+\([^\)]+\)',g,n)
n=re.sub(r'\([^\)]+\)\*0',i,n)
...
0
GNU sed, 494 + 2(rn flags) = 496 bytes
The code size is not going to compete, but it was fun emulating the uniq functionalities. I wanted to add a simple selection sort to get rid of the sort shell call, thus solving it in pure sed only, but the code was getting too long already. The comments we...
