2020-10-29, 18:20 | #1 |
Nov 2016
2764_{10} Posts |
Two number theory questions
1. How many primes <= 12^n which is == k mod 12? For each values n = 10, 11, 12 and k = 1, 5, 7, 11
2. Find all Kaprekar's cycles for 9-digit to 12-digit dozenal numbers (a Kaprekar's cycle for 8-digit dozenal numbers is {4210XX98, X9737422, 87428744, 64328876, 652EE866, 961EE953, X8428732, 86528654, 6410XX76, X92EE822, 9980X323, X7646542, 8320X984, X7537642, 8430X874, X5428762, 8630X854, X540X762, X830X832, X8546632, 8520X964, X740X742, X8328832, 86546654}) |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Observational Number Theory | MattcAnderson | Miscellaneous Math | 8 | 2016-01-03 19:43 |
probabilistic number theory | wildrabbitt | Math | 57 | 2015-09-17 18:26 |
Elementary Particle Questions...fundamentals of Higgs Boson Theory | Christenson | Puzzles | 25 | 2012-01-02 23:37 |
Number Theory Textbook | ThomRuley | Math | 5 | 2005-08-28 16:04 |
number theory help | math | Homework Help | 2 | 2004-05-02 18:09 |