All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Square Semiprime Sums (Posted on 2011-04-12) Difficulty: 3 of 5
Alice, Betty and Carol each chose two 2-digit semiprimes (products of exactly two primes each) whose difference was also a semiprime. In each of the three cases, the six primes going into the three semiprimes involved were all different. Also in each case, the sum of the two semiprimes was a perfect square.

Alice, Betty and Carol had different pairs of semiprimes, though there may have been repetition of any given semiprime. Alice and Betty had the same sum for their semiprimes, but Carol's sum was different.

What were Carol's two semiprimes?

  Submitted by Charlie    
No Rating
Solution: (Hide)
74 and 95


                   the two                 factorization of
                  semiprimes diff sum   the semiprimes involved
Alice or Betty:   26 95       69  121   2 * 13, 5 * 19, 3 * 23
Betty or Alice:   35 86       51  121   5 * 7, 2 * 43, 3 * 17
Carol's:          74 95       21  169   2 * 37, 5 * 19, 3 * 7


isSemiPrime[n] :=
  {
  tst=factor[n]
  answ=false
  if length[tst]==2 
   {
   if tst@0@1==1 and tst@1@1==1 
        answ=true
   }
 // The below section commented out as these semiprimes
 // must have unique prime factors
 //
 // if length[tst]==1
 //  {
 //  if tst@0@1==2 
 //     answ=true
 //  }
  return answ
  }

for n1=10 to 99
 if isSemiPrime[n1]
 {
 for n2=n1+1 to 99
  {
  if isSemiPrime[n2]
   {
   diff=n2-n1
   sqtst=n1+n2
   sr=int[sqrt[sqtst]+.5]
   if isSemiPrime[diff] and sr*sr==sqtst
     {
     f1=factor[n1]; f2=factor[n2]; fd=factor[diff]; 
     println["$n1 $n2     $diff  $sqtst     $f1   $f2   $fd"]
     }
   } 
  }
 }

14 35     21  49     [[2, 1], [7, 1]]   [[5, 1], [7, 1]]   [[3, 1], [7, 1]]
15 21     6  36      [[3, 1], [5, 1]]   [[3, 1], [7, 1]]   [[2, 1], [3, 1]]
26 95     69  121     [[2, 1], [13, 1]]   [[5, 1], [19, 1]]   [[3, 1], [23, 1]]
35 86     51  121     [[5, 1], [7, 1]]   [[2, 1], [43, 1]]   [[3, 1], [17, 1]]
74 95     21  169     [[2, 1], [37, 1]]   [[5, 1], [19, 1]]   [[3, 1], [7, 1]]

The bracketed arrays show pairs of numbers, the first of which is the prime factor, and the second of which is the power to which that factor is raised, which, in this case, is always 1.

The two with equal sums are the two with sum 121. The only remaining set with unique prime factors is the last.

Based on Enigma No. 1633, "Same perfect square", by Richard England, New Scientist, 12 February 2011.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(3): Solution - Interpretation? (spoiler)brianjn2011-04-13 05:15:57
re(2): Solution - Interpretation? (spoiler)Dej Mar2011-04-13 04:56:24
re: Solution - Interpretation?brianjn2011-04-13 03:51:59
SolutionSolutionDej Mar2011-04-13 01:58:14
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information