Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

On Erdős problem $\# 648$

Stijn Cambie

Abstract

We establish the order of the maximum length of an increasing sequence, bounded by $n$, in which the largest prime divisor of the elements form a decreasing sequence.

On Erdős problem $\# 648$

Abstract

We establish the order of the maximum length of an increasing sequence, bounded by , in which the largest prime divisor of the elements form a decreasing sequence.

Paper Structure

This paper contains 1 section, 1 theorem, 5 equations.

Table of Contents

  1. Acknowledgement

Key Result

Theorem 1

$g(n)=\Theta( ( n/ \log n)^{1/2} ).$

Theorems & Definitions (4)

  • Theorem 1
  • proof : Proof upper bound:
  • proof : Proof lower bound:
  • Remark 2