answersLogoWhite

0


Best Answer

THE ANSWER IS YES. IT CAN BE MODIFIED. THE MOD. IS CALLED A "MARS CAP CONVERSION" THE ONLY THING IS THAT THE BANDS YOU ARE WANTING TO GET TO ARE CONSIDERED COMMERICAL BANDS AND IT IS NOT A LEGAL MOD. IT IS A SIMPLE MOD. THAT CAN BE DONE IN LESS THAN 60 SECS. BUT AS I SAID THE PROBLEM IS IS FINDING SOME ONE THAT WILL DO IT. MOST RADIO SHOPS WILL NOT TOUCH IT. FROM TIME TO TME YOU CAN FIND THE VX150 ON EBAY AND THE SELLER IS WILLING TO DO THE MOD FOR YOU. OTHER THAN THAT GOOD LUCK AND I HOPE I ANSWERED YOUR QUESTION

User Avatar

Wiki User

16y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Can the vertex vx-150 be modified to extend transmit and receive?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Movies & Television

The vertex of ABC is?

there will be three vertex AB, BC, AC


Height of triangle?

The height of a triangle is the perpendicular distance measured from the chosen base (or base extension*) to its opposite vertex (or apex)+.* If any of the shorter sides of an obtuse triangle is chosen to be the base, an extension need to be drawn to this base so that a perpendicular can be constructed from the apex down to this base extension.There are three sides to a triangle, hence three possible bases. Each base will have a corresponding height that is measured from the opposite vertex or apex+.A vertex is the point when 2 sides of a figure intersect.(Read more: vertex)+ A triangle has 3 vertices. 2 vertices defines the length of the base. There remains one vertex that is not touching the base. This vertex is opposite to the base (or base extension) and it is referred to as the apex.


What is the vertex of the quadratic equation y equals x squared minus x plus 72?

(1/2, 71 and 3/4)or(0.5, 71.75)


What is the maximum number of distinct edges in an undirected graph with N vertices?

Let G be a complete graph with n vertices. Consider the case where n=2. With only 2 vertices it is clear that there will only be one edge. Now add one more vertex to get n = 3. We must now add edges between the two old vertices and the new one for a total of 3 vertices. We see that adding a vertex to a graph with n vertices gives us n more edges. We get the following sequence Edges on a graph with n vertices: 0+1+2+3+4+5+...+n-1. Adding this to itself and dividing by two yields the following formula for the number of edges on a complete graph with n vertices: n(n-1)/2.


What is the relationship between the focus and directrix?

i assume this is locus you are talking about, in which case: they are both the same distance from the vertex - focal length, focus is a point: P(x,y) and directrix is a horizontal line e.g. y=-1