09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

510 ANSWERS TO EXERCISES<br />

In both cases it will be helpful to know the number of fractions that are<br />

strictly less than (k - l)/(N + 1) in LPN; this is<br />

1<br />

= i(kN-dtl), d = gcd(k-l,N+l),<br />

by (3.32). Furthermore, the number of fractions equal to (k - l)/(N + 1) in<br />

~PN that should precede it in iPN+l is i (d - 1 - [d even]), by the nature of<br />

organ-pipe order.<br />

IfkNisodd,thendisevenand(k-l)/(N+l)isprecededbyt(kN-l)<br />

elements of ?N; this is just the correct number to make things work. If kN is<br />

even, than d is odd and (k - 1 )/( N + 1) is preceded by i (kN ) elements of ?N.<br />

If d = 1, none of these equ’als (k - l)/(N + 1) and ‘J’N,~N is ‘

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!