Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7854105
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 2, 20262026-06-02T19:56:04+00:00 2026-06-02T19:56:04+00:00

Given an n-place integer and an m-place integer. How can I multiply them in

  • 0

Given an n-place integer and an m-place integer. How can I multiply them in LISP using lists, arrays or any other lisp specific data types?

for instance;

a(1)a(2)…a(n)

b(1)b(2)…b(m)

with result of;

r(1)r(2)…r(m+n)

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-02T19:56:06+00:00Added an answer on June 2, 2026 at 7:56 pm

    Common Lisp has already bignums natively. Why don’t you use them?

    You basically don’t have to declare anything specially, they “magically” happen:

     % sbcl
     This is SBCL 1.0.56.0.debian, an implementation of ANSI Common Lisp.
    
     * (defun fact (n) (if (< n 1) 1 (* n (fact (- n 1)))))
     FACT
    
     * (fact 50)
     30414093201713378043612608166064768844377641568960512000000000000
    

    So with a Common Lisp, you basically don’t have to bother…

    addenda

    And efficient bignum algorithms are a very difficult problem; Efficient algorithms have better complexity than naive ones; you can find difficult books explaining them (the underlying math is pretty hard). See also this answer.

    If you want to make a competitive bignum implementation, be prepared to work hard several years, and make it a PhD thesis.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am trying to use geocoding to get the latitudes/longitudes of a given place
I am looking for a sound algorithm that would randomly place a given number
Given the following conditions: two BigDecimal values: b1 and b2 ; x - Integer;
Given the above dynamically generated text (meaning that I can't just use an image),
I am writing a framework that will connect to many different data source types
Given a very simple object: class User { private Integer id; private String name;
For example, given an integer array and its two consecutive sequence 's beginning position
In this problem r is a fixed positive integer. You are given N rectangles,
You are given a positive integer A. The goal is to construct the shortest
Given: Two vertically placed elements on the screen (ViewPager and Fragment) Action in the

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.