Math 785 HW Review 1

Homework Review
Notes 1, Problem 1
Let a and b be positive integers, and write
a
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
b
where m is a positive integer, the dj are digits, and r is
chosen as small as possible. Prove that r divides (b)
where is Eulers function.
m = p11 p22 perr
(m) =
m = p11 p22 perr

e 1
(m) = p11
perr 1
m = p11 p22 perr

e 1
(m) = p11
perr 1(p1 1) (pr 1)
m = p11 p22 perr

e 1
(m) = p11
perr 1(p1 1) (pr 1)
Remark: If b0|b, then (b0)|(b).
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
WLOG, k = 0. Why?
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
WLOG, k = 0. Why?
Otherwise consider
10k a
b
a
b
= m.d1d2 . . . dr
a
b
= m.d1d2 . . . dr
a
r
10 1 = md1d2 . . . dr m
b
a
b
= m.d1d2 . . . dr
a
r
10 1 = md1d2 . . . dr m
b
a
r
10 1 Z
b
a
r
10 1
Z
b
a
r
10 1
Z
b
Suppose
a0
= 0 where gcd(a0, b0) = 1.

b
b
a0
10r 1 0 Z
b
Suppose
a0
= 0 where gcd(a0, b0) = 1.

b
b
a0
10r 1 0 Z
b
Suppose
a0
= 0 where gcd(a0, b0) = 1. Then

b
b
b0|
a0
10r 1 0 Z
b
Suppose
a0

b
b

0
r
b | 10 1 .
a0
10r 1 0 Z
b
Suppose
a0

b
b

0
r
b | 10 1 .
IDEA: r is the order of 10 modulo b0
a0
10r 1 0 Z
b
Suppose
a0

b
b

0
r
b | 10 1 .

= r|(b0)
a0
10r 1 0 Z
b
Suppose
a0

b
b

0
r
b | 10 1 .

= r|(b0)
= r|(b)
a0
10r 1 0 Z
b
Suppose
a0

b
b

0
r
b | 10 1 .

= r|(b0)
= r|(b)
Whats wrong with this IDEA?
Finish the proof by showing that if t is such that

0
t
b | 10 1 ,
then
a0
b0
= m.d1d2 . . . dt.
Finish the proof by showing that if t is such that

0
t
b | 10 1 ,
then
a0
b0
So t r.
= m.d1d2 . . . dt.
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 =
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) =
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) = b is prime
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) = b is prime
b 6= 2
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) = b is prime
b 6= 2
and
b 6= 5
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) = b is prime
b 6= 2
and
b 6= 5
gcd(a, b) = 1
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) = b is prime
a
b1
10
1 Z
b
Notes 1, Problem 2
a
b
= m.d1d2 . . . dk dk+1dk+2 . . . dk+r
r = b 1 = (b 1)|(b) = b is prime
a
b1
10
1 Z
b
= k = 0
Notes 1, Problem 2
Examples:
Notes 1, Problem 2
Examples:
1
11
= 0.090909 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Examples:
1
11
1
61
= 0.090909 . . .
= 0.01639344262295081967213114754098
3606557377049180327868852459 . . .
Notes 1, Problem 2
Suppose r = b 1.
(i) Prove that each of the digits 0, 1, . . . , 9 occurs among
the digits d1, d2, . . . , dr either
[(b 1)/10]
or
[(b 1)/10] + 1
times.
(ii) Prove that 0 occurs [(b1)/10] times among the digits
d1, d2, . . . , dr .
b = p, a prime
b = p, a prime
Note: r = p1 = the order of 10 modulo p is p 1
b = p, a prime
The values of 10j a modulo p are distinct for 0 j
p2
b = p, a prime
p 2 and are congruent to 1, 2, . . . , p 1 in some order.
b = p, a prime
10j a = pqj + rj
b = p, a prime
10j a = pqj + rj =
10j a
p
= qj +
rj
p
b = p, a prime
10j a = pqj + rj =
10j a
p
10j a
p
= qj +
rj
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .
b = p, a prime
10j a = pqj + rj =
10j a
p
10j a
p
= qj +
rj
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}
qj
b = p, a prime
10j a = pqj + rj =
10j a
p
10j a
p
= qj +
rj
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
rj /p
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
rj /p
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
rj /p
rj varies from 1 to p 1
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
rj
p
<
rj /p
1
10
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
rj
p
<
rj /p
1
10
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
rj
p
<
rj /p
1
10
= dj+1 = 0
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
0
1
10
rj
p
rj
p
<
<
rj /p
1
10
2
10
= dj+1 = 0
=
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
0
1
10
rj
p
rj
p
<
<
rj /p
1
10
2
10
= dj+1 = 0
= dj+1 = 1
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
0
1
10
2
10
rj
p
rj
p
rj
p
<
<
<
rj /p
1
10
2
10
3
10
= dj+1 = 0
= dj+1 = 1
= dj+1 = 2
10j a
p
= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

|
{z
}|
{z
}
qj
0
1
10
2
10
rj
p
rj
p
rj
p
..
<
<
<
rj /p
1
10
2
10
3
10
= dj+1 = 0
= dj+1 = 1
= dj+1 = 2
..
2
10
rj
p
<
3
10
= dj+1 = 2
2
10
2p
10
rj
p
<
rj <
3
10
3p
10
= dj+1 = 2
= dj+1 = 2
2
10
2p
10
rj
p
<
rj <
3
10
3p
10
= dj+1 = 2
= dj+1 = 2
1 rj p 1
2
10
2p
10
rj
p
<
rj <
3
10
3p
10
= dj+1 = 2
= dj+1 = 2
1 rj p 1

dj+1 = 2 for
3p
10
2p
10

values of j [1, p 1]

dj+1 = 2 for
3p
10
2p
10


dj+1 = 2 for
To Show:
3p
10
2p
10


dj+1 = 2 for
3p
10
2p
10

To Show:

p1
10
3p
10
2p
10
p1
10

+1

dj+1 = 2 for
3p
10
2p
10

To Show:

p1
10
3p
10
2p
10
Cases: p = 10k + 1, p = 10k + 3,

p = 10k + 7, p = 10k + 9
p1
10

+1
Case: p = 10k + 1
Case: p = 10k + 1
p1
10
3p
10
2p
10
p1
10

+1
Case: p = 10k + 1
p1
10
3p
10
2p
10
p1
10

+1
Case: p = 10k + 1
p1
10
3p
10
2p
10
p1
10

+1
Case: p = 10k + 1
p1
10
3p
10
2p
10
p1
10
+1
Case: p = 10k + 1
p1
10
3p
10
2p
10
p1
10
+1
k+1
Case: p = 10k + 1
p1
10
3p
10
2p
10
p1
10
+1
k+1
Case: p = 10k + 1
p1
10
3p
10
3k 2k
2p
10
p1
10
+1
k+1
Case: p = 10k + 7
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10

+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10

+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10

+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10
+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10
+1
k+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10
+1
k+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
(3k + 2) (2k + 1)
p1
10

+1
Case: p = 10k + 7
p1
10
3p
10
2p
10
p1
10
(3k + 2) (2k + 1) = k + 1
+1
Notes 1, Problem 3
Prove e2 is irrational.
Main Tool: What power of 2 divides n! ?

n
2

n
4

n
8

n
2

n
4

n
8
n
2
n
4
n
8

n
2

n
4

n
8
2
=n
n
4
n
8

n
2

n
4

n
8
When does 2n1 divide n! ?
2
=n
n
4
n
8

n
2

n
4

n
8
2
=n
n
4
n = 2k
n
8

n
2

n
4

n
8
2
=n
n
4
n = 2k
2k1 + 2k2 + + 2 + 1
n
8

n
2

n
4

n
8
2
=n
n
4
n = 2k
2k1 + 2k2 + + 2 + 1 = 2k 1
n
8

n
2

n
4

n
8
2
=n
n
4
n
8
n = 2k
2k1 + 2k2 + + 2 + 1 = 2k 1 = n 1

n
2

n
4

n
8
2
=n
n
4
n
8
n = 2k
2k1 + 2k2 + + 2 + 1 = 2k 1 = n 1
At most 2n1 divides n! and this occurs when n = 2k .
e2 = 1 + 2 +
22
2!
23
3!
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E=
1
m+1
2
(m + 1)(m + 2)
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E=
1
m+1
2
(m + 1)(m + 2)
+ > 0
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E=
1
m+1
2
(m + 1)(m + 2)
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E<
1
m+1
2
(m + 1)2
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E<
1
m+1
2
(m + 1)2
22
(m + 1)3
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E<
1
m+1
1
2
(m + 1)2
m+1
2
1
m+1
22
(m + 1)3
e2 = 1 + 2 +
22
2!
23
3!

2
m
2
2
2
+ 2m+1E
+ +
m!e = m! 1 + 2 +
2!
m!
E<
1
m+1
1
2
(m + 1)2
1
m+1
=
=
2
m1
1
m+1
22
(m + 1)3

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1
Idea: Take m = 2k (sufficiently large).

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1
Idea: Take m = 2k (sufficiently large). Then the power

of 2 dividing m!2n/n! is 2t where
t

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1

t

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1

t (m 1) +

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1

t (m 1) + n

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1

t (m 1) + n (n 1) =

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
+ +
2!
m!
0<E<
1
m1

t (m 1) + n (n 1) = m.
Assume e2 is rational.

2
m
2
2
2
+ 2m+1E
m!e = m! 1 + 2 +
++
2!
m!

m!e2 = m! 1 + 2 +
|
22
2!
{z
+ +
divisible by 2m

m
2
m! }
+ 2m+1E

m!e2 = m! 1 + 2 +
| {z }
|
2mC
22
2!
{z
+ +
divisible by 2m

m
2
m! }
+ 2m+1E

m!e2 = m! 1 + 2 +
| {z }
|
2mC
22
2!
{z
+ +
divisible by 2m

m
2
+ 2m+1E
m! } | {z }
2mC

m!e2 = m! 1 + 2 +
| {z }
|
2mC
22
2!
{z
+ +
divisible by 2m
= 2C+1E Z

m
2
+ 2m+1E
m! } | {z }
2mC

m!e2 = m! 1 + 2 +
| {z }
|
2mC
22
2!
{z
+ +
divisible by 2m

m
2
+ 2m+1E
m! } | {z }
= 2C+1E Z
0<E<
1
m1
= contradiction
2mC

Math 785 HW Review 1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Math 785 HW Review 1

Uploaded by

Copyright:

Available Formats

Homework Review

m = p11 p22 perr

m = p11 p22 perr

m = p11 p22 perr

perr 1(p1 1) (pr 1)

m = p11 p22 perr

perr 1(p1 1) (pr 1)

Remark: If b0|b, then (b0)|(b).

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= 0 where gcd(a0, b0) = 1.

= 0 where gcd(a0, b0) = 1.

= 0 where gcd(a0, b0) = 1. Then

= 0 where gcd(a0, b0) = 1. Then

= 0 where gcd(a0, b0) = 1. Then

IDEA: r is the order of 10 modulo b0

= 0 where gcd(a0, b0) = 1. Then

IDEA: r is the order of 10 modulo b0

= 0 where gcd(a0, b0) = 1. Then

IDEA: r is the order of 10 modulo b0

= 0 where gcd(a0, b0) = 1. Then

IDEA: r is the order of 10 modulo b0

Finish the proof by showing that if t is such that

Finish the proof by showing that if t is such that

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= m.d1d2 . . . dk dk+1dk+2 . . . dk+r

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

= d1d2 . . . dj .dj+1 . . . dr d1d2 . . .

Cases: p = 10k + 1, p = 10k + 3,

Main Tool: What power of 2 divides n! ?

Main Tool: What power of 2 divides n! ?

Main Tool: What power of 2 divides n! ?

Main Tool: What power of 2 divides n! ?

Main Tool: What power of 2 divides n! ?

When does 2n1 divide n! ?

Main Tool: What power of 2 divides n! ?

When does 2n1 divide n! ?

Main Tool: What power of 2 divides n! ?

When does 2n1 divide n! ?

Main Tool: What power of 2 divides n! ?

When does 2n1 divide n! ?

Main Tool: What power of 2 divides n! ?

When does 2n1 divide n! ?

Main Tool: What power of 2 divides n! ?

When does 2n1 divide n! ?