(New page: Category:math =PRiME 2010= =Participants= Anyone affiliated with Purdue willing to document project in mathematics is welcome to participate in PRiME. If you want to be ad...)
 
 
Line 1: Line 1:
 
[[Category:math]]
 
[[Category:math]]
 +
[[Category:research]]
 +
[[Category:prime]]
  
 
=[[Prime|PRiME]] 2010=
 
=[[Prime|PRiME]] 2010=

Latest revision as of 05:09, 3 July 2012


PRiME 2010

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).$

Acknowledgements

The computers used by the students participating in PRiME-Summer 2010 were acquired through the generous support of Intel.


Back to Math Grad Student Page

Back to PRiME page

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood