Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
Date tag: February 8 2010 8:44:52
Click here to add notes.
Date tag: February 8 2010 8:42:10
Click here to add notes.
Date tag: February 8 2010 8:42:1
Big O notation and Taylor polynomials.
Date tag: February 8 2010 8:33:32
Big O notation
Date tag: February 8 2010 8:21:6
Click here to add notes.
Date tag: February 8 2010 8:20:53
Click here to add notes.
Date tag: February 8 2010 8:17:50
Click here to add notes.
Date tag: February 8 2010 8:17:39
Click here to add notes.
Date tag: February 8 2010 8:12:29
Click here to add notes.
Date tag: February 8 2010 8:12:23
calculate euler phi function
Date tag: February 8 2010 8:6:15
Click here to add notes.
Date tag: February 8 2010 8:2:35
Click here to add notes.
Date tag: February 8 2010 7:57:9
Click here to add notes.
Date tag: February 8 2010 7:53:56
This is the same as FLT when m is prime.
Date tag: February 8 2010 7:47:22
Euler Fermat theorem
Date tag: February 8 2010 7:47:13
Click here to add notes.
Date tag: February 8 2010 7:43:5
phi of m is the number of integers between 1 and m that are coprime to m. phi of 1 is 1.
Date tag: February 8 2010 7:42:59
Euler phi function. We will get an analogue of FLT for non prime moduli.
Date tag: February 8 2010 6:23:14
Click here to add notes.
Date tag: February 8 2010 6:21:44
in signed arithmetic there is overflow if and only if adding two number of the same sign gives a sum of the other sign.
Date tag: February 8 2010 6:18:44
Binary subtractor.
Date tag: February 8 2010 6:18:13
Click here to add notes.
Date tag: February 8 2010 6:12:50
4 bit carry lookahead adder
Date tag: February 8 2010 6:8:51
Click here to add notes.
Date tag: February 8 2010 6:6:3
Click here to add notes.
Date tag: February 8 2010 6:3:1
Carry generate, and carry propogate.
Date tag: February 8 2010 6:2:44
In an n bit ripple carry adder, carry bits must ripple through 2n levels of logic.
Date tag: February 8 2010 5:54:28
4 bit ripple carry adder
Date tag: February 8 2010 5:53:57
Click here to add notes.
Date tag: February 8 2010 5:50:3
Click here to add notes.
Date tag: February 8 2010 5:46:57
Click here to add notes.
Date tag: February 8 2010 5:45:5
Click here to add notes.
Date tag: February 8 2010 5:40:4
Click here to add notes.
Date tag: February 8 2010 5:39:57
Binary adder subtractor.
Date tag: February 5 2010 9:21:16
Click here to add notes.
Date tag: February 5 2010 9:19:17
Click here to add notes.
Date tag: February 5 2010 9:15:40
Click here to add notes.
Date tag: February 5 2010 9:13:26
Click here to add notes.
Date tag: February 5 2010 9:9:54
Click here to add notes.
Date tag: February 5 2010 9:7:1
A key idea of this notation is that multiplicative constants do NOT affect the general behavior of a function so they should be ignored.
Date tag: February 5 2010 9:2:47
Click here to add notes.
Date tag: February 5 2010 9:2:37
Click here to add notes.
Date tag: February 5 2010 8:57:56
Click here to add notes.
Date tag: February 5 2010 8:57:40
Click here to add notes.
Date tag: February 5 2010 8:46:17
Click here to add notes.
Date tag: February 5 2010 8:46:2
Given two functions f and g, f is on the order of g as x approaches x0 if there is a positive constant A such that f is less than Ag on some interval around x0.
Date tag: February 5 2010 8:40:50
Order symbols: Our goal is to develop a notation that emphasizes the behavior of a function and ignores the details.
Date tag: February 5 2010 8:40:44
Click here to add notes.
Date tag: February 5 2010 8:20:18
Click here to add notes.
Date tag: February 5 2010 8:17:25
Click here to add notes.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114