February 26, 2017

Homework Help: Algebra

Posted by Stranger on Monday, March 18, 2013 at 5:16am.

We define n♡ recursively as follows.
1♡=1; n♡=((n−1)♡)⋅n+1
Find the largest n<1000 such that the last two digits of n♡ are zeroes.

Just to make it clear: unlike "n-factorial," "n-heart" is NOT an official mathematical terminology.

Answer This Question

First Name:
School Subject:

Related Questions

More Related Questions