Scribd
Upload
66 views1 page

HMWK 1

This document outlines 6 problems for Homework 1 that is due on January 26th, 2022. The problems cover topics like finding solutions to modular equations, computing greatest common divisors using the Euclid Algorithm, factoring numbers into primes, and finding greatest common divisors of Fibonacci numbers. Students are asked to type their solutions and submit them as a PDF file.

Uploaded by

pindari saab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views1 page

HMWK 1

This document outlines 6 problems for Homework 1 that is due on January 26th, 2022. The problems cover topics like finding solutions to modular equations, computing greatest common divisors using the Euclid Algorithm, factoring numbers into primes, and finding greatest common divisors of Fibonacci numbers. Students are asked to type their solutions and submit them as a PDF file.

Uploaded by

pindari saab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS378, Spring 2023

Homework 1 – due 01/26/2022

Problem 1

(a) Find integers x and y such that 1 = 26x + 55y. If you think the problem has no solutions, explain why.

(b) Find integers x and y such that 1 = 28x + 105y. If you think the problem has no solutions, explain why.

(c) If you found a solution in (a) or (b), can you also find another solution to that problem? If not - why not?
If yes, what is it?

Problem 2

(a) Find 28−1 (mod 55)

(b) Solve 28x + 11 ≡ 6 (mod 55)

Problem 3

(a): Find all integer solutions of 12x ≡ 52 (mod 238).

(b): Find all integer solutions of 12x ≡ 26 (mod 238).

Problem 4

(a): Use the EA to compute gcd(1870, 359) and gcd(359, 273).

(b): Using the results of (a) and the fact that 1870 = 2 · 5 · 11 · 17 and 273 = 3 · 7 · 13, prove that 359 is
prime.

Problem 5

(a): Compute gcd(12317, 10573) (show the results of all iterations of the Euclid Algorithm).

(b): Using the result from (a), factor 12317 and 10573 into products of prime.

Problem 6

(a): Define the Fibonacci sequence by F1 = 1, F2 = 1 and Fn+1 = Fn + Fn−1 . Use the EA to find
gcd(Fn , Fn−1 ).

(b): Find gcd(22 . . . 2, 22 . . . 2), where the first integer’s decimal representation is a sequence of 38 2’s, and
the second integer’s decimal representation is a sequence of 21 2’s.

(c) Solve (b), in the general case when the first integer is a sequence of n 2’s and the second integer isd a
sequence of m 2’s.

Your solution must be typed (wordprocessed), and submitted as a pdf document to canvas

You might also like