calc

© All Rights Reserved

2 views

calc

© All Rights Reserved

- Hodge, Jonathan K.; Schlicker, Steven; Sundstrom, Ted Abstract Algebra An Inquiry Based Approach.pdf
- p5.js Circle Game
- MT131 M131 00966597837185 TMA حل واجبات MT131 M131 المهندس أحمد @ الجامعة العربية المفتوحة
- Power Tower Part 2
- Www Tensorflow Org Building graphs
- Groups Numbers Crypto
- gcrt 2
- HW1 Sample
- High Frequency Words
- Comparing Functions
- A Course on Set Theory
- Division Ict Seminar
- Functions question bank.pdf
- Basketball
- Mooculus Print
- MM Lecture 2 Blank 2014
- Finite Field Arithmetic1
- znzstar[1]
- C++-MANUAL
- An application of DSmT in ontology-based fusion systems

You are on page 1of 6

Show all your work. Justify your solutions. Answers without justification will not receive full marks.

Only hand in the problems on page 2.

Practice Problems

Question 1. Using the Prime Number Theorem, estimate the number of prime numbers between

2 million and 7 million.

Solution:

The number of primes between 2000000 and 7000000

= π(7000000) − π(1999999)

≈ 7000000/ log(7000000) − 1999999/ log(1999999)

≈ 306274.

Question 2.

(b) Let n ∈ N and let p be a prime. Show that if p | n then ϕ(np) = pϕ(n). Hint: consider the

prime factorization of n.

Solution:

(a)

ϕ(1200) = ϕ(24 · 3 · 52 ) = ϕ(24 ) · ϕ(3) · ϕ(52 ) = (1 · 23 )(2 · 30 )(4 · 51 ) = 320

n = pe pe11 pe22 · · · pekk ,

for some k. Thus

ϕ(n) = ϕ(pe ) ϕ(pe11 pe22 · · · pekk )

= (p − 1)pe−1 ϕ(pe11 pe22 · · · pekk )

= ϕ(pe+1 ) ϕ(pe11 pe22 · · · pekk )

= (p − 1)pe ϕ(pe11 pe22 · · · pekk )

= pϕ(n)

Question 3.

(b) Use repeated squaring to simplify 599 (mod 101).

(c) Hence solve the equation 5x ≡ 31 (mod 101).

1

2301 Assignment 2 Due Thursday 1st April, 2 pm

5100 ≡ 1 (mod 101),

so

599 · 5 ≡ 5 · 599 ≡ 1 (mod 101),

which by definition means that 599 is the inverse of 5 modulo 101.

532 ≡ 312 ≡ 52, 564 ≡ 522 ≡ 78 (mod 101). Thus

599 = 564+32+2+1

≡ 564 · 532 · 52 · 51 (mod 101)

≡ 78 · 52 · 25 · 5 (mod 101)

≡ 81 (mod 101)

Check: 5 · 87 = 435 ≡ 31 (mod 101).

Question 4. Find the two smallest positive integer solutions to the following system of equivalences

x ≡ 2 (mod 5)

x ≡ 5 (mod 8)

x ≡ 4 (mod 37)

M1 = 8 · 37 = 296 M2 = 5 · 37 = 185 M3 = 5 · 8 = 40

M1 ≡ 1 (mod 5) M2 ≡ 1 (mod 8) M3 ≡ 3 (mod 37)

We have 1 · 1 ≡ 1 (mod 5) 1 · 1 ≡ 1 (mod 8) 3 · 25 ≡ 1 (mod 37),

so N1 = 1, N2 = 1, N3 = 25,

Thus x ≡ 2 · 296 · 1 + 5 · 185 · 1 + 4 · 40 · 25 = 5517 ≡ 1077 (mod 5 · 8 · 37). An integer satisfies the

system of congruences iff it is in this congruence class modulo 5 · 8 · 37 = 1480. The two smallest

positive integers in this congruence class are 1077 and 2557.

Question 5.

(b) Find the order of 2 and 8, and state which one is a primitive root.

(c) Using this primitive root, find x ∈ (Z/27Z)× such that x7 ≡ 13 (mod 27).

(Z/27Z)× = {1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20, 22, 23, 25, 26}.

(b)

n : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

2n : 2 4 8 16 5 10 20 13 26 25 23 19 11 22 17 7 14 1

8n : 8 10 26 19 17 1 8 10 26 19 17 1 8 10 26 19 17 1

2

2301 Assignment 2 Due Thursday 1st April, 2 pm

Thus 2 has order 18 = ϕ(27) and is a primitive root, while 8 has order 6 and is not a primitive root.

(c) From the above table, 13 ≡ 28 (mod 27). Since 2 is a primitive root and x ∈ (Z/27Z)× , x is some

power of 2 (mod 27). So let x = 2y . Then

x7 ≡ 13 (mod 27)

becomes

(2y )7 = 27y ≡ 28 (mod 27).

Then since 2 has order ϕ(27) = 18,

7y ≡ 8 (mod 18).

Multiplying both sides by 13 (find by trial and error or Euclid’s algorithm) gives y ≡ 14 (mod 18),

which we substitute back to get x ≡ 214 ≡ 22 (mod 27).

3

2301 Assignment 2 Due Thursday 1st April, 2 pm

Assignment Problems

Question 1.

(b) Calculate 100−1 (mod 2011).

(c) Calculate ϕ(2010).

Solution:

(a) 30

(b) 181

(c) 528.

Question 2. Your Facebook friend posts the RSA public key (N = 3551, e = 1565), hoping

for secret messages from fans of repeated squaring. While looking through their rubbish, you find a

scrap of paper with the number 67 on it, one of your favourite primes. You instantly know that it is

significant. Find your friend’s private key.

Solution: The significance of 67 is that it is a factor of N = 3551, and using it we obtain the prime

factorization of N , namely N = 53 · 67. Thus ϕ(N ) = 52 · 66 = 3432. The private key, d, is the inverse

of e = 1565 modulo 3432. We find it using Euclid’s algorithm:

3432 1 0

2 1565 0 1

5 302 1 −2

5 55 −5 11

2 27 26 −57

27 1 −57 125

0

Thus the private key is 125.

Question 3. Find the smallest positive integer x satisfying the following system, or show that no

such x exists:

2x ≡ 1 (mod 3)

3x ≡ 2 (mod 5)

4x ≡ 3 (mod 7)

5x ≡ 4 (mod 11)

Hint: First multiply the first equation by 2−1 , the second by 3−1 etc.

Solution: 2−1 ≡ 2 (mod 3), 3−1 ≡ 2 (mod 5), 4−1 ≡ 2 (mod 7), 5−1 ≡ 9 (mod 11), so the system

becomes

x ≡ 2 (mod 3)

x ≡ 4 (mod 5)

x ≡ 6 (mod 7)

x ≡ 3 (mod 11)

We solve this via the CRT: x ≡ 839 (mod 1155). So the smallest positive solution is x = 839.

4

2301 Assignment 2 Due Thursday 1st April, 2 pm

(

2n, if n ≥ 0

f (n) =

−1 − 2n, if n < 0

Prove that f is a bijection. Give a formula for f −1 (m).

Solution: f is injective: Note that f (n) is even if n ≥ 0 and is odd if n < 0. Thus if f (n) = f (m),

either both m, n ≥ 0, or both m, n < 0. In the first case 2m = f (m) = f (n) = 2n so m = n. In the

second case −1−2m = f (m) = f (n) = −1−2n so 2m = 2n so m = n. Thus f (n) = f (m) =⇒ n = m

in all cases.

f is surjective: Let N ∈ N ∪ {0}. If N is even, let N = 2n for integer n ≥ 0. Then f (n) = 2n = N . If

N is odd, let N = 2k − 1 for some positive integer k. Then f (−k) = −1 − 2(−k) = 2k − 1 = N . So

in all cases, given N ∈ N ∪ {0} there exists m ∈ Z with f (m) = N .

Since k = (N + 1)/2, this analysis shows:

(

−1 n/2, if n is even

f (n) =

−(n + 1)/2, if n is odd.

f (n/2) = 2(n/2) = n. If n ∈ N ∪ {0} is odd then −(n + 1)/2 is a negative integer and f (f −1 (n)) =

f (−(n + 1)/2) = −1 − 2(−(n + 1)/2) = −1 + n + 1 = n, so f ◦ f −1 = 1N∪{0} .

Similarly, if n ∈ Z and n ≥ 0 then f (n) = 2n is even and f −1 (f (n)) = f −1 (2n) = (2n)/2 = n. If n ∈ Z

and n < 0 then f (n) = −1−2n is odd and f −1 (f (n)) = f −1 (−1−2n) = −(−1−2n+1)/2 = 2n/2 = n.

So f −1 ◦ f = 1Z .

inverse for g if f ◦ g = 1A . A function h : B → A is a right inverse for g if g ◦ h = 1B .

(b) Show that g has a right inverse iff it is surjective.

a = 1A (a) = (f ◦ g)(a) = f (g(a)) = f (g(b)) = (f ◦ g)(b) = 1A (b) = b, so g is injective.

⇐= Fix a0 ∈ A. If g is injective, for each b ∈ A there is at most one a ∈ A with g(a) = b. Define

f : B → A by (

a, if there exists a with g(a) = b

f (b) =

a0 , if there is no a with g(a) = b.

Then f (g(a)) = f (b) where g(a) = b, so f (b) = a by definition. Hence for all a ∈ A we have

(f ◦ g)(a) = f (g(a)) = a = 1A (a), so f ◦ g = 1A , so g has left inverse f . Notice that a0 plays no role.

(b) =⇒ Suppose g : A → B has a right inverse h : B → A, so g ◦ h = 1B . Let b ∈ A, and let a = h(b).

Then g(a) = g(h(b)) = (g ◦ h)(b) = 1B (b) = b, so g is surjective.

⇐= Suppose g is surjective. Then for each b ∈ A there exists (at least one) a ∈ A with g(a) = b. For

each b, choose a corresponding element ab such that g(ab ) = b. Now define h : B → A by h(b) = ab .

Then (g ◦ h)(b) = g(h(b)) = g(ab ) = b for all b ∈ A, so g ◦ h = 1B , and g has right inverse h.

In this direction we are required to make a simultaneous choice of ab for each b; this is allowed according to the Axiom

of Choice in Set Theory (see Math 3306).

5

2301 Assignment 2 Due Thursday 1st April, 2 pm

(b) (a, b) ◦ (c, d) = (a + c, 2−c b + d);

(c) (a, b) • (c, d) = (a + c, 2c b − d).

Determine if ?, ◦, and • are associative. For the associative operations, determine if there is an

identity element.

Solution: All three are binary operations on G.

Check associativity:

(a, b) ? (c, d) ? (e, f ) = (a + c, 2c b + d) ? (e, f ) = (a + c + e, 2e (2c b + d) + f )

c+e e

= (a + c + e, 2 b + 2 d + f ).

(a, b) ? (c, d) ? (e, f ) = (a, b) ? (c + e, 2e d + f ) =

= (a + c + e, 2c+e b + 2e d + f ).

(a, b) ◦ (c, d) ◦ (e, f ) = (a + c, 2−c b + d) ◦ (e, f ) = (a + c + e, 2−e (2−c b + d) + f )

−(c+e) b + 2−e d + f ).

= (a + c + e, 2

(a, b) ◦ (c, d) ◦ (e, f ) = (a, b) ◦ (c + e, 2−e d + f ) =

= (a + c + e, 2−(c+e) b + 2−e d + f ).

(a, b) • (c, d) • (e, f ) = (a + c, 2c b − d) • (e, f ) = (a + c + e, 2e (2c b − d) − f )

c+e e

= (a + c + e, 2 b − 2 d − f ).

(a, b) • (c, d) • (e, f ) = (a, b) • (c + e, 2e d − f ) = (a + c + e, 2c+e b − (2e d − f ))

= (a + c + e, 2c+e b − 2e d + f ).

So • is not associative.

Check identity:

If (a, b) ? (c, d) = (a, b) then a + c = a, 2c b + d = d so c = 0 and b + d = b so d = 0. So if there

is an identity, it must be (0, 0). Check: (a, b) ? (0, 0) = (a + 0, 20 b + 0) = (a, b) and (0, 0) ? (a, b) =

(0 + a, 2a 0 + b) = (a, b). So (0, 0) is the identity.

is an identity, it must be (0, 0). Check: (a, b) ◦ (0, 0) = (a + 0, 20 b + 0) = (a, b) and (0, 0) ◦ (a, b) =

(0 + a, 2−a 0 + b) = (a, b). So (0, 0) is the identity.

- Hodge, Jonathan K.; Schlicker, Steven; Sundstrom, Ted Abstract Algebra An Inquiry Based Approach.pdfUploaded byEnrique
- p5.js Circle GameUploaded byKelly Lougheed
- MT131 M131 00966597837185 TMA حل واجبات MT131 M131 المهندس أحمد @ الجامعة العربية المفتوحةUploaded byMohamed Ali
- Power Tower Part 2Uploaded byJacob Richey
- Www Tensorflow Org Building graphsUploaded byJose Garcia
- Groups Numbers CryptoUploaded byВладимир Божовић
- gcrt 2Uploaded byMaria Victoria Navarro
- HW1 SampleUploaded byRahul Singh
- High Frequency WordsUploaded byViswasam Pugazhenthi
- Comparing FunctionsUploaded byمحمد أحمد عبدالوهاب محمد
- A Course on Set TheoryUploaded byHassan Yossry Ibrahim
- Division Ict SeminarUploaded byXenn Mar Rivera
- Functions question bank.pdfUploaded byneeraj
- BasketballUploaded byjumperpc3000
- Mooculus PrintUploaded bythe_coolboys
- MM Lecture 2 Blank 2014Uploaded bySabrina Johnson
- Finite Field Arithmetic1Uploaded byVignish Swaminathan
- znzstar[1]Uploaded bysufian
- C++-MANUALUploaded byVidya Sharan
- An application of DSmT in ontology-based fusion systemsUploaded byDon Hass
- Modular ArithmeticUploaded byDuandy
- lesson plan observation 1Uploaded byapi-356010663
- Lecture 1 - Business Calculus - Functions,Domain,RangeUploaded bymichael
- wtgg 2.7Uploaded byNicole Monderin
- Further Nov 02 p1Uploaded bykhey
- CCR-LN-TG.pdfUploaded byMary Ann Amparo
- A set is an ordered collection of objects.docxUploaded by在于在
- 1990 Book AnalyticNumberTheoryUploaded byHolman Ayala
- Revision Set Relation and Function AnsUploaded byhasha
- GENMATH BOOKLETUploaded byCheryl Marie Alimba

- Complex Numbers ExercisesUploaded byVíctor de la Cruz
- HW1(CE21)Uploaded byjuls
- WKS001_010_636149.pdfUploaded byjuls
- Butter MilkUploaded byjuls
- 18-TransportationUploaded bympe1
- cs4Uploaded byjuls
- The Necklace short storyUploaded bykarthik arunmozhi
- popmake-valentinebox.pdfUploaded byjuls
- Typhoon EllenUploaded byjuls
- 148627143-Hydraulics-Reviewer.docUploaded byKarl Anne Domingo
- Construction Generals CorporationUploaded byjuls
- Insight-Maths-8-SB-Ch12.pdfUploaded byjuls
- Sample-Curricula-Bachelor-of-Science-in-Civil-Engineering.pdfUploaded byRommel Dave Tejano
- Exam2 Solutions CopyUploaded byjuls
- Work Energy Methods WUploaded byFrodo Bargins
- ZipGrade100QuestionV2.pdfUploaded byjuls
- Solving Exponential and Logarithmic EquationsUploaded byUday Prakash Sahu
- tptnEnggUploaded byjuls
- Clep Collegealgebra a PrintUploaded byjuls
- ProblemSheet3 5 SolsUploaded byjuls
- S 4-e DESIGN EXAMPLES - ALL.pdfUploaded bymtuanlatoi9704
- 1253926953-BS Civil Engg curriculum.pdfUploaded byRamces Soliman
- nptel_ceTEI_L14Uploaded byArpit Singh
- ShearUploaded byahmedsabercg
- MethodologyUploaded byvijaykadam_nda
- Probability.pdfUploaded byjuls
- 1revsolnUploaded byjuls
- Matrix MultiplicationUploaded bylexxus661
- Sol Multi Angl Form 1Uploaded byjuls

- In Re: Aurelio Murillo v., 3rd Cir. (2010)Uploaded byScribd Government Docs
- Life of ApolloniusUploaded byx083
- Kanazawa StatementUploaded byWesley Yang
- Backtesting FullUploaded bySarath Chandra
- 7) Design of One-Way SlabsUploaded byVanessa Rosal Paler
- Theories on Aging - partial notes from Scribd.docUploaded bySpislgal Philip
- 1. Basic Physics of Ultrasound and the Doppler PhenomenonUploaded byRamani Ravi Shankar
- C-13_Chapter_7_may2010Uploaded byEldynandTrissandiTyawarman
- reflections -setting limits in the classroomUploaded byapi-311364738
- 10W Ultra-Broadband Power Amplifier_ A K Ezzeddine_ H C Huang_ 2008.pdfUploaded byFernando Ferreira
- 5_6260114884906713097Uploaded bySatrio Arief
- ROMAN.docxUploaded bymakahiya
- Effective Communication Skills | Karriem a muhammadUploaded byKarriem a Muhammad
- gi disease mcinerney sam may 2016Uploaded byapi-242113272
- 4.1 Rubric Workshop Handout-Mary AllenUploaded byMadhawa Ranawake
- 78352__speedjrnlvol1Issue1.pdfUploaded bysanthosh
- dr mamUploaded byakshay shirke
- ak_llc_pkgUploaded bySteven Tennies
- A Guide to Creating Dashboards People Love to UseUploaded byPeter de Clerck
- Reelection From Curved SurfacesUploaded byShreeyansh Bhardwaj
- NYC DOE Fact Sheet On Closure Of IS 231 In QueensUploaded byCity Limits (New York)
- Renal CalculiUploaded byArie
- Ankit's RésuméUploaded byankittri7
- Authorizations in an SAP BW Project.pdfUploaded bySuryya Kanta Adhikary
- Yemen Genocide (web)Uploaded byAnonymous iDI36msvkH
- 11340-13659-1-PB(1)Uploaded byDedy Kristianto
- GAISP v30Uploaded byHDMC
- lecture30.pdfUploaded byJuan
- Bic Judges BriefUploaded byGeorge Stamatis
- Control System DesignUploaded byAbhinav

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.