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.

2 answers

951
919
Similar Questions
  1. 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
    1. answers icon 1 answer
  2. Define the number sequence {5n} n1 = {3,6,9,12,15, … ) recursively�
    1. answers icon 1 answer
    1. answers icon 0 answers
    1. answers icon 1 answer
more similar questions