View the step-by-step solution to:

Question

# please  help to solve the problems as the attachment? The problemsisthe algorithms of computer science

undergraduate level.  For example,  logic, sets sequence countings, intervals, Lexicographic-Order

1. 2. Book Problem #9-c: Should 1974 × 0.985816 ( mod 1974 ) equal 4678352 (mod 1974)? a) Explain why or why not. 2. Book Problem #10: Use K=1980 for the year and N=3732000 for the phone number. Use Euclid’s a) Algorithm to Fnd GCD(N, K), GCD(N, K+1), and GCD(N, K+2) 3. Book Problem #11: Use Euclid’s Algorithm to Fnd GCD(N+1, N) for any posiTve integer N. Does this a) show that N and N+1 never have a prime factor in common? 4. Book Problem #13: Convert 111001101.1011 from base 2 to base 10. 5. Convert 2017 (base 10) into binary and then from binary to hexadecimal. 6. Book Problem #17b: Use the BisecTon Algorithm to Fnd an approximate soluTon to a) x 5.3 + 3.5 x = 6411094 . (*±echnology recommended!) 7. Use Newton's Method to calculate the square root of A = 2,320.3489 a) (*±echnology recommended!)  1. 2. Book Problem #9-c: Should 1974 ×0.985816 (mod 1974) equal 4678352 (mod 1974)?
a) Explain why or why not.
No. Because there are brackets in the mod part hence evaluation will be from right to...

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents