By DePaul Dimadis
Choose your prefered Language: greek_flag uk_flag

A Proth number is an integer and positive number 𝑁 that can be expressed in the form:
𝑁 = 𝑘 ∙ 2 𝑛 + 1
where
𝑘 is an odd integer
𝑛 a positive integer and 2𝑛> 𝑘
Write a program in a C language it will find and display in ascending order all the numbers
Proth less than 1000. In the end, their number should also be displayed. MUST NOT
THE CLASSIFICATION PROCEDURE IS USED !!!
EXAMPLE: The top ten Proth numbers are:
3, 5, 9, 13, 17, 25, 33, 41, 49, 57
COMMENTS:
The values ​​are derived for different combinations of 𝑘, 𝑛. B.C.
For 𝑘 = 1 and 𝑛 = 1, 2, 3, 4, 5 the inequality 2𝑛> ισχύει applies and the values
𝑁 = 3, 5, 9, 17, 33
Similarly for 𝑘 = 3 and 𝑛 = 2, 3, 4 the inequality 2𝑛> ισχύει applies and the values
𝑁 = 13, 25, 49
The value N = 41 is obtained for 𝑘 = 5, 𝑛 = 3