2020-03-12, 02:50 | #1 |
"Sam"
Nov 2016
2^{2}×79 Posts |
Orders of consecutive elements does not exceed floor(sqrt(p))
For some prime p, let m = ord_{p}(2) be the multiplicative order of 2 mod p, and m_{2} = ord_{p}(3) be the order of 3 mod p. Let L be the least common multiple of m and m_{2} (L = lcm(m,m_{2})).
Does a prime p exist such that L < sqrt(p) or simply floor(sqrt(p)) ? (There is no such prime below 10^9) The question in general is, for integers (a,b) (a ≠ b^{i} for some i > 2 or vice versa) are there finitely many primes p such that: L > floor(sqrt(p)) where L = lcm(m,m_{2}) m = ord_{p}(a) and m_{2} = ord_{p}(b) ? Last fiddled with by carpetpool on 2020-03-12 at 02:53 |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
how is it, primes in the security elements? | hal1se | Miscellaneous Math | 2 | 2018-08-30 02:06 |
Small search of cycles with odd and even elements | Drdmitry | Aliquot Sequences | 0 | 2011-12-14 13:50 |
The Elements | science_man_88 | Science & Technology | 24 | 2010-07-26 12:29 |
127*Sqrt(62) | XYYXF | Math | 2 | 2007-12-08 12:31 |
Smallest floor of k for cullen prime | Citrix | Prime Cullen Prime | 12 | 2007-04-26 19:52 |