duplicates = multiple editions
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
# with sound and file | |
gst-launch-1.0 uridecodebin uri=file:///home/dirk/Videos/Clouds_67_Timelapse.mp4 ! video/x-raw,width=1280,height=720 ! queue ! x264enc threads=0 bitrate=400 tune=zerolatency key-int-max=30 ! queue ! flvmux name=flvmux ! queue ! rtmpsink location=rtmp://live-fra.twitch.tv/app/$APIKEY audiotestsrc ! faac ! flvmux. |
# The following example shows a way to use iptables for basic round-robin load balancing, by redirecting | |
# packets two one of three ports based on a statistic counter. | |
# | |
# TCP packets for new sessions arriving on port 9000 will rotate between ports 9001, 9002 and 9003, where | |
# three identical copies of some application are expected to be listening. | |
# | |
# Packets that aren't TCP or that related to an already-established connection are left untouched, letting | |
# the standard iptables connection tracking machinery send it to the appropriate port. | |
# | |
# For this to work well, connections need to be relatively short. Ideally there would be an extra layer |
-- Originally an Idris translation of copumpkin's Agda code: | |
-- https://gist.github.com/copumpkin/8758586 | |
-- Extended using Matthew Brecknell's proof which only needs two properties: | |
-- https://gist.github.com/mbrcknl/bfaa72c2ec6ff32a2826 | |
-- Proves that List reverse is completely specified by: | |
-- 1. f [x] = [x] | |
-- 2. f (xs ++ ys) = f ys ++ f xs |
module clfflame; | |
import c.CL.cl; | |
import sys, std.(file, string, util, random, math, time, thread, channel, hashmap, png, macros.(switchover, where)); | |
pragma(lib, "OpenCL"); | |
alias NUMFUNS = 10; // functions implemented | |
alias numfuns = 3; // function set size, must be constant because compiled into shader | |
alias SPEED = 1.0; |
#Non-mathematical Introductions
#Videos
from gi.repository import GstPbutils | |
from gi.repository import Gtk | |
from gi.repository import Gst | |
from gi.repository import GES | |
from gi.repository import GObject | |
import sys | |
import signal | |
def handle_sigint(sig, frame): |
#lang racket/base | |
(provide unicode-name) | |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; | |
;; We want to compute the table at compile-time, so that the result can be saved | |
;; by using raco make. | |
(require (for-syntax net/url | |
racket/base |
A lot of math grad school is reading books and papers and trying to understand what's going on. The difficulty is that reading math is not like reading a mystery thriller, and it's not even like reading a history book or a New York Times article.
The main issue is that, by the time you get to the frontiers of math, the words to describe the concepts don't really exist yet. Communicating these ideas is a bit like trying to explain a vacuum cleaner to someone who has never seen one, except you're only allowed to use words that are four letters long or shorter.
What can you say?