Difference between revisions of "1987 OIM Problems/Problem 4"
(Created page with "== Problem == We define the succession <math>p_n</math> the following way: <math>p_1=2</math> and for all <math>n</math> more or equal than 2, <math>p_n</math> is the greatest...") |
|||
| Line 3: | Line 3: | ||
<cmath>p_1p_2p_1\cdots p_{n-1} +1</cmath> | <cmath>p_1p_2p_1\cdots p_{n-1} +1</cmath> | ||
Prove that <math>p_n</math> is different than 5 | Prove that <math>p_n</math> is different than 5 | ||
| + | |||
| + | ~translated into English by Tomas Diaz. ~orders@tomasdiaz.com | ||
== Solution == | == Solution == | ||
{{solution}} | {{solution}} | ||
| + | |||
| + | == See also == | ||
| + | https://www.oma.org.ar/enunciados/ibe2.htm | ||
Latest revision as of 13:27, 13 December 2023
Problem
We define the succession 
the following way: 
and for all 
more or equal than 2, is the greatest prime divisor of the expression:
![\[p_1p_2p_1\cdots p_{n-1} +1\]](http://latex.artofproblemsolving.com/2/e/7/2e7b4aa8120dcb82b3fe7db60a75ea0b2624dba5.png)
Prove that is different than 5
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
