Is pure mathematics much more difficult compared to CP math or CP in general?
When I read Rudin's book Principles of Mathematical Analysis, for example, I feel like I am an idiot...
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Is pure mathematics much more difficult compared to CP math or CP in general?
When I read Rudin's book Principles of Mathematical Analysis, for example, I feel like I am an idiot...
Name |
---|
yes
Depends. For me, Yes.
In CP, you generally use concepts of applied mathematics that you may have encountered in the past. On the other hand, pure mathematics mostly consists of abstract definitions and theorems based on it. I find pure mathematics much more challenging.
lol, you think CP math is math.
Auto comment: topic has been updated by SisyphusWantsToBeHappy (previous revision, new revision, compare).
One of the differences between pure math and math for CP is the proofs. For example, during the contest, you submit your code and you get AC while you didn't prove your solution. But in pure mathematics, you usually need to prove your solution for a problem