Math 81 Activity # 5
... 1) Use factor trees to find the unique prime factorization of each number (as seen above) 2) Then use exponential notation to represent the prime factorization. The prime factorization of 24 is 2 2 2 3 23 31 The prime factorization of 30 is 2 3 5 21 31 51 Observe we place the ba ...
... 1) Use factor trees to find the unique prime factorization of each number (as seen above) 2) Then use exponential notation to represent the prime factorization. The prime factorization of 24 is 2 2 2 3 23 31 The prime factorization of 30 is 2 3 5 21 31 51 Observe we place the ba ...
Solution 21.
... We look in the column for x8 , and find 9 and 3 four times each, and don’t find 7. So 9 has four 8th roots, 3 has four 8th roots, and 7 has zero 8th roots. Similarly, in the column for x9 , 8 and 5 appear three times each, while 6 does not appear. So 8 has three 9th roots, 6 has zero 9th roots and 5 ...
... We look in the column for x8 , and find 9 and 3 four times each, and don’t find 7. So 9 has four 8th roots, 3 has four 8th roots, and 7 has zero 8th roots. Similarly, in the column for x9 , 8 and 5 appear three times each, while 6 does not appear. So 8 has three 9th roots, 6 has zero 9th roots and 5 ...
Everyday FT
... if there were no errors, sum would be 0 modulus 11 Second calculation, assuming single error, will then identify position i of error since if sum s is non-zero, have mi = s, so determine that position i is too large by m (use modulus properties to get an even multiple of i) Thus, knowing magnitude & ...
... if there were no errors, sum would be 0 modulus 11 Second calculation, assuming single error, will then identify position i of error since if sum s is non-zero, have mi = s, so determine that position i is too large by m (use modulus properties to get an even multiple of i) Thus, knowing magnitude & ...
Math 116 Number Theory Homework #1 Spring 2007 Solutions with
... Brute Force Approach: Using a computer you could simply generate a long list of the triangular numbers and then take the square root of each in order to see which triangulars are squares. However, since the fifth square-triangular number is the 1681th triangular number, this approach could take a lo ...
... Brute Force Approach: Using a computer you could simply generate a long list of the triangular numbers and then take the square root of each in order to see which triangulars are squares. However, since the fifth square-triangular number is the 1681th triangular number, this approach could take a lo ...
