# Algebra

posted by .

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.

• Algebra -

919♡ = 19328918...75566100
but I haven't yet come up with a number-theoretic argument.

The values of n where n♡ ends in 00 are
19 107 119 207 219 307 319 407 419 507 519 607 619 707 719 807 819 907 919

It appears that there's a pattern there, no? More thought needed.

## Similar Questions

1. ### math/algebra

1. Which of the following inequality signs would make a true statement if it replaced the question mark in the following equation?

Which expression has the same value as −|−3|⋅|5|?
3. ### ALGebra

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" …
4. ### FACTORIAL PRODUCT(ALGEBRA)

Let N=1!⋅2!⋅3!⋅4!…9!⋅10!. Let 2^k be the largest power of 2 that divides N. What is the value of k?
5. ### math

A sequence of polynomials gk(x) is defined recursively as follows. g0(x)=x; gk+1(x)=gk(x^2+2x)−gk(x) Find the last three digits of the coefficient of x^2 in g299(x).
6. ### math

For every prime p consider all polynomials f(x) with integer coefficients from 1 to p and degree at most p−1, such that for all integers x the number f(2x)−f(x) is divisible by p. Find the sum of all primes p<1000 such …
7. ### math

In an ordered (A – K, ♠♢♣♡) 52 card deck, using JUMP SEARCH, looking for the queen of hearts, a. What is the optimum jump size k?
8. ### math

Start with the basic function f(x)=2x. If you have an initial value of 1, then you end up with the following iterations. • f (1) = 2 ⋅1 =2 • f 2 (1) = 2 ⋅2 ⋅1 =4 • f 3 (1) = 2 ⋅ 2 ⋅ 2 ⋅1 = …