
Recent Posts
 A^2 = B^3 + C^3
 Set {4,b,c,d,e} such that the product of any two of them increased by 1 is a square
 smallest integer whose first n multiples all contain a 3
 Set {3,b,c,d,e} such that the product of any two of them increased by 1 is a square
 Set {2,b,c,d,e} such that the product of any two of them increased by 1 is a square
Recent Comments
Archives
 February 2017
 January 2017
 December 2016
 November 2016
 October 2016
 September 2016
 August 2016
 July 2016
 June 2016
 May 2016
 April 2016
 March 2016
 February 2016
 January 2016
 December 2015
 November 2015
 October 2015
 September 2015
 August 2015
 July 2015
 June 2015
 May 2015
 April 2015
 March 2015
 February 2015
 January 2015
 December 2014
 November 2014
 October 2014
 September 2014
 August 2014
 July 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 July 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 July 2012
 June 2012
 May 2012
 April 2012
 March 2012
 February 2012
 January 2012
Categories
Meta
Tag Archives: Digits 1 to 9
Digits from 1 to 9 : A^(B/C) + D^(E/F) + G^(H/I) is a palindrome
Can you find other palindromes? Paul found:
Make 1111 using (+, , *, /, ^) and digits 19 only once
Make 1111 using (+, , *, /) and exponentiation using only one digit from 1 to 9 each time. For example, (6 + 6^6)/(6 + 6*6) = 1111 the digit 6 is repeated only six times. … Continue reading
All digits 1 to 9 only once  Magic square
a b c d e f g h i … Continue reading
All digits 1 to 9 only once  (a – b)^x + (c – d)^y + (e – f)^z = 0
(a – b)^x + (c – d)^y + (e – f)^z = 0 a, b, c, x, d, y, e, f , z represent all digits from 1 … Continue reading
Product  Use the digits 1 to 9 exactly once
Goal: To use all digits from 1 to 9 de a b c fg hi where each of 9 the letters (a, b, c, d, e, f, g, h, i) represents … Continue reading
Concatenation  N = M  M
Goal: To assign a different digit from 1 to 9 to each of the letters in the following expression to produce concatenation of a number m with itself: that is, N = … Continue reading
Palindromes and Repdigits  using all digits 19 only once — Part 2
Goal: To assign a different digit from 1 to 9 to each of the letters in the following expression to produce repdigits and palindromes: (u – v) (r + s) * t + … Continue reading
Primes  using all digits 19 only once — Part 1
Goal: To assign a different digit from 1 to 9 to each of the letters in the following expression to produce prime numbers: (u – v) (r + s) * t + … Continue reading