← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

B 附录B 集合等离散数学基础

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.790Z

f(ℕ) = {m : m = 2n for some n ∈ ℕ}, in other words, the set of nonnegative even integers.

A function is a surjection if its range is its codomain. For example, the function f (n) = ⌊n/2⌋ is a surjective function from ℕ to ℕ, since every element in ℕ appears as the value of

f for some argument. In contrast, the function f (n) = 2n is not a surjective function fr

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea