mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Lounge

Reply
 
Thread Tools
Old 2020-07-15, 22:41   #23
sweety439
 
sweety439's Avatar
 
Nov 2016

22·557 Posts
Default

Quote:
Originally Posted by Stargate38 View Post
As shown on the following website, A-Z represent 10-35, a-z represent 36-61, and 62-93 are represented by punctuation (Case Sensitive):
http://home.ccil.org/~remlaps/DispConWeb/index.html
You can use ASCII character n+32 to represent n for base 95, see http://www.icerealm.org/FTR/?s=docs&p=base95

Last fiddled with by Uncwilly on 2020-07-16 at 14:01 Reason: TRIM YOUR QUOTES
sweety439 is offline   Reply With Quote
Old 2020-08-11, 22:38   #24
tuckerkao
 
Jan 2020

3816 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
I see no counter example

proof:

the addition in base 3 goes

20*1-1 = 12
20*2-2 = 12+20 =32

since 20 affects the second place up and beyond the last digit wouldn't change unless maybe negative.
[Trinary] 20 * 2 = 110, 110 - 2 = 101

You should never have the "3" in base 3 because there are only [0, 1, 2].

I used my color balls and I figured the answer out without using the base calculator.
Attached Thumbnails
Click image for larger version

Name:	Trinary 20 times 2 - 2.png
Views:	16
Size:	28.0 KB
ID:	23044  

Last fiddled with by tuckerkao on 2020-08-11 at 23:16
tuckerkao is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Bases > 1030 and k's > CK gd_barnes Conjectures 'R Us 127 2020-08-18 17:24
k*b^n+/-1, Bases 271 and 11971 robert44444uk Math 21 2013-11-07 15:01
Other Bases? wblipp GPU Computing 50 2012-10-11 13:23
Starting new bases MrOzzy Conjectures 'R Us 104 2010-03-18 22:11
Riesel and Sierp numbers bases <= 1024 R. Gerbicz Conjectures 'R Us 22 2009-12-29 20:21

All times are UTC. The time now is 08:00.

Fri Sep 18 08:00:45 UTC 2020 up 8 days, 5:11, 0 users, load averages: 1.35, 1.50, 1.58

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.