|
|
| Ratings Detail: Dirichlet's theorem on primes in arithmetic progressions |
|
Summary of current ratings for the object:
|
| Clarity: |
5 |
 |
| Correctness: |
5 |
|
| Pedagogy: |
3 |
 |
| Language: |
3 |
|
| Average: |
4 |
 |
| Number of votes counted (recent votes): |
8 |
| Number of votes counted (active votes): |
8 |
| All historical votes: |
8 |
Back to the object
Detailed list of ratings:
| User |
Date |
Clarity |
Correctness |
Pedagogy |
Language |
Comment |
| PrimeFan |
2008-07-16 21:01:08 |
5 |
5 |
2 |
4 |
Way too brief. Even if the proof is too long, at least a little something ought to be said about it. |
| CompositeFan |
2008-07-17 15:37:10 |
5 |
5 |
4 |
2 |
|
Back to the object |
|
|
|
