mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2020-10-29, 18:20   #1
sweety439
 
sweety439's Avatar
 
Nov 2016

24·5·31 Posts
Default 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})
sweety439 is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 17:30.

Wed Nov 25 17:30:10 UTC 2020 up 76 days, 14:41, 3 users, load averages: 1.16, 1.58, 1.77

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.