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

## Related Questions

- ALGebra - We define n♡ recursively as follows. 1♡=1; n♡=((n&#...
- math - In an ordered (A – K, ♠♢♣♡) 52 card deck, using ...
- FACTORIAL PRODUCT(ALGEBRA) - Let N=1!⋅2!⋅3!⋅4!…9!⋅10!. ...
- math - A sequence of polynomials gk(x) is defined recursively as follows. g0(x)=...
- math - Start with the basic function f(x)=2x. If you have an initial value of 1...
- math - For every prime p consider all polynomials f(x) with integer coefficients...
- 7th grade math - Which expression has the same value as −|−3|⋅...
- math/algebra - 1. Which of the following inequality signs would make a true ...
- Physics - You are given vectors A = 5.0i - 6.5j and B = -2.5i + 7.0j. A third ...
- Math (algebra) - For every positive integer n, consider all monic polynomials f(...

More Related Questions