1. Trang chủ
  2. » Giáo án - Bài giảng

Discrrete mathematics for computer science strong induction warmup

11 98 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 11
Dung lượng 133,77 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

Warm-up Problem• Prove by induction: Every n≥8 is the sum of 3’s and 5’s “n is triquinqual”... Prove m+1 is triquinqual... Prove m+1 is triquinqual.

Trang 1

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s

Trang 2

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

Trang 3

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof:

o n =

Trang 4

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof:

o n = 8 =

Trang 5

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof:

o n = 8 = 3+5 is triquinqual

o n = 9

Trang 6

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof: Need multiple base cases

o n = 8 = 3+5 is triquinqual

o n = 9

Trang 7

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof: Need multiple base cases

o n = 8 = 3+5 is triquinqual

o n = 9 = 3+3+3 is triquinqual

o n =

Trang 8

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof: Need multiple base cases

o n = 8 = 3+5 is triquinqual

o n = 9 = 3+3+3 is triquinqual

o n = 10 = 5+5 is triquinqual

o (I.H.) Assume

Trang 9

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof: Need multiple base cases

o n = 8 = 3+5 is triquinqual

o n = 9 = 3+3+3 is triquinqual

o n = 10 = 5+5 is triquinqual

o (I.H.) Assume m ≥ 10 and every n≤m is triquinqual Prove

Trang 10

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof: Need multiple base cases

o n = 8 = 3+5 is triquinqual

o n = 9 = 3+3+3 is triquinqual

o n = 10 = 5+5 is triquinqual

o (I.H.) Assume m ≥ 10 and every n≤m is triquinqual Prove m+1 is triquinqual.

Trang 11

Warm-up Problem

• Prove by induction: Every n≥8 is the sum of 3’s and 5’s (“n is triquinqual”)

• Proof: Need multiple base cases

o n = 8 = 3+5 is triquinqual

o n = 9 = 3+3+3 is triquinqual

o n = 10 = 5+5 is triquinqual

o (I.H.) Assume m ≥ 10 and every n≤m is triquinqual Prove m+1 is triquinqual.

o m+1 is triquinqual because m+1 = (m-2)+3 and m-2 ≥ 8 is triquinqual.

Ngày đăng: 22/03/2019, 12:08