QUADRATIC PRIMES This question is adopted from Project Euler Question 27. (https://projecteuler.net/problem=27) The quadratic formula n^2 + n + 41 will produce 40 primes for consecutive integer values 0 <= n <= 39. However, when n = 40, this formula will not generate a prime number. Another interesting quadratic formula n^2 – 79n + 1601 produces 80 prime numbers for consecutive values 0 <= n <= 79. The Question: find a and b such that when -999 <= a <= 999 and -1000 <= b <= 1000, the quadratic form ?^2 + ? × ? + ? produces the maximum number of primes for consecutive values of n, starting with n = 0. Requirement: MUST BE WRITTEN IN C++ - Print the 40 primes generated by formula n 2 + n + 41 - Print the 80 primes generated by formula n 2 – 79n + 1601 - Write a function that takes in an integer and returns whether the given number is prime or not. - Output the value of a, b and how many consecutive values of n (count the starting zero!) can be generated. - Submit your .cpp

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

QUADRATIC PRIMES

This question is adopted from Project Euler Question 27. (https://projecteuler.net/problem=27)

The quadratic formula n^2 + n + 41 will produce 40 primes for consecutive integer values 0 <= n <= 39. However, when n = 40, this formula will not generate a prime number.

Another interesting quadratic formula n^2 – 79n + 1601 produces 80 prime numbers for consecutive values 0 <= n <= 79.

The Question: find a and b such that when -999 <= a <= 999 and -1000 <= b <= 1000, the quadratic form ?^2 + ? × ? + ? produces the maximum number of primes for consecutive values of n, starting with n = 0.

Requirement:

MUST BE WRITTEN IN C++

- Print the 40 primes generated by formula n 2 + n + 41

- Print the 80 primes generated by formula n 2 – 79n + 1601

- Write a function that takes in an integer and returns whether the given number is prime or not.

- Output the value of a, b and how many consecutive values of n (count the starting zero!) can be generated.

- Submit your .cpp

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Recurrence Relation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education