The ITA Lucky Sevens problem

Reply Tue 6 Sep, 2005 11:55 am
Around Boston and Cambridge, there are a bunch of billboards with computational problems from a software company (ITA Software) with the challenge "Solve This... Work here. The problem that interested me was:


Write a program to compute the sum of all the integers between 1 and 10^11 that are both divisible by seven and, when the decimal digits are reversed, are still divisible by seven. Solutions to this problem will be judged on performance or algorithmic sophistication.

I found a neat solution (i.e. program) that solves this problem in a fraction of a second. The solution is interesting because you don't need to find all the integers in order to add them.

My solution (with java source code) is now posted on my web page. I would like to discuss the problem with others who have worked on it.
  • Topic Stats
  • Top Replies
  • Link to this Topic
Type: Discussion • Score: 0 • Views: 751 • Replies: 1
No top replies

Reply Wed 7 Sep, 2005 12:13 am
Cool solution. Have you been to mathschallenge.net? Click on Project Euler.
0 Replies

Related Topics

Evolution 101 - Discussion by gungasnake
Typing Equations on a PC - Discussion by Brandon9000
The Future of Artificial Intelligence - Discussion by Brandon9000
The well known Mind vs Brain. - Discussion by crayon851
Scientists Offer Proof of 'Dark Matter' - Discussion by oralloy
Blue Saturn - Discussion by oralloy
Bald Eagle-DDT Myth Still Flying High - Discussion by gungasnake
DDT: A Weapon of Mass Survival - Discussion by gungasnake
  1. Forums
  2. » The ITA Lucky Sevens problem
Copyright © 2021 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.04 seconds on 11/27/2021 at 11:27:26