In recent years, our university in its quest for qualification and democratization of its services has initiated a vast program of innovation.

Indeed, conventional education having demonstrated its limits, particularly in terms of learners’ aptitude and skill, the teaching staff of the University have reoriented the programs by integrating the realities of the job market. Thus, the UMG currently operates with equipped laboratories, amphitheatres, rooms equipped for TDs. We are also one of the rare universities to initiate research programs on thorny questions concerning our country.

It is in this context that our researcher, Mr. Guillaume Hawing of the Center for Research, Delivery and Initiatives (CERPI) of Mahatma Gandhi University, succeeded in implementing a mathematical algorithm, which is a problem of the millennia and which secures various strategic data.

After a primality test validated by peers from Guinea, Tunisia, Morocco and France, this new find by our researcher who comes to end an old research of more than 1000 years, is of great significance. scientist in encryption and decryption, in securing data on the internet, in securing secret information, in securing bank cards and in the fight against cybercrime and piracy.

Today’s world is a global village where everything can be done and undone online. Mahatma Gandhi University, convinced that scientific research is the cornerstone of all development, requests the support of the department in charge of scientific research, to give visibility to this discovery for the happiness of science in Africa in general and Guinea in particular.

Here is a point on our researcher who retraces the stages of his discovery

hawing2

Riddle of over 1000 years solved by a Guinean researcher from Mahatma Gandhi University

I’m Guillaume Hawing, Lecturer and researcher at the Center for Research, Delivery and Initiatives at Mahatma Gandhi University. I have been researching Number Theory since 2003, I even published in 2014 a deterministic primality test. A primality test that I shared with the peers of the Guinean Mathematical Society, AIMS-Senegal, Tunisia, Morocco and France. This primality test even earned me the title of Keynote Speaker in Morocco during the 5th International Workshop on Code, Crytography and Communication Systems (IWCCCS’2014).

But, I was aware that this primality test was not a big challenge, since there are several other primality tests already discovered by other scholars since the screen of Eratosthenes. I was convinced that the big challenge, the big success was: the distribution of prime numbers, the scheme that organizes the distribution of prime numbers. To the question of knowing: What are the laws which govern the distribution of prime numbers, what is their mode of operation? Do they come at random or according to a well-established order, do they have a logical, periodic, random distribution? The answer to these questions remains an enigma and a mystery today. My model of scientist being Einstein and as Einstein defended the philosophy “It is not because things are difficult that we do not dare them, it is because we do not dare them that they are difficult”. Before therefore approaching this ancestral puzzle subject, I imposed myself the following principle: If all those who preceded me broke their teeth, then I will also break my teeth by seeing things under the same angle than them. In science: “We don’t have to follow in the footsteps of the elders”. So I said to myself, that it is absolutely necessary to refuse to be contaminated by the way of seeing others.

In my new reading of the thing, I understood that all those who failed, failed, because they wanted to be in a house without opening the door. In my research, I understood that except 2 and 5, all prime numbers are ended by: 1, 3, 7 and 9. Still in the same vein, I understood that it takes 5 algorithms : 4 algorithms to organize each of the 4 cases and an algorithm to sort in ascending order. On Thursday 03-02-2016, when I saw that the blow was really successful, I shouted in my living room saying I found, God is great! I found, God is great! My children came to join me in the living room and started shouting with me “Dad found!” “,” Daddy found it! “, Although they didn’t know what it was, what did I find? I explained to my dear wife by talking to her about the principle of 1, 3, 7 and 9 which was hidden behind the organization of prime numbers. The next day, I did the same thing with the founder of the university Mahatma Gandhi, the university where I do my research and where I teach courses in algebra and statistics. On Tuesday 08-02-2016, I explained the same principle 1, 3, 7 and 9 to my students. On Friday 19-02-2016, the founder of Gandhi, the computer programmer Mr. Fodé Idrissa Soumaré and I had gone to see the Minister of Higher Education, Yéro Baldé, with whom we had exchanged and who told us that his support and the support of the department for the project will not be lacking. Because, he said, “Our ambition is to make Guinea the dairy cow for scientific research in the sub-region”

This meeting with the Minister comforted and cheered me up more. I understood that everything had to be done so that the project “The new Einstein must be African”, be real, and that this African be from Guinea Conakry.

Yes, today we hope we are on the right track. Because, knowing the problem linked to the distribution of prime numbers: where the brightest scientific minds have broken their teeth; where others have even killed themselves for failing to unravel the secret of their distribution, where:

Gauss, Prince of Mathematics, said: “There is no way to predict the order of appearance of prime numbers”
Paul Erdos said “We will have to wait at least a million years before we understand the prime numbers”,
Godfrey H. Hardy, saw number theory, that of the former in particular, “the most difficult of all branches of mathematics”
David Hilbert said: “When I wake up after 1000 years of sleep, the first question I would ask is whether the Riemann hypothesis is proven.”
Indeed, Riemann’s hypothesis questions the proportion of the number of prime numbers smaller than a given size. This hypothesis is part of the 7 problems of the millennium of Mathematical Clay whose resolution is priced for 1 million dollars. With this algorithm, I can define with a certain probability of value 1, with a mathematical certainty the number of prime numbers less than a given size. So my algorithm supports the famous hypothesis of the German Bernard Riemann formulated since 1859.

By way of illustration: There are 900 prime numbers less than 7000 which are:

2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 521 523 523 543 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049 1051 1061 1063 1069 1087 1091 1093 1097 1103 1109 1117 1123 1129 1151 1153 1163 1171 1181 1187 1193 1201 1213 1217 1217 1229 1231 1237 1249 1259 1277 1279 1283 1289 1291 1297 1301 1303 1307 1319 1321 1327 1361 1367 1373 1381 1399 1409 1423 1427 1429 1433 1439 1447 1451 1453 1459 1471 1481 1483 1487 1489 1493 1499 15 11 1523 1531 1543 1549 1553 1559 1567 1571 1579 1583 1597 1601 1607 1609 1613 1619 1621 1627 1637 1657 1663 1667 1669 1693 1697 1699 1709 1721 1723 1733 1741 1747 1753 1759 1777 1783 1787 1789 1801 1811 1823 1831 1847 1861 1867 1871 1873 1877 1889 1901 1907 1913 1931 1933 1949 1951 1973 1979 1987 1993 1997 1999 2003 2011 2017 2027 2029 2039 2053 2063 2069 2081 2083 2087 2089 2099 2111 2113 2129 2131 2137 2141 2143 2153 2161 2179 2203 2207 2213 2221 2237 2239 2243 2251 2267 2269 2273 2281 2287 2293 2297 2309 2311 2333 2339 2341 2347 2351 2357 2371 2377 2381 2383 2389 2393 2399 2411 2417 2423 2437 2441 2447 2459 2467 2473 2477 2503 2521 2531 2539 2543 2549 2551 2557 2579 2591 2593 2609 2617 2621 2633 2647 2657 2659 2663 2671 2671 2671 2671 2671 2,687 2,689 2,693 2,699 2,707 2,711 2,713 2,719 2,729 2,731 2,741 2,749 2,753 2,767 2,777 2,789 2,791 2,797 2,801 2,803 2,819 2,833 2,837 2,843 2,851 2,857 2,861 2,879 2,887 2,897 2,903 2,909 2,917 2,927 2,939 2,953 2,957 2,963 2,969 2,971 2,999 3,001 3,011 3,019 3,049 3,061 3,049 3,041 3,049 3,041 30 79 3083 3089 3109 3119 3121 3137 3163 3167 3169 3181 3187 3191 3203 3209 3217 3221 3229 3251 3253 3257 3259 3271 3299 3301 3307 3313 3319 3323 3329 3331 3343 3347 3359 3361 3371 3373 3389 3391 3407 3413 3433 3449 3457 3461 3463 3467 3469 3469 3491 3511 3517 3527 3529 3533 3539 3541 3547 3557 3559 3571 3581 3583 3593 3607 3613 3617 3623 3631 3637 3643 3659 3671 3673 3677 3691 3697 3701 3709 3719 3727 3733 3739 3761 3767 3769 3779 3793 3797 3803 3821 3823 3833 3847 3851 3853 3863 3877 3851 3853 3907 3911 3917 3919 3923 3929 3931 3943 3947 3967 3989 4001 4003 4007 4013 4019 4021 4027 4049 4051 4057 4073 4079 4091 4093 4099 4111 4127 4129 4133 4139 4153 4157 4159 4177 4201 4211 4217 4219 4229 4231 4241 4243 4271 4271 4271 4271 4271 4271 4271 4271 4297 4327 4337 4339 4349 4357 4363 4373 4391 4397 4409 4421 4423 4441 4447 4451 4457 4463 4481 4483 4493 4507 4513 4517 4519 4523 4547 4549 4561 4567 4583 4591 4597 4603 4621 4637 4639 4643 4649 4651 4657 4663 4673 4721 4723 47 51 4759 4783 4787 4789 4793 4799 4801 4813 4817 4831 4861 4871 4877 4889 4903 4909 4919 4931 4933 4937 4943 4951 4957 4969 4973 4987 4993 4999 5003 5009 5011 5021 5023 5039 5051 5059 5077 5081 5087 5099 5101 517 5115. 5179 5189 5197 5209 5227 5231 5233 5237 5261 5273 5279 5281 5297 5303 5309 5323 5333 5347 5351 5381 5387 5393 5399 5407 5413 5417 5419 5431 5437 5441 5443 5449 5471 5477 5479 5483 5501 5503 5507 5519 5521 5527 5531 5557 5563 5569 5573 5581 5591 5623 5639 5641 5647 5651 5653 5657 5659 5669 5683 5689 5693 5701 5711 5717 5737 5741 5743 5749 5779 5783 5791 5801 5807 5813 5821 5827 5839 5843 5849 5851 5857 5861 5867 5869 5879 5881 5897 5903 5923 5927 5939 6053 6047 6047 6053 6067 6073 6079 6089 6091 6101 6113 6121 6131 6133 6143 6151 6163 6173 6197 6199 6203 6211 6217 6221 6229 6247 6257 6263 6269 6271 6277 6287 6299 6301 6311 6317 6323 6329 6337 6343 6353 6359 6361 6367 6373 6379 6389 6397 6421 6427 6449 6451 6469 64 73 6481 6491 6521 6529 6547 6551 6553 6563 6569 6571 6577 6581 6599 6607 6619 6637 6653 6659 6661 6673 6679 6689 6691 6701 6703 6709 6719 6733 6737 6761 6763 6779 6781 6791 6793 6803 6823 6827 6829 6833 6841 6857 6899 6891 6917 6947 6949 6959 6961 6967 6971 6977 6983 6991 6997.

With this same algorithm, we will have: 148,933 prime numbers less than n = 2,000,000; 216,815NP less than n = 3,000,000; 283.146NP less than n = 4,000,000 and 348,512N.P less than n = 5,000,000.

Objective of the find

Organize the distribution of prime numbers without any errors. Strengthen the security of electronic data to minimize information leakage. Strengthen the security of bank cards and data on the internet.

Scope and scientific consequences of the find

Criminals want to break an RSA encryption key. However, the private key can be recalculated provided that you can calculate the decomposition into prime numbers of a large number. To hope to accelerate this decomposition, one seeks to know as much as possible the prime numbers. However, as this scheme makes it possible to simply list the prime numbers, therefore in the hands of cyber criminologists, it is a danger for hacking accounts and for decoding secret information. But, in the hands of businesses and protection firms, this scheme will make it possible to better secure bank accounts, to better secure secret information, etc. The larger the prime numbers that make up a code, the more reliable the code. This simple algorithm with simple tools will better secure bank accounts, information and data on the internet.

Dr. Facinet Conté

Rector of Mahatma Gandhi University 

Guinee7.com

About The Author

CEO AfrikaTech

Comme beaucoup de personnes j’ai connu l’Afrique à travers des stéréotypes : l’Afrique est pauvre, il y a la guerre, famine… Je suis devenu entrepreneur pour briser ces clichés et participer à la construction du continent. J’ai lancé plusieurs entreprises dont Kareea (Formation et développement web), Tutorys (Plate-forme de e-learning), AfrikanFunding (Plate-forme de crowdfunding). Après un échec sur ma startup Tutorys, à cause d’une mauvaise exécution Business, un manque de réseau, pas de mentor, je suis parti 6 mois en immersion dans l’écosystème Tech au Sénégal. J’ai rencontré de nombreux entrepreneurs passionnés, talentueux et déterminés. A mon retour sur Paris je décide de raconter leur histoire en créant le média AfrikaTech. L'objectif est de soutenir les entrepreneurs qui se battent quotidiennement en Afrique en leur offrant la visibilité, les connaissances, le réseautage et les capitaux nécessaires pour réussir. L'Afrique de demain se construit aujourd'hui ensemble. Rejoignez-nous ! LinkedIn: https://www.linkedin.com/in/boubacardiallo

Related Posts

Leave a Reply

Your email address will not be published.

Téléchargez gratuitement des idées d’affaires et études de marché