1-2 3+4 5+6 7-8 9 = 1
+1-2 3+4 5+6 7-8 9 = 1
1+2 3+4-5+6 7-8 9 = 1
+1+2 3+4-5+6 7-8 9 = 1
-1+2 3-4+5+6 7-8 9 = 1
1+2 3-4 5-6 7+8 9 = 1
+1+2 3-4 5-6 7+8 9 = 1
1-2 3-4+5-6 7+8 9 = 1
+1-2 3-4+5-6 7+8 9 = 1
1-2-3-4 5+6 7-8-9 = 1
+1-2-3-4 5+6 7-8-9 = 1
1+2-3 4+5 6-7-8-9 = 1
+1+2-3 4+5 6-7-8-9 = 1
-1+2 3+4+5-6-7-8-9 = 1
-1 2+3 4-5-6+7-8-9 = 1
1+2+3+4-5+6+7-8-9 = 1
+1+2+3+4-5+6+7-8-9 = 1
-1+2+3-4+5+6+7-8-9 = 1
1-2-3+4+5+6+7-8-9 = 1
+1-2-3+4+5+6+7-8-9 = 1
1+2 3+4 5-6 7+8-9 = 1
+1+2 3+4 5-6 7+8-9 = 1
1+2 3-4-5-6-7+8-9 = 1
|
+1+2 3-4-5-6-7+8-9 = 1
1+2+3+4+5-6-7+8-9 = 1
+1+2+3+4+5-6-7+8-9 = 1
-1+2+3+4-5+6-7+8-9 = 1
1-2+3-4+5+6-7+8-9 = 1
+1-2+3-4+5+6-7+8-9 = 1
-1-2-3+4+5+6-7+8-9 = 1
1-2+3+4-5-6+7+8-9 = 1
+1-2+3+4-5-6+7+8-9 = 1
1+2-3-4+5-6+7+8-9 = 1
+1+2-3-4+5-6+7+8-9 = 1
-1-2+3-4+5-6+7+8-9 = 1
-1+2-3-4-5+6+7+8-9 = 1
-1+2 3+4 5-6 7-8+9 = 1
1-2 3-4 5+6 7-8+9 = 1
+1-2 3-4 5+6 7-8+9 = 1
-1+2 3-4-5-6-7-8+9 = 1
-1+2+3+4+5-6-7-8+9 = 1
1-2+3+4-5+6-7-8+9 = 1
+1-2+3+4-5+6-7-8+9 = 1
1+2-3-4+5+6-7-8+9 = 1
+1+2-3-4+5+6-7-8+9 = 1
-1-2+3-4+5+6-7-8+9 = 1
|
1+2-3+4-5-6+7-8+9 = 1
+1+2-3+4-5-6+7-8+9 = 1
-1-2+3+4-5-6+7-8+9 = 1
-1+2-3-4+5-6+7-8+9 = 1
1-2-3-4-5+6+7-8+9 = 1
+1-2-3-4-5+6+7-8+9 = 1
1-2 3+4+5+6+7-8+9 = 1
+1-2 3+4+5+6+7-8+9 = 1
1+2+3+4 5-6 7+8+9 = 1
+1+2+3+4 5-6 7+8+9 = 1
1 2+3 4+5-6 7+8+9 = 1
+1 2+3 4+5-6 7+8+9 = 1
1+2+3-4-5-6-7+8+9 = 1
+1+2+3-4-5-6-7+8+9 = 1
-1+2-3+4-5-6-7+8+9 = 1
1-2-3-4+5-6-7+8+9 = 1
+1-2-3-4+5-6-7+8+9 = 1
-1-2-3-4-5+6-7+8+9 = 1
-1-2 3+4+5+6-7+8+9 = 1
1-2+3 4-5 6+7+8+9 = 1
+1-2+3 4-5 6+7+8+9 = 1
1 2-3 4+5-6+7+8+9 = 1
+1 2-3 4+5-6+7+8+9 = 1
|
Total solutions = 69
(26 of which have a leading "+", which is redundant)
69/19683 = 0.35 %
Commissioned for BBC Education as part of the Count Me In Numeracy Site
(old link was : http://www.dircon.co.uk/media/square.html)
The sum of 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45
Multiply 123456789 by 2 and you get 246913578, the sum of which is 45
Divide 123456789 by 2 and you get 61728394.5, the sum of which is 45
Puzzle : Olympic Ring Addition.
This is another puzzle found on the web dealing with the digits one trought nine.
(Old link was : http://freespace.virgin.net/ashley.england/Moment/olympic.htm).
Given the five olympic rings how can the digits one through nine be placed within the nine regions
(five non-overlapping ring regions and four overlapping regions shared between two rings)
so that each ring contains the same total ?
Or alternatively, using the labels A through I for the regions, how can the numbers one through nine
be assigned to the variables such that :
A + B = B + C + D = D + E + F = F + G + H = H + I
Can you solve it ?
SPOILER : it is hidden somewhere in the source code of this page !
For a logical and detailed approach other than brute force consult
Ken Duisenberg's Puzzle-Of-The-Week Archive - Olympic Ring Addition.
More Integer Sequences from Sloane's Database
- A034277 Decimal part of a(n)^(1/2) starts with a 'nine digits' anagram. - Patrick De Geest
- A034278 Decimal part of a(n)^(1/3) starts with a 'nine digits' anagram. - Patrick De Geest
- A034279 Decimal part of a(n)^(1/4) starts with a 'nine digits' anagram. - Patrick De Geest
- A034280 Decimal part of a(n)^(1/5) starts with a 'nine digits' anagram. - Patrick De Geest
- A034281 Decimal part of a(n)^(1/6) starts with a 'nine digits' anagram. - Patrick De Geest
- A034282 Decimal part of a(n)^(1/7) starts with a 'nine digits' anagram. - Patrick De Geest
- A034283 Decimal part of a(n)^(1/8) starts with a 'nine digits' anagram. - Patrick De Geest
- A034284 Decimal part of a(n)^(1/9) starts with a 'nine digits' anagram. - Patrick De Geest
- A034285 Decimal part of a(n)^(1/10) starts with a 'nine digits' anagram. - Patrick De Geest
- A034286 Decimal part of a(n)^(1/11) starts with a 'nine digits' anagram. - Patrick De Geest
- A034306 Fibonacci iteration F(1,palindrome a(n)) leads to a 'nine digits' anagram. - Patrick De Geest
- A034587 Fibonacci iteration F(1,a(n)) leads to a 'nine digits' anagram. - Patrick De Geest
- A034588 Fibonacci iteration F(1,prime p(n)) leads to a 'nine digits' anagram. - Patrick De Geest
- A034589 Fibonacci iteration F(1,lucky number a(n)) leads to a 'nine digits' anagram. - Patrick De Geest
- A034590 Decimal part of square root of 'nine digits anagram' starts with a 'nine digits anagram'. - Patrick De Geest
- A035136 Decimal part of a(n)^(1/n) starts with a 'nine digits' anagram. - Patrick De Geest
- A035304 Decimal part of a(n)^(1/n) starts with a pandigital anagram (digits 0 through 9 in some order). - Erich Friedman
- A036744 Penholodigital squares: includes each digit once. - dww (wilson)
- A036745 Holodigital squares: includes each digit once. - dww (wilson)
- A039667 Pandigital sums: n such that n+x=y with x=2n and y=3n. - Felice Russo
- A046043 Autobiographical (or curious) numbers: n = x0 x1 x2...x9 such that xi is the number of digits equal to i in n. - Robert Leduc
- A049442 Sum of first n consecutive prime numbers is pandigital (includes all 10 digits exactly once). - G. L. Honaker, Jr.
- A049443 Sum of consecutive primes to p is pandigital (includes all 10 digits exactly once). - G. L. Honaker, Jr.
- A049446 Pandigital sums associated with A049442. - G. L. Honaker, Jr.
- A050278 Pandigital numbers: numbers containing the digits 0-9. - Eric W. Weisstein
- A050288 Pandigital primes. - Eric W. Weisstein
- A050289 Zeroless pandigital numbers: numbers containing the digits 1-9 and no 0's. - Eric W. Weisstein
- A050290 Zeroless pandigital primes. - Eric W. Weisstein
- A053654 Multiples of 123456789. - Klaus Strassburger
- A054037 n^2 contains exactly 9 different digits. - Asher Auel
- A054038 n^2 contains every digit at least once. - Asher Auel
- A054383 Number of pandigital fractions for 1/n. - Eric W. Weisstein
- A058760 Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e. is pandigital) in some base b>1. Numbers are expressed in base 10. - G. L. Honaker, Jr. and Mike Keith
- A058908 Six prime numbers in arithmetical progression with a common difference of 9876543210. - G. L. Honaker, Jr.
- A058909 Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e., is pandigital) in base 10. - Mike Keith and G. L. Honaker, Jr.
- A071519 Numbers whose squares are zeroless pandigitals (i.e. use the digits 1 through 9 once). - Lekraj Beedassy
- A074205 Smallest positive integer whose n-th power contains an equal number of each digit (0-9) when represented in base 10. - Jack Brennen
Sources
Prime Curios! - site maintained by G. L. Honaker Jr. and Chris Caldwell
3
5
89
999
3187
5077
5986
28651
32423
14368485
15618090
36543120
40578660
45269999
394521678
1123465789
1227182861
1531415939
2543568463
5897230146
10123457689
1023456987896543201
5021837752995317770489
Contributions
[
TOP OF PAGE]