- mathfun@mailman.xmission.com - mailman.xmission.com

Re: [math-fun] Fourier Transform video
by Bill Gosper 31 Jan '18

31 Jan '18

On 2018-01-31 08:22, Henry Baker wrote: > I'm curious as to what others think about this Fourier Transform video > (1/26/2018). > > http://www.3blue1brown.com/ > > https://www.youtube.com/c/3blue1brown > I wish, very early on, when he's visualizing those simple chords, that he'd make a point of sliding around the relative phases, making visually dissimilar waveforms that sound the same. --rwg

1 0

Re: [math-fun] Fourier Transform video
by Dan Asimov 31 Jan '18

31 Jan '18

I just watched the first video, but compared to almost all similar videos (about the same length, teaching math) I found it to be SUPERB. It explains things extra clearly by explaining the idea of wrapping a periodic function around the circle, and accompanying each statement of the narrator with the appropriate pictures. Does anyone know who is responsible for this video? —Dan Henry Baker wrote: ----- I'm curious as to what others think about this Fourier Transform video (1/26/2018). http://www.3blue1brown.com/ https://www.youtube.com/c/3blue1brown -----

1 0

[math-fun] How can they call them twin primes
by Bill Gosper 31 Jan '18

31 Jan '18

In[1]:= PrimeQ[5280 + {1, -1}] Out[1]= {True, True} if there's a mile between them? --rwg

3 2

[math-fun] Fourier Transform video
by Henry Baker 31 Jan '18

31 Jan '18

I'm curious as to what others think about this Fourier Transform video (1/26/2018). http://www.3blue1brown.com/ https://www.youtube.com/c/3blue1brown

3 2

Re: [math-fun] Non-electronic analogue computers
by Henry Baker 30 Jan '18

30 Jan '18

There's the famous 1949 "MONIAC" ("Money AC"; get it?), which is one of the few computers not influenced by Al Gore, who was but 1 year old at the time. Rube Goldberg and Heath Robinson would both have been proud of the MONIAC. "Other [MONIAC] computers went to Harvard Business School", where it presumably educated an entire generation of corporate and political leaders about how macroeconomics and tax policy work. :-) I understand that some members of Congress still think that this is the way computers and the Internet are built -- out of a series of tubes and tanks, leaking/dripping with sarcasm. :-) I'm sure that someone is working on a blockchain model of the economy as we speak. :-) https://en.wikipedia.org/wiki/MONIAC_Computer The MONIAC was approximately 2 m high, 1.2 m wide and almost 1 m deep, and consisted of a series of transparent plastic tanks and pipes which were fastened to a wooden board. Each tank represented some aspect of the UK national economy and the flow of money around the economy was illustrated by coloured water. At the top of the board was a large tank called the treasury. Water (representing money) flowed from the treasury to other tanks representing the various ways in which a country could spend its money. For example, there were tanks for health and education. To increase spending on health care a tap could be opened to drain water from the treasury to the tank which represented health spending. Water then ran further down the model to other tanks, representing other interactions in the economy. Water could be pumped back to the treasury from some of the tanks to represent taxation. Changes in tax rates were modeled by increasing or decreasing pumping speeds. ... The actual flow of the water was automatically controlled through a series of floats, counterweights, electrodes and cords. When the level of water reached a certain level in a tank, pumps and drains would be activated. To their surprise, Phillips and his associate Walter Newlyn found that MONIAC could be calibrated to an accuracy of Â±2%. [Perhaps the success of this analogue computer explains the anemic British post-WWII economy?] The first MONIAC was created in his landlady's garage in Croydon at a cost of Â£400 (equivalent to Â£13,000 in 2016). Phillips first demonstrated the MONIAC to a number of leading economists at the LSE in 1949. It was very well received and Phillips was soon offered a teaching position at the LSE. At 11:58 AM 1/29/2018, Mike Stay wrote: >Gitton's water clock implemented a counter using tanks and siphons.

3 2

[math-fun] Non-electronic analogue computers
by James Propp 29 Jan '18

29 Jan '18

Anyone know of any good designs for an easy-to-make analogue computer based on springs, masses, and dashpots? That is, we want a supply of easily-interconnectable components that we can combine in ways that correspond to a prescribed differential equation, so that the behavior of the system will be a solution of the equation. As I recall, there’s also a way to get hydraulic analogues of LRC networks (though I forget what the three sorts of components are called); is there a good design for a hydraulic computer? Jim Propp

5 8

[math-fun] Non-electronic analogue computers
by Guy Haworth 29 Jan '18

29 Jan '18

Maybe I have come late to this conversation ... but I vaguely remember that Maurice Wilkes was initially put in charge of Cambridge's University's Mathematical Laboratory http://www.cl.cam.ac.uk/relics/history.html which: - had several mechanical machines for solving differential equations, https://en.wikipedia.org/wiki/Differential_analyser, and - maybe Meccano was involved too. There are several non-Babbage mechanical computers in the Science Museum in London (but maybe not now on show), and ... Jack Howlett wrote a book on early pre-electronic computers, maybe a translation from the original French. Sadly, I cannot immediately identify the book that Jack published. MIT Press might have been the publisher. Maybe it was 'The computer comes of age'. Guy

1 0

Re: [math-fun] Non-electronic analogue computers
by Henry Baker 29 Jan '18

29 Jan '18

Jim: I just went through a similar search for pedagogical electronic design. Google "EDA" (Electronic Design and Analysis). There are a number of FOSS (Free and Open-Source Software) EDA tools for both Linux and Windows. The venerable program "Spice" can do time-stepped simulation/emulation of electronic circuits, but I don't think that Spice will do this symbolically. However, I think that there are some other programs can also read the same Spice files and -- at least for *linear time-invariant circuits* -- produce and solve symbolic equations. Spice files have a trivial format, wherein each line describes a link in the schematic graph structure: C23 2 3 0.1 would be a *capacitor* going from graph node labelled "2" to graph node labelled "3" and have a capacitive value of 0.1 Farads. The graph node labelled "0" is "ground", by convention. The process of going from the schematic circuit to the mathematical matrix format is called "Nodal Analysis" or more likely "Modified Nodal Analysis". Each "link" becomes *four* entries in the matrix -- at four corners of a rectangle -- called a "stamp" (?!?). I believe that the mechanical engineers utilize a similar -- if not identical -- format for their matrices. If you want to play with *digital signal processing*, I can also recommend "GnuRadio" and "GnuRadio Companion" (GRC). GRC allows you to lay out a digital signal processing system in block diagram form and then emulate it in real time. You can play with GRC using just your microphone and speakers -- you don't need any actual radio hardware. At 05:09 AM 1/29/2018, James Propp wrote: >Anyone know of any good designs for an easy-to-make analogue computer based on springs, masses, and dashpots? > >That is, we want a supply of easily-interconnectable components that we can combine in ways that correspond to a prescribed differential equation, so that the behavior of the system will be a solution of the equation. > >As I recall, there's also a way to get hydraulic analogues of LRC networks (though I forget what the three sorts of components are called); is there a good design for a hydraulic computer? > >Jim Propp

1 0

Re: [math-fun] A binary sieve
by Dan Asimov 28 Jan '18

28 Jan '18

"... then delete every j for which ..." A priori it seems possible that the order in which such j are deleted could change the outcome. —Dan Fred Lunnon wrote: ----- Choose an integer k >= 2 , let q' = 2^k - 1 , initialise set S = {1, ..., q'-1} ; then delete every j for which i < j exists with j == i*2^h (mod q') for some h . For example, when k = 5 , q' = 31 , finally S = {1, 3, 5, 7, 11, 15} . I conjecture that max S = (q'-1)/2 for all k ; but why? -----

3 2

[math-fun] A binary sieve
by Fred Lunnon 28 Jan '18

28 Jan '18

Choose an integer k >= 2 , let q' = 2^k - 1 , initialise set S = {1, ..., q'-1} ; then delete every j for which i < j exists with j == i*2^h (mod q') for some h . For example, when k = 5 , q' = 31 , finally S = {1, 3, 5, 7, 11, 15} . I conjecture that max S = (q'-1)/2 for all k ; but why? Fred Lunnon

1 0