The Oddness Function

Algebra Level pending

For any integer n 3 n \geq 3 , we define O ( n ) O(n) to be "the oddness of n", which is the product of all the (not necessarily unique) odd prime factors of n n .

For example, since 300 = 2 2 × 3 × 5 2 300 = 2^2 \times 3 \times 5^2 , so O ( 300 ) = 1 × 3 × 5 2 O(300) = 1 \times 3 \times 5^2 .

What is the smallest possible value of O ( n ) O(n) ?

1 2^2 We can form 2 such progressions,both having different first terms. 2 Description of E(x) is not sufficient.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Prince Loomba
Sep 24, 2016

The evenness is simply the 2^n. A gp with first term 1

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...