Download Here

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Addition wikipedia , lookup

Mathematics of radio engineering wikipedia , lookup

Factorization of polynomials over finite fields wikipedia , lookup

Location arithmetic wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Transcript
Quite a few different problem types ~ scroll down.
Word Problems on Isomorphism
Troy Brainard
Hanna Foglesong
Problem 1:
Which one of these graphs is not isomorphic to the other two?
a)
b)
c)
Answer: c, because there is no cycle of 3 (4 degree) vertices in c.
Problem 2:
How many sub graphs of K n are isomorphic to the graph
K
1, 5
for n >= 6?
 n  1

Answer: n 
 5 
1. A boat is resting 91 meters due west of a lighthouse. A buoy lies in the water 60
meters north of the lighthouse.
A. How far is the buoy from the boat?
B. Prove these three distances make up a Pythagorean Triple
C. Find the values for u and v.
2.
ans: legs of the triangle are 24 and 32 (3, 4, 5, give 24, 32, 40).
Points on the unit circle are (3/5, 4/5), (-3/5, 4/5), (3/5, -4/5), (-3/5, -4/5) and
(4/5, 3/5), (-4/5, 3/5), (4/5, -3/5), (-4/5, -3/5).
True - false / fill in the blank questions
All questions are true or false unless they contain a blank.
1.
2.
3.
4.
5.
6.
7.
8.
a | 1, a  
a | 0, a  
a | na where a, n  
2 | x, x  
1|y where y is an irrational number
gcd(p,c) = _____ or ______ where p is prime and c is composite
There exists a prime number that is larger than all of the other prime
numbers.
gcd( a, b)  lcm (a, b)
 ____ where a, b  
b
9. lcm(p,c) = ____ where p is prime and c is composite. p is also not a
factor of c.
10.gcd(a,b) = a => a|b where ab  
11. a, b  Z  , If a, b are relatively prime, then lcm(a,b)  ________.
12. a, b  Z  , _______  lcm(a,b) * gcd (a,b)
13. ___ gcd( a, b)  gcd( na, nb)
14. If a,b,c  Z  , the diophantin e equation ax  by  c has an integer solution x  x0 ,y  y0 iff gcd (a,b) divides___
15. For a,b  Z , a positive integer c is said to be a common divisor of a and b if ______ and _______.
True or False :
16. Let n  Z  . The gcd (n,n  2 )  1 or 2.
17. If a, b  Z  and p is prime, then p|ab  p|a or p|b .
18. gcd ( 9999,9900 )  99
19. lcm( 9999,9900 )  98990100
20. gcd ( 12741,91101 )  3
Answers
1. F
2. T
3. T
4. F
5. F
6. p or 1
7. F
8. a
9. (p)(c)
10. T
11. Ab
12. Ab
13. N
14. C
15. c|a and c|b
16. T
17. T
18. T
19. F
20. T
Related Problems on Divisors
Ryan Gerry
Eric Price
Brian Sullivan
1a) How many positive divisors are there for
n = 25 37 114 132 ?
1b) "n" from part a is divisible by 23 33 11 how many times?
2) Is 600! divisible by 7^99?
3) Find the magic cube where each row multiplied across, diagonally, or through a
column is 216. First you will need to find the prime factorization for 216.
Here is an example of a magic cube where summing up the numbers on a row, a column,
or a diagonal yields 15.
Rows
6
7
2
6 + 7 + 2 = 15
1
5
9
1 + 5 + 9 = 15
8
3
4
8 + 3 + 4 = 15
Columns 6 + 1 + 8 = 15 7 + 5 + 3 =15 2 + 9 + 4 = 15
Diagonals 6 + 5 + 4 =15 8 + 5 + 2 =15
Solutions
1a) (6)(8)(5)(3) = 720 divisors
1b) (3)(5)(4)(3) = 180
2) We need 99 7's in the expansion of 600! = 600*599*598*597*596*...*1. In
other words, 7,14,21,28 are all part of the expansion of 600!. 7 = 7*1, 14=7*2,
21=7*3 28=7*4. Therefore, if we divide 600 by 7, we can get how many 7's to the
first power we have in the expansion. 600/7 = 85.714. So, we have 85 7's to the
first power. However, some numbers like 49 are 7*7 which include 2 7's, one of
which we have already counted. Now we must find how many 7's to the 2nd power
we have and how many 7's to the 3rd power we have and we can add those to our
85 that we already have. 600/49 =12.244898. 600/343=1.749271. So, we have
85+12+1=98 7's. We can factor 98 7's out of 600!. We needed 99 7's, therefore
7^99 does not divide 600!.
3) The prime factorization of 216 is 23 * 33.
Take the largest number 22 * 32 = 36 and place it in the middle of the third column.
Make the middle row start with 1 your smallest value and fill in the rest of the table
taking into account that you should get 216 by row, by column, and diagonally.
Final result:
2
Columns
2
2 *3
3
2
2
1
2*3
2 * 32
2 * 32
22
3
3
3
3
3
3
2 * 3 = 216 2 * 3 = 216 2 * 33 = 216
Diagonals 23 * 33 = 216 23 * 33 = 216
Rows
2 * 3 = 216
23 * 33 = 216
23 * 33 = 216
3
3