This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 259875847593084226429749873768285488938286414917752182334245029630812197555292\ 871569833007828194010447912516793709961848657054478696225678109392303 > evalf(log(n)/log(10)); 299.5720374 This n is a random 300 digit integer. On the next line press enter to find a 300 digit prime. How many trials did it take? > p:=findprime(); > > > > EXERCISE (5 points) Edit the function v (above) to return an random 600 digit integer. Reenter the findprime function to find a random 600 digit prime (assuming that MAPLE's isprim e function works). How many trials did it take? > p:=findprime();...
View Full Document
This note was uploaded on 06/04/2011 for the course MAS 4202 taught by Professor Boyland during the Spring '10 term at University of Florida.
- Spring '10