Math 341

//Math 341

Facts About Primes

By |2016-10-10T11:29:30+00:00October 10th, 2016|Categories: Courses, Math 341|Tags: |

We saw a lot of different statements about primes today, so much so that you might be feeling a bit overwhelmed. For reference, here is a list of the properties we actually proved: An integer $n>1$ is composite if and only if it has a prime divisor $p\leq \sqrt{n}$. There are infinitely many primes. If $p_1,p_2,p_3,\ldots, [...]

Fibonacci Numbers and the Euclidean Algorithm

By |2017-01-01T15:39:00+00:00September 30th, 2016|Categories: Courses, Math 341|Tags: , |

As several of you noted in class Thursday, the Fibonacci numbers made a surprise appearance during an otherwise routine calculation of the greatest common divisor of two integers. Their appearance was not a coincidence. Let's take a look. The Fibonacci Numbers If you're interested in reading about Fibonacci and the Fibonacci numbers in detail, I encourage [...]

This Is A Custom Widget

This Sliding Bar can be switched on or off in theme options, and can take any widget you throw at it or even fill it with your custom HTML Code. Its perfect for grabbing the attention of your viewers. Choose between 1, 2, 3 or 4 columns, set the background color, widget divider color, activate transparency, a top border or fully disable it on desktop and mobile.

This Is A Custom Widget

This Sliding Bar can be switched on or off in theme options, and can take any widget you throw at it or even fill it with your custom HTML Code. Its perfect for grabbing the attention of your viewers. Choose between 1, 2, 3 or 4 columns, set the background color, widget divider color, activate transparency, a top border or fully disable it on desktop and mobile.