To construct a function with several local constraints, start with simple cases and build from there |
24/05/2009 - 09:02 |
*5 years 52 weeks* ago |

To represent one object as combinations of another, try averaging the latter object using the symmetries of the former |
22/05/2009 - 19:44 |
*6 years 20 hours* ago |

Keep matrices in factored form |
22/05/2009 - 14:02 |
*6 years 1 day* ago |

Numerical linear algebra |
05/05/2009 - 13:46 |
*6 years 1 day* ago |

To prove facts about Borel sets, use closure properties |
05/05/2009 - 14:47 |
*6 years 3 days* ago |

Use Fourier expansion to eliminate nasty cutoffs |
02/04/2009 - 11:01 |
*6 years 1 week* ago |

To construct exotic sets, use limiting arguments |
15/05/2009 - 14:32 |
*6 years 1 week* ago |

I have a problem about open or closed sets |
13/05/2009 - 23:28 |
*6 years 1 week* ago |

To construct exotic functions, use limiting arguments |
25/03/2009 - 18:24 |
*6 years 1 week* ago |

Number of elements in cartesian products |
19/04/2009 - 23:24 |
*6 years 1 week* ago |

To prove that a set is open or closed, use basic theorems rather than direct arguments |
13/05/2009 - 23:48 |
*6 years 1 week* ago |

Bounded functions that behave almost everywhere are Riemann integrable |
24/04/2009 - 15:04 |
*6 years 1 week* ago |

To find a rational with low denominator near a given real, use continued fractions |
12/05/2009 - 22:32 |
*6 years 1 week* ago |

Computational number theory front page |
10/05/2009 - 15:40 |
*6 years 1 week* ago |

Elementary probability front page |
28/03/2009 - 04:47 |
*6 years 1 week* ago |

Probability front page |
28/03/2009 - 17:08 |
*6 years 1 week* ago |

Use an approximation as if it were exact |
11/05/2009 - 14:25 |
*6 years 1 week* ago |

LU factorization |
11/05/2009 - 13:52 |
*6 years 1 week* ago |

Numerical analysis front page |
04/05/2009 - 17:45 |
*6 years 1 week* ago |

Solution of linear equations: direct methods |
11/05/2009 - 13:37 |
*6 years 1 week* ago |

Make your method keep the symmetries of the problem |
11/05/2009 - 14:09 |
*6 years 1 week* ago |

To factorize n, find a non-trivial square root of 1 mod n |
10/05/2009 - 16:23 |
*6 years 1 week* ago |

To establish that n is composite, show that Fermat's little theorem does not hold for n |
10/05/2009 - 15:58 |
*6 years 1 week* ago |

To work out powers mod n, use repeated squaring |
10/05/2009 - 16:43 |
*6 years 1 week* ago |

To find a factor of n, find some m such that (m,n) is not 1 |
10/05/2009 - 16:13 |
*6 years 1 week* ago |

1 week 5 hoursago2 weeks 54 minago31 weeks 2 daysago52 weeks 4 hoursago2 years 22 weeksago