olymmath

BALTIC-WAY 2015 Problem 16

  • Answer

Denote by P(n)P(n) the greatest prime divisor of nn. Find all integers n≥2n \geq 2 for which

P(n)+⌊n⌋=P(n+1)+⌊n+1⌋.P(n)+\lfloor\sqrt{n}\rfloor=P(n+1)+\lfloor\sqrt{n+1}\rfloor .

(Note: ⌊x⌋\lfloor x\rfloor denotes the greatest integer less than or equal to xx.)

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

3

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator baltic-way/2015/p16 · Tag PJAQ8AAPQ3 · Edit this page on GitHub · Keys: j next, k previous