Discrete Mathematics with Graph Theory (3rd Edition) 92

Discrete Mathematics with Graph Theory (3rd Edition) 92 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
90 Solutions to Exercises "crossed out" > for i to N do > P [i) := 1 : #p [i) o when integer i is "crossed out" > od: > for n from 2 to M do > if (p[n]=l) then > i := 1: > while (i*n<=N) do > p[hn] := 0: # "cross out" all multiples of of n > i := i+1: > od: > fi: > od: Print the results > j := 0: > for i to N do > if (p [i) = 1) then > printf("%5d", i) : > j := j+1: #j = no of primes printed > if (j mod 10 = 0) then printf("\n") #print 10 primes to a line > fi: > fi: > od: (b) Here are the primes less than 1000. 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 (c) 71&quot;(1000) is the number of primes not exceeding 1000 which, by (b), is 168; 1000/ In 1000 ~ 144.765 and 10;0 1?~~000 ~ 168/144.765 ~ 1.161....
View Full Document

This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.

Ask a homework question - tutors are online