Can Listening to Lectures Guarantee Solving Problems? Exploring Inverse Logic

A Relationship Between Listening to Lectures and Solving Problems

If a student fully understands a lecture, does that guarantee they can solve related problems? Conversely, does strong performance on problem‑solving tests indicate a solid grasp of the underlying knowledge framework? This article explores these questions.

The author hypothesizes that the logic of listening to a lecture and the logic of solving a problem are mutually inverse, and similarly, the logic of teaching and the logic of test‑making are inversely related.

In a typical mathematics class, after laying the conceptual groundwork, the teacher presents a theorem, then some corollaries, and finally example problems to aid understanding. For the purpose of this discussion, definitions are set aside, and both theorems and corollaries are treated uniformly as “theorems,” while definitions are regarded as “propositions” used for tests or assignments.

A theorem consists of conditions and a conclusion. The conditions may be multiple and are themselves abstract concepts—representations of a class of objects rather than a single instance. The abstract conditions are called “conditions,” and the concrete instances that satisfy a condition are called “situations.” The real problem to be solved, or “proposition,” is composed of many such situations.

When a student “listens well,” they may understand the abstract conditions and conclusions that form a theorem, but they might not grasp the full range of concrete situations that those conditions can take, nor be able to solve the propositions built from those situations. Conversely, solving a problem well means obtaining the correct answer for a specific proposition composed of concrete situations, yet due to factors such as the teacher’s highlighted points, the student’s guessed focus, and typical example problems, good performance on a single problem does not necessarily reflect a thorough understanding of the overall framework.

Assume there are n theorems, each with m conditions, and each condition has p possible situations. The number of distinct propositions that can be generated from a single theorem is:

Therefore, the total number of propositions that can be generated from n theorems is:

For example, with n = 5 , m = 3 , and p = 5 , one could generate 175 distinct problems (not accounting for erroneous propositions).

This raises the question: how can a student possibly master so many problems?

While mastering classic theorems is challenging, most propositions can be tackled by reducing them to a few standard forms. The author plans to discuss detailed reduction methods later, suggesting that many propositions share isomorphic or homomorphic relationships, allowing the effective number of distinct problems to be dramatically reduced.

In summary, fully understanding every mathematical proposition and being able to solve all of them is difficult. Traditional study methods emphasize attentive listening, diligent practice, and active review. However, by recognizing patterns in problem creation and applying reduction techniques, learners can adopt more efficient study strategies.