We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website.
Please click on "Accept cookies" if you agree to the setting of cookies. Cookies that do not require consent remain unaffected by this, see
cookie policy and privacy policy.
DECLINE COOKIES

Let \(a_n\) be the integer obtained by writing all the integers from 1 to \(n\) from left to right. For example, \(a_3 = 123\) and \(a_{11} = 1234567891011\). Compute the remainder when \(a_{44}\) is divided by 45.

Guest Jan 4, 2019

#4**0 **

Hmm.

I have a very similar question as a matter of fact.

The only difference is that I am trying to compute the remainder when a_2017 is divided by 45.

Any thoughts?

I couldn't find where the 44 was implemented in guest's answers, otherwise I would have attempted to solve this problem by plugging in 2017 in to his/her's method.

It is clearly not viable to type all the first 2017 numbers into a calculator :D

sudsw12 Jan 5, 2019