private static long GenerateE(long p, long q) { //calculate Ф(p,q) long phi = (p - 1) * (q - 1); // start at p-2 long candidateE = p - 2; while (MathsProcessor.EuclidAlg(candidateE, phi) != 1 && MathsProcessor.PrimeCheck(candidateE) != 1) { --candidateE; } return(candidateE); }
private void PrimeCheckNums() { List <long> numsList = GetNumsFromTbox(); using (StreamWriter sw = new StreamWriter(@"Q1.txt")) // modify file paths later { sw.WriteLine("Q1.\n"); foreach (var num in numsList) { if (MathsProcessor.PrimeCheck(num) == 1) { sw.WriteLine("The number {0} is prime", num); } else { sw.WriteLine("The number {0} is NOT prime", num); } } } }
private void q1CheckPrimeBtn_Click(object sender, EventArgs e) { try { long inputNum = long.Parse(q1NumEntryTbx.Text); if (MathsProcessor.PrimeCheck(inputNum) == 1) { q1ResponseLabel.Text = "The number " + inputNum + " is prime"; } else { q1ResponseLabel.Text = "The number " + inputNum + " is NOT prime"; } } catch (FormatException formatExcptn) { MessageBox.Show("Wrong number format. Please enter a correct number."); } catch (OverflowException oe) { MessageBox.Show("Entered number(s) is too big."); } }