Added Super Poulet Route

[r0hnx]

• The idea is to generate all the divisors of the number N and for all divisor check D divides 2^D-2.

• If this condition satisfy for all divisors then the number is super-poulet number.

[ZiyanK]

Logic hasn't been implemented correctly. Kindly fix it

[r0hnx]

Logic hasn't been implemented correctly. Kindly fix it

@ZiyanK Where did you find any logical error?

[r0hnx]

Some of the super-Poulet numbers are

n
1	341 = 11 × 31
2	1387 = 19 × 73
3	2047 = 23 × 89
4	2701 = 37 × 73
5	3277 = 29 × 113
6	4033 = 37 × 109
7	4369 = 17 × 257
8	4681 = 31 × 151
9	5461 = 43 × 127
10	7957 = 73 × 109
11	8321 = 53 × 157
12	294409 = 37 × 73 × 109

For example, 341 is a super-Poulet number: it has positive divisors {1, 11, 31, 341}

• 341 :
  

• 333 :
  

I have checked all these numbers and it passes every one of them, kindly go through the code once again to understand it or run it once.

Also refer to https://en.wikipedia.org/wiki/Super-Poulet_number