Given two integers L and R, the task is to find the number of prime numbers in the range [L, R] that can be represented by the sum of two squares of two numbers.
Input: L = 1, R = 5
Only prime number that can be expressed as sum of two perfect squares in the given range is 5 (22 + 12)
Input: L = 7, R = 42
The prime numbers in the given range that can be expressed as sum of two perfect squares are:
13 = 22 + 32
17 = 12 + 42
29 = 52 + 22
37 = 12 + 62
41 = 52 + 42
(p – 1) % 4 == 0
Follow the steps below to solve the problem:
- Traverse the range [L, R].
- For every number, check if it is a prime number of not.
- If found to be so, check if the prime number is of the form 4K + 1. If sp, increase count.
- After traversing the complete range, print count.
Below is the implementation of the above approach:
Time Complexity: O(N3/2)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Count primes that can be expressed as sum of two consecutive primes and 1
- Count of primes below N which can be expressed as the sum of two primes
- Check if an integer can be expressed as a sum of two semi-primes
- Check if a number can be expressed as sum of two Perfect powers
- Nth Term of a Fibonacci Series of Primes formed by concatenating pairs of Primes in a given range
- Check if a given number can be expressed as pair-sum of sum of first X natural numbers
- Count elements in an Array that can be represented as difference of two perfect squares
- Sum of all Perfect Squares lying in the range [L, R] for Q queries
- Print all perfect squares from the given range
- Numbers within a range that can be expressed as power of two numbers
- Count prime numbers that can be expressed as sum of consecutive prime numbers
- Length of largest sub-array having primes strictly greater than non-primes
- Count of perfect squares of given length
- Sum of distances between the two nearest perfect squares to all the nodes of the given linked list
- Check if a number can be expressed as a sum of consecutive numbers
- Find ways an Integer can be expressed as sum of n-th power of unique natural numbers
- Check if a prime number can be expressed as sum of two Prime Numbers
- Check if a number can be expressed as sum two abundant numbers
- Elements of Array which can be expressed as power of some integer to given exponent K
- Count numbers which can be represented as sum of same parity primes
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.