
Math General Math Forum  For general math related discussion and news 
 LinkBack  Thread Tools  Display Modes 
January 28th, 2015, 05:17 PM  #1 
Newbie Joined: Jan 2015 From: usa Posts: 2 Thanks: 0  solve the following mathematical problem either mathematically or using an algorithm
roblem Description: Being a some constant, further assume that we are in a factor ring (basically all operations modulo some sumber p). Note, that the division below is a multiplication by the modular inverse. You always have to start with x=9. Consider the following recursive formula: Code: new_x = (x²1)² / (4*x*(x²+a*x+1)) How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)? Note: You can start multiple such chains beginning at x=9, and add the resulting x values using the addition algorithm from http://en.wikipedia....ontgomery_curve (Montgomery arithmetic section). Note, that the x value, is the value you get at the end of such calculationchain, and the z value is always 1. 
January 28th, 2015, 06:16 PM  #2 
Newbie Joined: Jan 2015 From: usa Posts: 2 Thanks: 0 
The winner is the first person to post such formula in private. The formula must work in all cases, and be comutationally feasible


Tags 
algorithm, mathematical, mathematically, problem, solve 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Advanced Math: Algorithm to Solve an Optimal Set  forkconfig  Applied Math  1  February 6th, 2014 03:25 PM 
Can you help me to solve this little mathematical game  elcordobes  Applied Math  0  April 30th, 2012 03:24 AM 
any new mathematical methods to solve PDE  Math_Man88  Applied Math  1  November 8th, 2010 02:29 PM 
how to support this step mathematically  turtlejohn  Complex Analysis  0  January 20th, 2010 09:49 PM 
mathematically related essay topic  gaussrelatz  New Users  1  December 31st, 1969 04:00 PM 