S.O.S. Mathematics CyberBoard

Your Resource for mathematics help on the web!
It is currently Sat, 18 May 2013 22:46:14 UTC

View unanswered posts | View active topics


Board index » Applications » Computer Science

All times are UTC [ DST ]



Post new topic Reply to topic  Page 1 of 1
  [ 3 posts ] 
  Print view Previous topic | Next topic 
Author Message
cansado
 Post subject: basic demonstration
PostPosted: Sun, 5 Feb 2006 21:10:44 UTC 
Offline
S.O.S. Newbie

Joined: Mon, 27 Dec 2004 01:49:59 UTC
Posts: 4
hi, I need to prove that in any base b, the result of multiplying two numbers of k digits doesn't need more than 2 * k digits.

thanks a lot!![/i]
Top
 Profile  
 
Guest
 Post subject:
PostPosted: Tue, 7 Feb 2006 02:44:17 UTC 
Hi!

What do you mean with any base b?

I think \log_{10} could come in handy for this problem.
Top
  
 
bugzpodder
 Post subject:
PostPosted: Fri, 10 Feb 2006 22:43:29 UTC 
Offline
Member of the 'S.O.S. Math' Hall of Fame
User avatar

Joined: Sun, 4 May 2003 16:04:19 UTC
Posts: 2906
u*v<=(b^k-1)^2<b^(2k)
done

_________________
Has anyone noticed that the below is WRONG? Otherwise this statement would be true:
-1\cong1\pmod{13}
i\cong5 \pmod{13} where
i^2=-1
Top
 Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  Page 1 of 1
  [ 3 posts ] 

Board index » Applications » Computer Science

All times are UTC [ DST ]

Who is online

Users browsing this forum: No registered users

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum

Search for:
Jump to:  
Contact Us | S.O.S. Mathematics Homepage
Privacy Statement | Search the "old" CyberBoard

users online during the last hour
Powered by phpBB © 2001, 2005-2011 phpBB Group.
Copyright © 1999-2013 MathMedics, LLC. All rights reserved.
Math Medics, LLC. - P.O. Box 12395 - El Paso TX 79913 - USA