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 5980175
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T21:45:50+00:00 2026-05-22T21:45:50+00:00

I have two arrays, say A={1, 2, 3} and B={2, 4, 8} (array item

  • 0

I have two arrays, say A={1, 2, 3} and B={2, 4, 8} (array item count and numbers may vary). How do I find a bijection between the arrays.

In this case, it would be f:A->B; f(x)=2^(x)

  • 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-05-22T21:45:51+00:00Added an answer on May 22, 2026 at 9:45 pm

    As others have remarked, this problem is ill-defined.

    Other possible functions that give the same results are (among probably infinite others): (8 x)/3 – x^2 + x^3/3, x + (37 x^2)/18 – (4 x^3)/3 + (5 x^4)/18, and (259 x^3)/54 – (31 x^4)/9 + (35 x^5)/54.

    I found these solutions using:

    n = 5; (* try various other values *)
    A = {1, 2, 3} ; B = {2, 4, 8}
    eqs = Table[
      Sum[a[i] x[[1]]^i, {i, n}] == x[[2]], {x, {A, B}\[Transpose]}]
    sol = Solve[eqs, Table[a[i], {i, n}], Reals]
    Sum[a[i] x^i, {i, n}] /. sol
    

    Sometimes not all of the a[i]’s are fully determined and you may come up with values of your own.

    [tip: better not use variables starting with a capital letter in Mathematica so as not to get into conflict with reserved words]

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

Sidebar

Related Questions

i have two arrays say arrOne and arrTwo . now arrOne is having 27
I have two questions: 1. How to break a string into an array given
so let's say that I have a static variable, which is an array of
Let's say I have two SQL tables: QYZ: id, uid<user id, FK*>, somedatacolumn USERS:
I am trying to implement a simple decimation algorithm in c++. I have two
Let's say we have a particularly simple function like import scipy as sp def
I'm not sure how to title the question I have so I can't be
I have an issue with NSMutableArray and scope I am hoping to get some
So my program, when instantiated asks the user how many items they want. My
I am doing a project in which I must make threads communicate. For instance

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.