### Top Posts

### Recent comments

### Blogroll

- Alexander Konovalov
- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- British Combinatorial Committee
- CIRCA tweets digest
- CoDiMa
- Coffee, love, and matrix algebra
- Comfortably numbered
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Paul Goldberg
- Robert A. Wilson's blog
- Sheila's blog
- Since it is not …
- Spitalfields life
- St Albans midweek lunch
- Stubborn mule
- Sylvy's mathsy blog
- SymOmega
- Tangential thoughts
- Terry Tao
- The Aperiodical
- The De Morgan Journal
- The ICA
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- Vynmath
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: Diophantine equations

## Wiles and Langlands

One of the best things that pops regularly into my pigeonhole is the European Mathematical Society Newsletter. The current issue, number 104, is particularly rich in interesting articles. For example, there is the transcript of a talk by Christian Krattenthaler … Continue reading

Posted in exposition, mathematics and ..., Uncategorized
Tagged Diophantine equations, Galois representations, Langlands, Wiles
2 Comments

## BCC, day 4

The highlight of the conference for me was the talk this afternoon by Manuel Bodirsky, on Ramsey classes. No time now to explain all this – get the invited speakers’ volume and read it if you want to know – … Continue reading

## Fibonacci numbers, 5

A small diversion before we come to the conclusion of this series. I am grateful to Robin Whitty for pointing this out to me. A set S of positive integers is recursively enumerable if there is a computer program which … Continue reading

Posted in exposition
Tagged Diophantine equations, Hilbert's tenth problem, Matijasevic's theorem
2 Comments