Friday
April 18, 2014

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:
Answer:

Related Questions

ALGebra - We define n♡ recursively as follows. 1♡=1; n♡=((n&#...
7th grade math - Which expression has the same value as −|−3|⋅...
math - A sequence of polynomials gk(x) is defined recursively as follows. g0(x)=...
FACTORIAL PRODUCT(ALGEBRA) - Let N=1!⋅2!⋅3!⋅4!9!⋅10!. ...
PHYSICS - QUIZ 1 AND 2, PROBLEM 3 A block of mass M is pulled with a rope that ...
math/algebra - 1. Which of the following inequality signs would make a true ...
biology - Given the part of the molecule shown below, can the underlined atom ...
Discrete Math - Calculate R(4) where the recursively defined sequence R is ...
Maths - Let N=1!⋅2!⋅3!⋅4!9!⋅10!. Let 2^k be the largest...
Math (algebra) - Let x=2013, y=140542, z=−142555. Find [(x−y)/z + (y...

Search
Members