**sPIqr Society **

**Marco Ripà (sPIqr Society Founder)**

**About the founder**

**Marco Ripà was born in Rome, Italy, 36 years ago and he still lives there.**

**He initially studied Physics but he gained a First Class degree in Economics. He speaks Italian, English, French and a little Spanish, while also being able to understand some Portuguese. He is good at mathematics and he likes science very much too. His interests and hobbies include philosophy, Italian poetry (especially Dante Alighieri's verses), literature, chess, powerlifting, fishing and martial arts. He often relaxes by listening to classical compositions, but he prefers rock music and melodic songs. He has a younger sister plus some very good friends. He is an author of number theory papers and the father of a 60+ integer sequences listed in OEIS.**

**He has been voted " Genius of the Year - 2014" representing Europe by the members of the World Genius Directory (GOTY Award).**

**In November 2014, he released his masterpiece "1729 il numero di Mr. 17-29".**

**He is member of more than thirty high IQ societies.**

**His personal YouTube Channel, focused on mathematics, logic and philosophy, counts about 160k subscribers.**

**His average score on the first submissions of high range IQ tests (the mean of all the spatial tests and numerical ones he has taken) is close to 200 points on the Cattell Scale (sd=24), while his best performance reaches 211 points on the same scale.**

**He is the creator of the X-Test, a very difficult logical/numerical test with some divergent thinking, and of the ENNDT/ENSDT.**

**He recently SOLVED the multidimensional generalization of the well known "thinking outside the box" Nine dots puzzle.**

- Ripà, M., Solving the n_1 <= n_2 <= n_3 Points Problem for n_3 < 6, *Researchgate*, June 2020

(DOI: 10.13140/RG.2.2.12199.57769/1):

**https://www.researchgate.net/publication/342331014_Solving_the_n_1_n_2_n_3_Points_Problem_for_n_3_6**

- Ripà, M., Solving the 106 years old 3k Points Problem with the Clockwise-algorithm, Researchgate, June 2020

(DOI: **10.13140/RG.2.2.34972.92802).**

**His last re**sults in numb

**er theory concerns the discovery of the constancy of the "**

__Congruence Speed__

**" of tetration, and his work is synthesized by the two papers below.**

**- Part 1 (peer-review):**

- Ripà, M. (2020), On the constant congruence speed of tetration, *Notes on Number Theory and Discrete Mathematics,* 26(3), pp. 245-260.

(DOI: **10.7546/nntdm.2020.26.3.245-260**).

- Part 2 (**preprint**):

Ripà, M., The congruence speed formula, *Researchgate*, October 2020

(DOI: **10.13140/RG.2.2.20966.04162/1**):

**https://www.researchgate.net/publication/344590312_The_congruence_speed_formula**

__Interviews__

**An Interview with Marco Ripà (Part 1): https://in-sightjournal.com/2016/01/01/an-interview-with-marco-ripa-part-one/**

**An Interview with Marco Ripà (Part 2): https://in-sightjournal.com/2016/01/08/an-interview-with-marco-ripa-part-two/**

**An Interview with Marco Ripà (Part 3): https://in-sightjournal.com/2016/01/15/an-interview-with-marco-ripa-part-three/**

Ripà's Conjecture on the 3^k Points Problem (09/07/2020) states that, for any k (i.e., considering any number of dimensions):** "It is possible to solve the 3x3x...x3 Points problem with a minimum length covering trail consisting of h(k)=(3^k-1)/2 links starting from every node of our 3x3x...x3 grid, except from the central one. Moreover, if we start the trail from the central node of the hypergraph, h(k)+1 links are needed" **(see

*https://www.researchgate.net/publication/343050221_Solving_the_106_years_old_3k_Points_Problem_with_the_Clockwise-algorithm*).

This is a true example of a serious open problem to test your genius capabilities,

in order to let your high IQ achieve some real goals. Do you wish to give it a try?

**The "picture" above represents Ripà's best answer for the 3x3x3 covering tree problem. It is an acyclic**

**connected arrangement of only 12 line segments, joining all the 27 points of the grid**

**𝐺3 := {(0, 1, 2) × (0, 1, 2) × (0, 1, 2)}. Can you see all the intersections in your mind?**