Line 36: Line 36:
 
*Can we find *really bad* Erdos-Woods examples?
 
*Can we find *really bad* Erdos-Woods examples?
 
*Can you catch the Evil Wizard being REALLY EVIL?
 
*Can you catch the Evil Wizard being REALLY EVIL?
 +
* [Jamie] Does every *bad* Erdos-Woods example posses "extra" isogenies?
 +
 +
==Erdos-Woods "Algorithm"==
 +
 +
The following are ideas to keep in mind for some type of Erdos-Woods algorithm:
 +
 +
* SPOILER! The trick is to use elliptic curves. :)
 +
* When constructing Frey curves, consider the simplest of $(n,n+1),$ $(n,n+2)$ and $(n+1,n+2).$
  
  
 
----
 
----
 
[[Graduate_Studies_in_Mathematics|Back to Math Grad Student Page]]
 
[[Graduate_Studies_in_Mathematics|Back to Math Grad Student Page]]

Revision as of 07:48, 21 July 2010

The Purdue Research in Mathematics Experience (PRiME) is a program intended to support and document various research projects by students in mathematics at Purdue. It also exposes students to new resources available to them, such as Rhea, and Sage.

Participants

Anyone affiliated with Purdue willing to document project in mathematics is welcome to participate in PRiME. If you want to be added to the official list of participants below, just add yourself. The emphasis of PRiME is to expose the excitement of doing mathematics.

  • Matt Davis (Purdue 10' Alumnus)
  • James Ryan (Undergraduate Student)
  • Jamie Weigandt (Graduate Student)

Schedule

Monday, July 12, 2010

Wednesday, July 14, 2010

  • Discussed material from chapter 1 of Stein's Book.

Thursday, July 15, 2010

  • Discussed euclidean algorithm
  • Started sage tutorial

Friday, July 16, 2010

Wednesday, July 21, 2010

Research Focus Questions

  • Is there an algorithm for deciding the Erdos-Woods Problem?
  • If so, is this algorithm practical?
  • Can we find *bad* Erdos-Woods examples?
  • Can we find *really bad* Erdos-Woods examples?
  • Can you catch the Evil Wizard being REALLY EVIL?
  • [Jamie] Does every *bad* Erdos-Woods example posses "extra" isogenies?

Erdos-Woods "Algorithm"

The following are ideas to keep in mind for some type of Erdos-Woods algorithm:

  • SPOILER! The trick is to use elliptic curves. :)
  • When constructing Frey curves, consider the simplest of $(n,n+1),$ $(n,n+2)$ and $(n+1,n+2).$



Back to Math Grad Student Page

Alumni Liaison

has a message for current ECE438 students.

Sean Hu, ECE PhD 2009