How to resolve the algorithm Wagstaff primes step by step in the Phix programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Wagstaff primes step by step in the Phix programming language
Table of Contents
Problem Statement
A Wagstaff prime is a prime number of the form (2^p + 1)/3 where the exponent p is an odd prime. (2^5 + 1)/3 = 11 is a Wagstaff prime because both 5 and 11 are primes. Find and show here the first 10 Wagstaff primes and their corresponding exponents p. Find and show here the exponents p corresponding to the next 14 Wagstaff primes (not the primes themselves) and any more that you have the patience for. When testing for primality, you may use a method which determines that a large number is probably prime with reasonable certainty. It can be shown (see talk page) that (2^p + 1)/3 is always integral if p is odd. So there's no need to check for that prior to checking for primality.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Wagstaff primes step by step in the Phix programming language
Source code in the phix programming language
You may also check:How to resolve the algorithm Descending primes step by step in the Mathematica/Wolfram Language programming language
You may also check:How to resolve the algorithm 100 doors step by step in the SparForte programming language
You may also check:How to resolve the algorithm Comments step by step in the zkl programming language
You may also check:How to resolve the algorithm Date format step by step in the Groovy programming language
You may also check:How to resolve the algorithm Abundant odd numbers step by step in the q programming language