Added 4 new problems, some very challenging. Solutions to come by this weekend

Author: abhatia1205

1_beginner/chapter3/solutions/temperature.py

@@ -1,4 +1,4 @@
-# Temperature
+  # Temperature
 # Write a program that converts Celsius to Fahrenheit.
 # It should ask the user for the temperature in
 # degrees Celsius and then print the temperature in degrees Fahrenheit.

1_beginner/chapter5/practice/add_all_the_way.py

@@ -6,3 +6,8 @@
 # for or while loop. Print out the sum.
 
 # write code here
+
+
+
+
+#Try using the other loop and do the same p[roblem again

1_beginner/chapter5/practice/alternating.py

@@ -0,0 +1,17 @@
+""" 
+
+Ask the user for an integer. The print the numbers from 1 to that number,
+but alternating in sign. For example, if the input was 5, what would be printed
+is 1, -1, 2, -2, 3, -3, 4, -4, 5. (Note, DO NOT include the last negative
+number).
+
+Do this with a for loop
+
+"""
+
+#Write code here.
+
+number = int(input("Enter Number Here: "))
+
+
+#Now try it with a while loop

1_beginner/chapter5/practice/even.py

@@ -1,5 +1,5 @@
 # Even
 # Print every even number greater than 10
-# and less than 101
+# and less than 101 (10 ia included)
 
 # write code here

1_beginner/chapter5/practice/fibonnaci.py

@@ -0,0 +1,20 @@
+''' CHALLENGE PROBLEM!! NOT FOR THE FAINT OF HEART!
+
+The Fibonacci numbers, discovered by Leonardo di Fibonacci,
+is a sequence of numbers that often shows up in mathematics and,
+interestingly, nature. The sequence goes as such:
+
+1,1,2,3,5,8,13,21,34,55,...
+
+where the sequence starts with 1 and 1, and then each number is the sum of the
+previous 2. For example, 8 comes after 5 because 5+3 = 8, and 55 comes after 34
+because 34+21 = 55.
+
+The challenge is to use a for loop (not recursion, if you know what that is),
+to find the 100th Fibonnaci number.
+'''
+
+#write code here
+
+
+#Can you do it with a while loop?

1_beginner/chapter5/practice/prime.py

@@ -0,0 +1,29 @@
+"""
+
+Write a program to check if a number is prime or not. A prime
+number is one that is not divisible by any number other than
+1 and itself. For example, 11 is prime because it is not divisible
+by 2,3,4,5,...10 (i.e. 11/10, for example, is not an integer).
+
+Write a for loop to check if a number is prime or not.
+
+"""
+
+#write code here
+
+numer = int(input("Enter number here: "))
+
+"""
+See if you can do the above problem without looping up until the number.
+For example, if the number you are checking is 101, don't write the code
+for i in range(101), or even for i in range(100). You may loop until 
+half of the number.
+
+NOTE: THE ABOVE IS A CHALLENGE PROBLEM, AND IS EXTRREEMMLY HARD TO DO
+OPTIMALLY. I COULDN'T DO IT OPTIMALY UNTIL I LEARNED HOW TO. If you can't
+figure out the solution, don't feel discouraged, its seriously a really
+hard problem.
+
+"""
+
+#write code here

1_beginner/chapter5/practice/series.py

@@ -0,0 +1,16 @@
+"""
+
+Here are some interesting results from mathematics that we can
+model with computer science.
+
+In class we added up 1 + 1/2 + 1/4 + 1/8 ...
+See if you can add up 1 + 1/3 + 1/9 + 1/27 + 1/81 ... in a similar fashion.
+What is the answer? What if, instead of 3, we use 5 (1 + 1/5 + 1/25 + 1/125...)
+7? Do you see a patter? (Note: make sure not to end up with an infinite loop).
+
+
+
+Also, try adding up 1 -1/3 + 1/5 - 1/7 + 1/9 - 1/11 ... 10 million times. then
+multiply this result by 4. What number is this close to?
+
+"""