Interview Question






Comment hidden because of low score. Click to expand.
0
of 2 vote

It seems to be imposible or you missed something

- akormushin November 27, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

I think the question is missing something, because I can't come up with any computationally feasible solution(Turing decidable), mathematical feasible ones... yeah... because it's quite easy to see that the amount of possible integer coefficient polynomials are countable, and the amount of values it can take are uncountable.

- Anonymous December 31, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 2 vote

Let f be the polynomial.
f(1) and f(f(1)+1)

The solution was discussed in one of the 'gifts' here
It's discussed in Lipton's blog post, some mathematical gifts.

Wow, no links allowed in the comments... careercup is such an amazing website...

- Mgccl January 09, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

care to elaborate?

- Anonymous January 31, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

Remember this question is a brain teaser, ..for any polynomial two questions can be asked.
1. What is the degree? 2.What is the coefficient of the highest degree.
You can then visualize a graph based on this info and proceed further.

- Anonymous June 10, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

What are the zeros? What is the coefficient of highest degree?

- Anonymous June 28, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
-2
of 2 vote

Evaluate on 0 and x, where x has the following property...
For every positive integer k, x^k can not be expressed as a integral linear combination of {x^i | i\in N-{k}}...

- Mgccl December 30, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

In fact, any transcendental number will do because transcendental number are algebraically independent to itself.

- Mgccl December 30, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

Care to elaborate?

- Anonymous January 31, 2013 | Flag


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More