November 6, 2020
Three examples on computer proofs
Duke Kunshan University
Computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. In this talk, I will present three examples, applying symbolic computation in combinatorics & number theory. All of the examples can be partially/completely proven/solved by computer programs/packages/codes/etc. The first two are basic and elementary, so that they usually appear in the textbooks of analysis and combinatorics. The third one comes from a paper, as a clue on how this method can be used in research.
Slides for the talk (click)
Recorded video for the talk (click)