Let the user enter a starting value and the desired probability. Make the program search upward from the starting value until it finds a number that is probably prime to the desired level of probability. Use the program to find the smallest prime larger than 1 trillion.
48. Find primes
by Rod Stephens, Clayton Hunt, John Callaway, Ovais Mehboob Ahmed Khan
Improving your C# Skills
- Title Page
- Copyright and Credits
- About Packt
- Contributors
- Preface
- What's New in .NET Core 2 and C# 7?
- Understanding .NET Core Internals and Measuring Performance
- Multithreading and Asynchronous Programming in .NET Core
- Securing and Implementing Resilience in .NET Core Applications
- Introduction to resilient applications
- Storing sensitive information using Application Secrets
- Protecting ASP.NET Core APIs
- SSL (Secure Socket Layer)
- Preventing CSRF (Cross-Site Request Forgery) attacks
- Reinforcing security headers
- Adding the HTTP strict transport security header
- Authentication and authorization
- Authentication
- Authorization
- Implementing authentication and authorization using the ASP.NET Core Identity framework
- Summary
- Why TDD is Important
- First, a little background
- So, what is TDD?
- An approach to TDD 
- Arguments against TDD
- Arguments in favor of TDD
- Different types of test
- Why does it matter?
- Summary
- Setting Up the .NET Test Environment
- Setting Up a JavaScript Environment
- What to Know Before Getting Started
- Tabula Rasa – Approaching an Application with TDD in Mind
- Testing JavaScript Applications
- Exploring Integrations
- Changes in Requirements
- The Legacy Problem
- Unraveling a Mess
- Geometry
- Problems
- 1. Monte Carlo π
- 2. Newton's π
- 3. Bisection root-finding
- 4. Newton's method
- 5. Gaussian elimination
- 6. Monte Carlo integration
- 7. Rectangle rule integration
- 8. Trapezoid rule integration
- 9. Arrowheads
- 10. Line-line intersection
- 11. Point-line distance
- 12. Point-segment distance
- 13. Segment-segment distance
- 14. Circle selection
- 15. Line-circle intersection
- 16. Circle-circle intersection
- 17. Circle-line tangents
- 18. Polygon area
- 19. Point in a polygon
- 20. Convexity testing
- 21. Stars
- Solutions
- 1. Monte Carlo π
- 2. Newton's π
- 3. Bisection root-finding
- 4. Newton's method
- 5. Gaussian elimination
- 6. Monte Carlo integration
- 7. Rectangle rule integration
- 8. Trapezoid rule integration
- 9. Arrowheads
- 10. Line-line intersection
- 11. Point-line distance
- 12. Point-segment distance
- 13. Segment-segment distance
- 14. Circle selection
- 15. Line-circle intersection
- 16. Circle-circle intersection
- 17. Circle-line tangents
- 18. Polygon area
- 19. Point in a polygon
- 20. Convexity testing
- 21. Stars
- Summary
- Problems
- Randomization
- Files and Directories
- Advanced C# and .NET Features
- Cryptography
- Other Books You May Enjoy
48. Find primes
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.