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

Home > Just Math
A prime GCD adventure (Posted on 2024-05-03) Difficulty: 3 of 5
Determine the greatest common divisor of the numbers p6-7p2+6 where p runs through the prime numbers p≥11.

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts I don't know the interpretation. | Comment 3 of 6 |
If one starts with p=2 and goes through the primes above 11:

clc
p=2;
v=p^6-7*p^2+6;
g=v;
disp ([p,g,v])
while p<40 
  p=nextprime(p+1);
  v=p^6-7*p^2+6;
  g=gcd(g,v);
  disp ([p,g,v])
end
      
           p          GCD  p^6 - 7p^2 + 6
           2          42         42
           3          42        672
           5          42       15456
           7           6      117312
          11           6     1770720
          13           6     4825632
          17           6    24135552
          19           6    47043360
          23           6   148032192
          29           6   594817440
          31           6   887496960
                               
the GCD seems to level at 6.

If one starts at 11

clc
p=11;
v=p^6-7*p^2+6;
g=v;
disp ([p,g,v])
while p<40 
  p=nextprime(p+1);
  v=p^6-7*p^2+6;
  g=gcd(g,v);
  disp ([p,g,v])
end

          11     1770720     1770720
          13         672     4825632
          17         672    24135552
          19         672    47043360
          23         672   148032192
          29         672   594817440
          31         672   887496960

the GCD seems to level at 672.

  Posted by Charlie on 2024-05-03 11:10:23
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 (16)
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