Go Back > Extra Stuff > Blogorrhea > sweety439

Thread Tools
Old 2020-06-11, 06:36   #1
Nov 2016

22×3×5×47 Posts
Default Smallest multiple of n satisfying given condition in dozenal

* Smallest multiple of n which is a repdigit in dozenal, not exist when n is multiple of 10, 14, 16, or 23
* Smallest multiple of n which is palindromic in dozenal, not exist when n is multiple of 10
* Smallest multiple of n such that the parity of its digits in dozenal alternates, not exist when n is multiple of 20
* Smallest multiple of n using only digits 0 and/or 1 in dozenal, exist for all n

I have completed all of them for n<=4000, can someone complete them to n=10000 or 20000?

Mod note: Thread moved from Puzzles to here
Attached Files
File Type: txt smallest repdigit divisible by n.txt (262.1 KB, 125 views)
File Type: txt smallest palindromic multiple of n.txt (82.6 KB, 103 views)
File Type: txt smallest alternating multiple of n.txt (15.3 KB, 98 views)
File Type: txt smallest multiple of n only use 0 and 1.txt (121.8 KB, 95 views)

Last fiddled with by retina on 2020-06-11 at 10:37 Reason: Add note
sweety439 is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Dozenal near- and quasi- repunit primes sweety439 And now for something completely different 31 2020-12-09 01:01
Mersenne numbers in Dozenal base tuckerkao Lounge 7 2020-02-11 04:44
Satisfying numbers heliosh Lounge 1 2018-01-19 14:19
necessary but not sufficient condition for primes Alberico Lepore Alberico Lepore 22 2018-01-03 16:17
Composite integers n satisfying prime exponents of Mersennes carpetpool carpetpool 7 2017-01-05 04:36

All times are UTC. The time now is 06:02.

Sat Apr 17 06:02:06 UTC 2021 up 9 days, 42 mins, 0 users, load averages: 2.48, 2.06, 1.74

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.