M

Magic

Generate magic squares for any odd side length:

#!/usr/bin/env python3
import sys
def magic_constant(n):
    return n * (n * n + 1) // 2
def magic_square(n):
    square = [[0] * n for _ in range(n)]
    num = 1
    i, j = 0, n // 2
    while num <= n * n:
        square[i][j] = num
        num += 1
        new_i = (i - 1) % n
        new_j = (j + 1) % n
        if square[new_i][new_j]:
            i = (i + 1) % n
        else:
            i, j = new_i, new_j
    return square
n = int(sys.argv[1]) if len(sys.argv) > 1 else 3
square = magic_square(n)
width = len(str(n * n))
print(f"Magic constant for n={n}: {magic_constant(n)}\n")
for row in square:
    print(" ".join(f"{x:>{width}}" for x in row))






Mathplot for MSDOS

  RESET
  TITLE Fourier series approximation of square wave
  Y1 = SIN(X) + SIN(3*X)/3 + SIN(5*X)/5 + SIN(7*X)/7 + SIN(9*X)/9 +
  SIN(11*X)/11 + SIN(13*X)/13
  Y2 = PULSE(0,X,PI) - PULSE(PI,X,2*PI)
  DOMAIN .001,2*PI+.001
  NUM 200
  LABELS ON
  GRID ON
  PLOT


Matrix

while :;do echo $LINES $COLUMNS $((RANDOM%COLUMNS)) $(printf '%b' "\\u$(printf '%04x' $((RANDOM%500)))");sleep .05;done|gawk '{a[$3]=0;for(x in a){o=a[x];a[x]++;printf "\033[%s;%sH\033[2;32m%s",o,x,$4;printf "\033[%s;%sH\033[1;37m%s\033[0;0H",a[x],x,$4;if(a[x]>=$1)a[x]=0}}'