Sat May 22 10:42:30 2004 : Will Zero Knowledges proofs be covered? What about SHA-1 and El Gamal?

Sat May 22 21:25:33 2004 : Is this class graded on a curve?

Sun May 23 09:40:47 2004 : When will the syllabus be up?

Sun May 23 10:56:14 2004 :

Sun May 23 12:07:17 2004 : Will Tex files be provided or will you help us for those of us wanting to learn LaTeX?

Mon May 24 09:48:56 2004 :

Tue May 25 11:05:34 2004 : Is the textbook for this class finalized? That is the probablity that this text won't be used is about 0.000000000000000000000000000000001?

Tue May 25 11:56:18 2004 :

Tue May 25 12:48:19 2004 : hello; when I try to look at the syllabus, I get error 'file not found' http://math.berkeley.edu/~jvoight/115/2004-115-Syllabus.pdf

Tue May 25 13:30:46 2004 : The syllabus isn't up becasue John hasn't put it up! We must really be so bored and can't wait for math 115 to begin!

Fri May 28 11:57:55 2004 :

Fri May 28 12:27:59 2004 : On the syllabus for week 3, it says Fermat's Last Theorem. It should be Fermat's Little Theorem, as I don't think we could cover the entire proof of Fermat's Last Theorem in one lecture. What is the grading scale for this class? Will it be determined later, or is an A 85% an above, etc.., as some Math profs have done here? Finally, is a 50 minute midterm enough time to test us on the material? It seems to be more of a speed test than a test of our understanding.

Fri May 28 16:29:28 2004 :

Thu Jun 3 08:15:10 2004 : How did John get that Cal icon on the browser's web address on his home page?

Thu Jun 3 08:58:17 2004 :

Sat Jun 5 11:38:39 2004 : Ah, I figured out it was favicon.ico For example www.berkeley.edu/favicon.ico and I see this also on John's main page

Tue Jun 8 18:49:50 2004 : Will we possibly have time to cover section 4.5, 10.1, 10.2, and anything from chapter 12?

Wed Jun 9 11:11:57 2004 :

Sat Jun 19 09:22:24 2004 : On hw #1, section 1.1, problem 4c, do we consider the case where we are multiplying 0 with an irrational number?

Sat Jun 19 12:05:21 2004 : On hw #1, problem 1.1A (b), it says that "S cannot contain a decreasing sequence of distinct real numbers" But we don't actually have sequences, but just elements of that set that appear to just be increasing?

Sat Jun 19 17:02:57 2004 :

Sun Jun 20 09:54:59 2004 : Shouldn't homework #2 be Due July 6 because there is no school on July 5?

Sun Jun 20 10:19:02 2004 :

Thu Jun 24 14:11:27 2004 :

Sat Jun 26 11:12:38 2004 : In section 4.1, problem 16 does "final digit" mean the least significant digit?

Sun Jun 27 19:46:14 2004 :

Mon Jun 28 16:57:46 2004 : What, if anything, can we bring to the midterm?

Tue Jun 29 18:26:50 2004 :

Tue Jun 29 20:53:26 2004 : Suppose that I have the equation x^2 + 1 = 0. Then x = plus or minus i But if I apply Theorem 3.17, it says that any root of x^2 + 1 should either be an integer or an irrational. Instead, I have an imaginary number! What condition is x^2 + 1 violating such that Theorem 3.17 doesn't apply?

Wed Jun 30 09:18:02 2004 :

Wed Jun 30 21:47:57 2004 : Will hws 3 and 4 be up over this weekend?

Wed Jun 30 22:26:50 2004 :

Thu Jul 1 21:17:35 2004 : What other kind of nonlinear diophantine equation will we study?

Thu Jul 1 22:40:58 2004 :

Sat Jul 3 15:04:24 2004 : For hw #3, can we get a hint on problem #14 in section 4.3?

Sat Jul 3 15:54:02 2004 : Also, what does problem 4.3A have to do with the Chinese Remainder Theorem? It seems this problem belongs in section 4.4?

Sun Jul 4 12:26:56 2004 :

Sun Jul 4 15:24:38 2004 : Well I suppose another typo is the typo in the Typo handout. For Typo (6), you have two \lfloor. You are missing a \rfloor

Mon Jul 5 17:46:55 2004 : Another typo is probably on the math 115 web page which says HW 3 is due *June* 14

Mon Jul 5 17:58:39 2004 :

Thu Jul 8 15:01:43 2004 :

Sat Jul 10 15:33:59 2004 : Problem #3 in section 6.2 for hw #4 doesn't seem interesting at all because there really isn't any way of making use of Fermat's Little Theorem. The only way is just actually using repeated squaring to compute this which simply isn't interesting at all (unlike Carmichal numbers, which are way more interesting!)

Sat Jul 10 15:42:18 2004 :

Mon Jul 12 18:22:55 2004 : The lecture on p-adic numbers was very fun today! Are we responsible for p-adic numbers on the final exam? I didn't see any practice problems on the hw for this week.

Mon Jul 12 18:52:07 2004 :

Tue Jul 13 13:04:03 2004 :

Wed Jul 14 14:33:07 2004 : John, the review problems today....covered Hensel's Lemma, Newton's method, Chinese Remainder theorem, as well as other topics. Are we to assume these are the only topics on the midterm? Make our lives easier and say they are :)

Wed Jul 14 14:34:08 2004 : Could you explain problem 1 of the review again? I didn't quite get it...

Wed Jul 14 15:22:40 2004 :

Thu Jul 15 13:08:41 2004 : Will you be posting the midterm solutions over the weekend, or do we have to wait until Monday?

Thu Jul 15 14:28:32 2004 : #4 was hard! what is the trick here?

Thu Jul 15 15:04:56 2004 :

Thu Jul 15 16:07:14 2004 : So a C is 20?

Thu Jul 15 17:12:00 2004 :

Fri Jul 16 14:04:11 2004 : hi john, you're doing a great job as our instructor. I think you'll make a great professor. One request though, can you slow down a bit on the harder sections of this course? Thanks.

Fri Jul 16 17:26:12 2004 : On problem 41 of section 7.1, why does the book's proof make use of a theorem covered in section 7.2? Is there a way of proving the result without making use of the theorem covered in section 7.2?

Sat Jul 17 12:03:38 2004 : On problem 6 in section 7.3 are we allowed to write up a program that figures this out?

Sun Jul 18 14:40:32 2004 : Hi John...is that a brilliant piece of abstract art in the upper left hand corner, or is it an upside-down dog? = )

Sun Jul 18 19:13:58 2004 :

Mon Jul 19 12:23:41 2004 :

Tue Jul 20 17:28:11 2004 : For factoring 2^30 - 1, I understand that since 5 divides 30, then 2^5-1 = 31 divides 2^30 - 1, so after that step, then how do you go on to factoring the remaining term?

Tue Jul 20 17:51:06 2004 :

Tue Jul 20 18:13:39 2004 : I was looking at hw #1 of the Math 195 cryptography web page, and I'm not sure what the hidden message is for problem 2.1 . Any hints?

Wed Jul 21 08:39:35 2004 :

Thu Jul 22 12:04:42 2004 :

Fri Jul 23 11:28:15 2004 : Can we make use of the h function that we talked about in class and its properties on the hw? Also, can we make use of problem 32a in section 7.3 since we proved it in class?

Fri Jul 23 23:00:29 2004 :

Sun Jul 25 16:16:54 2004 :

Sun Jul 25 21:36:23 2004 : Where does John pick up the phrase "good times", or "cool beans" ? It sounds so funny.

Tue Jul 27 18:47:23 2004 :

Tue Jul 27 19:07:48 2004 : Can you post solutions to worksheet 7?

Tue Jul 27 20:08:46 2004 :

Wed Jul 28 13:18:02 2004 :

Fri Jul 30 14:55:02 2004 : Can we write a program to solve Problem 16 in Section 9.3, or is there a different approach to this problem?

Sat Jul 31 00:47:03 2004 :

Sat Jul 31 17:53:13 2004 : If we used a program to help aid us in the computation, then how would we justify that we found the smallest such odd prime? It seems that we would need to justify this to the reader, and would require the reader to have faith that our program found the smallest such odd prime.

Sun Aug 1 00:36:59 2004 :

Sun Aug 1 12:00:57 2004 : John, are you going to be a GSI for any upper div math classes in the Fall?

Sun Aug 1 21:12:40 2004 :

Sun Aug 1 21:27:59 2004 : What is your dissertation about?

Sun Aug 1 22:49:03 2004 :

Mon Aug 2 13:04:23 2004 :

Thu Aug 5 11:57:01 2004 : Thanks so much for the Harvard link for the problem in 8.4. It worked great!!!

Thu Aug 5 19:37:49 2004 : what topic were we going to cover on Monday?

Thu Aug 5 23:29:43 2004 :

Sat Aug 7 22:51:32 2004 : Hi JOhn, I have a few questions about this week's homework #7: Problem 8.1A: I've concluded that ;48 = THE. Where do I go from here? Please help. 11.1#12: Which quadratic congruences (mod2) have solutions to ax^2+bx+c=0(mod p) p doesn't divide a: What does the quadratic congruence look like? is it a polynomial? Im having trouble transitioning from integers.Please help. 11.2#4: I don't know where to begin, could you explain what it means to find the primes where 5 is a quadratic residue? I looked at theorem 11.6 where they showed which primes is 2 a quadratic residue but I don't understand that proof either.

Sat Aug 7 22:57:30 2004 :

Sun Aug 8 15:07:11 2004 : 8.1A: John I still can't figure this out. I've tried all the letters and I'm getting frustrated. Is there an algorithm or something? trial and error is killing me.

Sun Aug 8 18:58:08 2004 : Are you going to answer the question above? I need help too.

Sun Aug 8 20:49:13 2004 :

Sun Aug 8 21:52:03 2004 : I can't believe after I finally solved 8.1A you gave it up to the class. I feel that I just went through all the decrypting for nothing...by the way what does this message mean????

Sun Aug 8 21:55:02 2004 : I finally solved the 8.1 message (without the previous message)...but what does it mean?

Sun Aug 8 22:19:46 2004 : haha.

Sun Aug 8 22:46:33 2004 :

Sun Aug 8 23:17:09 2004 : Hint on the meaning of the answer to 8.1A: type it into Google.

Mon Aug 9 09:50:19 2004 : Two questions: is the second half of Wednesday's lecture going to be a review session? Are we responsible for anything covered this week on the final? Thanks.

Tue Aug 10 15:27:13 2004 : Does the final include the section on Carmichael numbers and pseudoprimes?

Tue Aug 10 15:41:33 2004 :

Tue Aug 10 17:54:25 2004 : Does the final include being able to do Pollard rho or proving why it works? What about Hensel's Lemma?

Tue Aug 10 18:40:28 2004 :

Tue Aug 10 20:05:20 2004 : what about quadratic residues/non residues? On Cryptography, how much should we know? Caesar, affline?

Tue Aug 10 20:11:44 2004 :

Tue Aug 10 20:51:51 2004 : I'm not trying to easy my way out, but could it be possible if you could tell us what to study more in-depth? Some of this stuff is hard and it'd be alot easier to know some topics more thoroughly than to know bits and pieces of all topics am I right?

Tue Aug 10 21:02:15 2004 : On problem 8 of section 13.1, how would you show that there are infinitely many such solutions?

Tue Aug 10 21:15:18 2004 :

Tue Aug 10 21:37:09 2004 : What topics are you covering in the review session?

Tue Aug 10 21:47:28 2004 : Wilson's theorem: suppose we have a congruence mod n, two numbers must have the same gcd with n right? What is the converse of wilson's theorem?

Tue Aug 10 21:49:32 2004 : Can you help me with a problem? Prove that -1 is not a square modulo the prime p if p is congruent to 3 mod 4.

Wed Aug 11 09:00:07 2004 :

Wed Aug 11 12:38:25 2004 :

Wed Aug 11 21:26:59 2004 : Is the "point at infinity" used for elliptic curves related to the "infinity" of the Riemann sphere?

Wed Aug 11 22:31:34 2004 :

Thu Aug 12 12:45:19 2004 : Will the solutions to the final be posted?

Thu Aug 12 14:22:45 2004 : What will the grading scale be?

Mon Aug 16 09:23:21 2004 : When will grades appear on bearfacts? Also when and how can we view our final exams?

Mon Aug 16 10:35:55 2004 :