[프로그래밍 언어] 프로그래밍 언어론 솔루션 유원희,하상호 공역 홍릉과학 출판사

소개글

솔루션이 없어서 고생하시는 분들을 위해 올립니다.
유용하게 쓰세요

목차

프로그래밍언어론
concepts of Programming Language
sithth EDITION

Robert W. Sebesta 저
유원희 , 하상호 공역

홍릉과학 출판사

전chapter에 대한 문제 솔루션 포함

본문내용

Chapter 3
Instructor's Note:
In the program proof on page 149, there is a statement that may not be clear to all, specifically, (n + 1)* … * n = 1. The justification of this statement is as follows:
Consider the following expression:
(count + 1) * (count + 2) * … * n
The former expression states that when count is equal to n, the value of the later expression is 1. Multiply the later expression by the quotient:
(1 * 2 * … * count) / (1 * 2 * … * count)
whose value is 1, to get
(1 * 2 * … * count * (count + 1) * (count + 2) * … * n) /
(1 * 2 * … * count)
The numerator of this expressions is n!. The denominator is count!. If count is equal to n, the value of the quotient is
n! / n!
or 1, which is what we were trying to show.

참고 자료

없음