User blog:Ribark/The CORN function

Hey, guys!

Ribark here.

So I've thinking of a new function.

But before that, I need to tell you something.

So you know how you eat Corn on the Cob from side to side, back and forth, right?

Well... I've decided to make a function out of that.

The CORN function, or ¢(n).

Here's how it works.

You take a number n. Then you reverse it, call that m. Then n+m=o. Reverse o, and call THAT p. o+p=q. Etc.

The corn function spits out how many steps it took to turn n into a palindrome

So take a number like, say, 109 (or 901).

109+901=1010. NOT a palindrome.

So then 1010+0101=1010+101=1111. NOW it's a palindrome.

So it takes 2 steps for 901 and 109 to become palindromes, ergo, ¢(109) and ¢(901) both equal 2.

In the comments below, write a 2 or more digit number, and I'll give you its result using ¢(n).

So this is Ribark, DFTKG.