Network Science

Leave a comment

By Myla James, Shania Johnson, Maya Mukerjee, and Savitha Saminathan.

 

Graph Theory

Here’s some definitions to help you understand our assignment:

Nodes – vertex/point.
Edges – lines connecting vertices.
Adjacent – two nodes (vertices) are adjacent if they share an edge (line).
Degree – number of edges adjacent to a particular node.

We started this problem set with learning about the difference between connected and disconnected graphs.

Connected Graph – able to travel from one node to any other through its edges.
Disconnected graph – more complex; it has components.
Components – parts of the graphs that are connected.

Continue reading →

Knot Theory @ WPI

Leave a comment

by Knot Nerds

What is knot theory?

Have you ever tied your shoes before? I mean, I hope you have! So, what in the world does tying your shoes have to do with math? Here comes knot theory! Knot theory is a sub-topic of topology that studies mathematical knots, links, and their permutations. Knots can be represented by polynomials and can thus be compared to one another.

Continue reading →

The Art of Cryptography

Leave a comment

By: Nia Beverly, Makayla McDaniel, Yuanyuan Matherly, and Tyler Deegan

Introduction

Cryptography is defined as the art of writing and solving codes. Upon first thought, many people picture codes as an antiquated war time communication technique. However, the field of cryptography is alive and well,  and it has become pervasive in our everyday lives. The world is becoming more and more connected through technology, and with this, there is a greater need to protect information. Encryption is probably the most widely used application of cryptography, and it is used to protect information by making it so only one person with a key can understand what is transmitted. In the following paragraphs we will walk through the steps to mathematically understanding one widely used type of encryption.

Continue reading →

Network Science

Leave a comment

by Kayla Aguilar, Maris James, and Aynsley S.

Data is all around us, but it has to be studied in some way, right? How else are we supposed to know what it’s about? That’s what graph theory and network science are for! To organize and connect data mathematicians use networks and graphs as well as scientific computing (like coding).

Network science is an application-based study of graphs. To understand network science, we first have to understand the graphs:

Graph Theory

Graphs represent data through nodes, which are the separate points of a graph, and edges, which connect the nodes. There are two types of graphs: directed and undirected graphs. Directed graphs rely on the order of the vertices to be the same, while undirected graphs don’t rely on the order of the nodes.

Continue reading →

Intro to Relativity

Leave a comment

By: Miranda Copenhaver, Chloe Nash, Wanda Wilkins, Lauren Behringer, and Jazmin Santillan C.

 

Throughout this week, we have worked through multiple problems dealing with both classical mechanics and special relativity. We found the main difference between classical mechanics and special relativity to be the assumptions made about time as a constant. This is what we mean:

  • In classical mechanics it is assumed that time is a constant that is observed the same for all viewers.
  • In special relativity time cannot be taken as a constant. Because the speed of light is the same for all observers, time-dilation occurs.

So, if you are getting a little lost it’s completely normal. We have a couple of examples of both classical mechanics and special relativity below:

Continue reading →

Network Science

1 Comment

By Cameron Farrar, Elizabeth Gross, Shiropa Noor, and Rebecca Rozansky

Girls Talk Math was an eyeopening experience to a brand new world of mathematics. Over the past two weeks, we have been introduced to multiple topics and related professions. We learned about: quantum mechanics, surface classification, knot theory, computing & dynamics, elliptic curve cryptography, RSA encryption, special relativity and the most interesting of them all- NETWORK SCIENCE!

During our time at Girls Talk Math, we learned about the wonders of network science and graph theory. The difficult part of this otherwise enjoyable journey? Mathematica. Mathematica is a software created to make you suffer, especially if you already know computer science (AHEM BECKY). Basically, we created graphs, did calculations and got confused on Mathematica. Typing out all the commands took ages. We’ll show you some examples as we go through the different concepts we explored. Don’t worry- once you spend some time on Mathematica, you’ll get used to it.

Continue reading →

Mathematical Modeling (Fluid Dynamics)

1 Comment

By: Annie Huang, Heesue Kim, Sophie Gilliam, and Sylvia Towey

Hi guys!

Welcome to the Girls Talk Math blog today! This blog is to show you guys what we have learned and accomplished with fluid dynamics. At first, we (Annie, Heesue, Sophie, Sylvia) thought this was a very difficult topic but after some explanation and experiment, we learned how easy it is to work with the different topics thanks to the Girls Talk Math Camp held on the UNC Chapel Hill campus. Today we will be giving you a brief intro to mathematical modeling, Bernoulli’s principle, Dimensional Analysis, and Projectile motion.

Continue reading →

RSA Encryption Cryptography

Leave a comment

By Divya Aikat, Helena Harrison, Annie Qin, and Quinn Shanahan

The definition of cryptography is the art of writing and solving code. However, over the last two weeks, we learned so much more than just this textbook explanation. While working together within our team, we explored many different aspects behind cryptography. By building off our individual strengths, we prepared ourselves for higher level mathematics. The following is a synopsis of the progress we’ve made over the past two weeks.

Continue reading →

RSA Cryptography @ WPI

Leave a comment

By: Jourdan Moore, Emma Holzbach, Nicole Godwin, Naa Aryee, and Athalya Wakonyo

Have you ever made a secret language or code with your friend so that only you two would know what’s being said? You’re in luck! With the help of RSA Encryption Cryptography at Girls Talk Math we’ve learned about the world of mathematics, more specifically RSA, as well as  Modular Arithmetic, Greatest Common Divisor and related theorems.  

RSA is one of the first public-key cryptosystems created by Ron Rivest, Adi Shamir, and Leonard Adleman in 1977, and is now the most widely used cryptography algorithm in the world.

Continue reading →

RSA Encryption Cryptography

Leave a comment

by Lily Taylor, Zoe Tobien, Tehya Weaver, and Tayloir Wiley.

RSA Encryption Cryptography

What is RSA Encryption Cryptography?

RSA was one of the first public-key* cryptosystems and it is widely used for secure data transmission. It was first created by Ron Rivest, Adi Shamir, and Leona Adleman.

*Public key is used to establish a secret key, and the public key is sent in public. We then use the private key method to encrypt and decrypt large amounts of data, but no one knows the private key.

  • To code: U^s=x X(mod N)=Y
  • To decode Y^t=O O(mod N)=U

In computing, the modulo operation finds the remainder after division of one number by another. Given two positive numbers, a and n, a modulo n (in other words a mod n) is the remainder of the a division of a by n, where a is the dividend and n is the divisor.

Continue reading →