mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2016-03-20, 21:01   #1
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

3·5·137 Posts
Default 10:2:2:14:15:3:9:0:12:0:0:11:5:11:8_19 mod 18

What is the fastest way of calculating the following base 19 formula?

10:2:2:14:15:3:9:0:12:0:0:11:5:11:819 mod 1819


Hint:Should be able to do it without calculators, pen or pencil.
a1call is offline   Reply With Quote
Old 2016-03-20, 21:30   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36×13 Posts
Default

Same as mod 9 for decimals. (Sum of digits, then repeat again if needed.)

Now, what is the same number mod 20?
Batalov is offline   Reply With Quote
Old 2016-03-20, 21:36   #3
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

3·5·137 Posts
Default

Quote:
Originally Posted by Batalov View Post
Same as mod 9 for decimals. (Sum of digits, then repeat again if needed.)

Now, what is the same number mod 20?
Correct,
Assuming the question is addressed to me. I can get the result but same as 11 for decimals, I don't know a short cut.
a1call is offline   Reply With Quote
Old 2016-03-20, 21:42   #4
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by a1call View Post
Correct,
Assuming the question is addressed to me. I can get the result but same as 11 for decimals, I don't know a short cut.
hint:if what came to my mind is correct it's not all that hard to work one out. edit: I don't even know why I thought what I came up to was wrong . three more hints to think about:

what is b mod b+1 if not b ?
what is that value to an even power ?
what is that value to an odd power ?

Last fiddled with by science_man_88 on 2016-03-20 at 22:05
science_man_88 is offline   Reply With Quote
Old 2016-03-20, 22:01   #5
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

3×5×137 Posts
Default

Guess I will leave that to others to solve.
But I will comment:
Write numbers in base 31, and easily calculate reminders to 2, 3, 5, 6, 10, 15 and 30.
a1call is offline   Reply With Quote
Old 2016-03-21, 08:20   #6
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

1075310 Posts
Default

Quote:
Originally Posted by a1call View Post
Guess I will leave that to others to solve.
But I will comment:
Write numbers in base 31, and easily calculate reminders to 2, 3, 5, 6, 10, 15 and 30.
Why do you think base-60 was so popular a while back?
xilman is offline   Reply With Quote
Old 2016-04-25, 07:50   #7
davar55
 
davar55's Avatar
 
May 2004
New York City

2·29·73 Posts
Default

Quote:
Originally Posted by a1call View Post
Correct,
Assuming the question is addressed to me. I can get the result but same as 11 for decimals, I don't know a short cut.
The shortcut for divisibility by 20 in base 19 is similar to that of
divisibility by 11 in base 10: add the digits, but with alternating
signs for adjacent place values, then see whether that result is
divisible by 20. For example, 19^2 + 3*19 + 2 is divisible by 20
because 1 - 3 + 2 = 0 is divisible by 20.
davar55 is offline   Reply With Quote
Old 2016-04-30, 07:38   #8
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

205510 Posts
Default

Quote:
Originally Posted by davar55 View Post
The shortcut for divisibility by 20 in base 19 is similar to that of
divisibility by 11 in base 10: add the digits, but with alternating
signs for adjacent place values, then see whether that result is
divisible by 20. For example, 19^2 + 3*19 + 2 is divisible by 20
because 1 - 3 + 2 = 0 is divisible by 20.
Didn't know that or the former.
Thank you.
a1call is offline   Reply With Quote
Old 2016-04-30, 15:42   #9
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

3×5×137 Posts
Default

* Could writing an arbitrary number in a base higher than 10 in the format dd:dd:.. ,result in a representation with more decimal digits than if written in base 10? (the separators ":" not to be counted)

Example:

1:0:019=361

Equal decimal digits (3)

Could the left side have more decimal digits for other numbers/higher-bases?


Thank you in advance.
a1call is offline   Reply With Quote
Old 2016-04-30, 16:00   #10
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

22·1,549 Posts
Default

Quote:
Originally Posted by a1call View Post
* Could writing an arbitrary number in a base higher than 10 in the format dd:dd:.. ,result in a representation with more decimal digits than if written in base 10? (the separators ":" not to be counted)
Yes. Easy.

10:10:1011 = 133010
retina is offline   Reply With Quote
Old 2016-04-30, 16:05   #11
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

838410 Posts
Default

Quote:
Originally Posted by a1call View Post
* Could writing an arbitrary number in a base higher than 10 in the format dd:dd:.. ,result in a representation with more decimal digits than if written in base 10? (the separators ":" not to be counted)

Example:

1:0:019=361

Equal decimal digits (3)

Could the left side have more decimal digits for other numbers/higher-bases?


Thank you in advance.


akin to asking can a low decimal number ever be represented as a sum with a higher power of another base. or if logint in pari allows itself to be higher for higher bases given the same decimal number:

the real problem then is you can represent more numbers under any given power of a higher number:


19^n = 1.9^n*10^n so if n>3.58 it exceeds the next power of 10 for example so if the first base 19 digit is more than 3 it's actually able to represent a higher number in less "digits".
science_man_88 is offline   Reply With Quote
Reply



All times are UTC. The time now is 03:36.


Sat Jul 17 03:36:04 UTC 2021 up 50 days, 1:23, 1 user, load averages: 1.42, 1.81, 1.66

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.