![]() |
![]() |
#1 |
Nov 2016
1010111101002 Posts |
![]()
How do we calculate the weight for a form (k*b^n+c)/gcd(k+c,b-1) for fixed integers k >= 1, b >= 2, c != 0, gcd(k,c) = 1, gcd(b,c) = 1.
I have a research that whether the form (k*b^n+c)/gcd(k+c,b-1) can contain a prime (there are special cases, such as (27*8^n+1)/7, (1*8^n-1)/7, (1*16^n-1)/15, and (4*16^n+1)/5, they can contain only one prime (because of the algebra factors), thus the weight is also 0, besides, there are also cases without covering set or algebra factors, but cannot contain a prime, such as 8*128^n+1 and 32*128^n+1) (I know that the dual forms have the same weight) Last fiddled with by sweety439 on 2020-02-14 at 12:37 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
How to calculate Nash/robinson weight? | cipher | No Prime Left Behind | 6 | 2009-05-09 15:35 |
Website is not able to calculate? | jmb1982 | PrimeNet | 1 | 2009-02-23 15:13 |
Getting a new Prime to calculate | roemer2201 | PrimeNet | 2 | 2008-12-20 16:12 |
NEW YOU FORMULATE THAT THEY CALCULATE PI | ewmayer | Miscellaneous Math | 1 | 2007-04-09 21:54 |
How do you calculate? | fropones | Lone Mersenne Hunters | 1 | 2003-05-27 23:01 |