You are in: Home > Eureka > About Eureka

About Eureka


Eureka is the journal of The Archimedeans (Cambridge University Mathematical Society).

Eureka was first published in 1939 and the most recent issue to be published was the 57th. It is a mix of articles and problems, with some mathematical humour for good measure. Although most of the articles are written by students, there are Eureka articles written by such luminaries as Paul Dirac, Paul Erdös, John Conway, Béla Bollobás, Ian Stewart and Douglas Hofstadter, to name but a few. The problems include the annual Archimedeans' Problems Drive, as well as other recreational problems. Two recent articles, Train Sets and Gess the Game from Eureka 53, have inspired articles by Ian Stewart in Scientific American.

If you are interested in writing for Eureka, guidelines can be found here.

For information about getting Eureka, please see here.

Recent News
28/01/09: Eureka 59 is out now!

We will distribute them to member's pigeonhole by the end of this week.

If you are a member and entitled for a free copy (i.e. joined in 2006, 2007 and 2008), but live outside Cambridge or by some reasons didn't receive it by then, please contact the business manager at archim-business@srcf.ucam.org, and we will try to get the Eureka out to you in the next week.

If you are not entitled for a free copy, you are very welcome to purchase them from the subscription manager at archim-eureka-subscriptions@srcf.ucam.org.


15/01/09: Eureka 59 is out now!

You'll receive your free copy soon if entitled.

Otherwise, feel free to contact the subscription manager at archim-eureka-subscriptions@srcf.ucam.org to purchase a copy.

 
Upcoming Events
Friday 13th February, 7.30 pm:
CMS M5
SPEAKER MEETING
"Quantization and Differential Operators"
by Prof. Raphael Rouqier, Magdalen College, Oxford

He will discuss deformation and quantization of vector spaces with extra symmetries. Elementary deformations of the partial derivatives came up recently that led to surprisingly rich mathematics, at the crossroad of algebra, combinatorics, algebraic and harmonic analysis, geometry and mathematical physics [contd.]

Friday 30th January, 7.30 pm:
CMS M5
SPEAKER MEETING
"Rendezvous Search"
by Professor Richard Weber

In the game of symmetric rendezvous search, two players are intially placed at two randomly chosen vertices of a complete graph. At each step in time each player can move from his present one vertex to any other vertex (or stay where he is) [contd.]

[Current Termcard]
 

top of page - home - about the site - contact us - sitemap
Last Updated: 20th August 2005, 1:14pm — © The Archimedeans 2005 — Maintained by archim-webmaster@srcf.ucam.org