A number theory problem !

Правка en3, от Anthony_Jakson, 2020-08-16 06:31:32

A problem came in my mind few days ago. And now I am very willing to know the ans. I tried but couldn't solve it.

You are given n numbers 1<= n <= (10^5) you have to maximize the gcd of those numbers.

You can do one operation : Replace a with a-1 (a is a number)

**Note: ** It is not a part of any ongoing contest.

Can any one please tell me any solution that will work in this time constraint. Thanks in advance.

I am very sorry guys. You have to maximize .. not minimize

Теги #number theory, #math, #gcd, #question

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Anthony_Jakson 2020-08-16 06:31:32 74
en2 Английский Anthony_Jakson 2020-08-15 23:52:50 18
en1 Английский Anthony_Jakson 2020-08-15 23:50:59 444 Initial revision (published)